./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 1eb62d582bb1f498de7f5f7de60817c0efb48782 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 1eb62d582bb1f498de7f5f7de60817c0efb48782 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:02:10,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:02:10,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:02:10,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:02:10,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:02:10,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:02:10,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:02:10,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:02:10,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:02:10,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:02:10,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:02:10,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:02:10,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:02:10,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:02:10,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:02:10,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:02:10,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:02:10,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:02:10,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:02:10,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:02:10,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:02:10,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:02:10,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:02:10,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:02:10,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:02:10,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:02:10,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:02:10,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:02:10,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:02:10,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:02:10,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:02:10,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:02:10,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:02:10,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:02:10,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:02:10,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:02:10,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:02:10,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:02:10,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:02:10,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:02:10,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:02:10,747 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:02:10,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:02:10,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:02:10,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:02:10,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:02:10,782 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:02:10,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:02:10,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:02:10,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:02:10,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:02:10,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:02:10,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:02:10,784 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:02:10,784 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:02:10,784 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:02:10,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:02:10,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:02:10,785 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:02:10,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:02:10,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:02:10,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:02:10,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:02:10,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:02:10,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:02:10,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:02:10,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:02:10,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:02:10,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 -> 1eb62d582bb1f498de7f5f7de60817c0efb48782 [2019-11-16 00:02:10,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:02:10,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:02:10,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:02:10,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:02:10,825 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:02:10,826 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2019-11-16 00:02:10,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/e6a456090/43ae257c42ec499b9b38fa5d5c1a6df3/FLAG3627725e8 [2019-11-16 00:02:11,358 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:02:11,360 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2019-11-16 00:02:11,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/e6a456090/43ae257c42ec499b9b38fa5d5c1a6df3/FLAG3627725e8 [2019-11-16 00:02:11,845 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/e6a456090/43ae257c42ec499b9b38fa5d5c1a6df3 [2019-11-16 00:02:11,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:02:11,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:02:11,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:11,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:02:11,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:02:11,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:11" (1/1) ... [2019-11-16 00:02:11,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f95461d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:11, skipping insertion in model container [2019-11-16 00:02:11,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:11" (1/1) ... [2019-11-16 00:02:11,865 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:02:11,913 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:02:12,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:12,287 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:02:12,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:12,406 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:02:12,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12 WrapperNode [2019-11-16 00:02:12,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:12,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:02:12,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:02:12,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:02:12,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... [2019-11-16 00:02:12,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:02:12,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:02:12,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:02:12,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:02:12,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 [2019-11-16 00:02:12,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:02:12,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:02:12,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:02:12,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:02:12,559 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:02:12,559 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:02:12,560 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:02:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:02:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2019-11-16 00:02:12,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:02:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:02:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:02:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:02:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:02:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:02:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:02:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:02:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:02:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:02:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:02:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:02:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:02:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:02:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:02:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:02:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:02:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:02:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:02:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:02:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:02:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:02:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:02:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:02:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:02:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:02:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:02:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:02:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:02:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:02:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:02:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:02:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:02:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:02:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:02:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:02:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:02:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:02:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:02:12,571 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:02:12,572 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:02:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:02:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:02:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:02:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:02:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:02:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:02:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:02:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:02:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:02:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:02:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:02:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:02:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:02:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:02:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:02:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:02:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:02:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:02:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:02:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:02:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:02:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:02:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:02:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:02:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:02:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:02:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:02:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:02:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:02:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:02:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:02:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:02:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:02:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:02:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:02:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:02:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:02:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:02:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:02:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:02:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:02:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:02:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:02:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:02:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:02:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:02:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:02:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:02:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:02:12,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:02:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:02:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:02:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:02:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:02:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:02:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:02:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:02:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:02:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:02:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:02:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:02:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:02:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:02:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2019-11-16 00:02:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:02:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:02:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:02:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:02:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:02:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:02:12,981 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:02:13,372 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:02:13,373 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:02:13,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:13 BoogieIcfgContainer [2019-11-16 00:02:13,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:02:13,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:02:13,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:02:13,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:02:13,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:02:11" (1/3) ... [2019-11-16 00:02:13,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4e6859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:13, skipping insertion in model container [2019-11-16 00:02:13,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:12" (2/3) ... [2019-11-16 00:02:13,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4e6859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:13, skipping insertion in model container [2019-11-16 00:02:13,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:13" (3/3) ... [2019-11-16 00:02:13,379 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2019-11-16 00:02:13,387 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:02:13,394 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-16 00:02:13,404 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-16 00:02:13,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:02:13,423 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:02:13,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:02:13,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:02:13,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:02:13,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:02:13,424 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:02:13,424 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:02:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-16 00:02:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:02:13,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:13,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:13,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -651171882, now seen corresponding path program 1 times [2019-11-16 00:02:13,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:13,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819599528] [2019-11-16 00:02:13,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:13,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:13,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819599528] [2019-11-16 00:02:13,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:13,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:13,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354699680] [2019-11-16 00:02:13,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:13,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:13,707 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-16 00:02:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:14,089 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-11-16 00:02:14,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:14,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:02:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:14,101 INFO L225 Difference]: With dead ends: 165 [2019-11-16 00:02:14,101 INFO L226 Difference]: Without dead ends: 158 [2019-11-16 00:02:14,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-16 00:02:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2019-11-16 00:02:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-16 00:02:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2019-11-16 00:02:14,148 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 12 [2019-11-16 00:02:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:14,148 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2019-11-16 00:02:14,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2019-11-16 00:02:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:02:14,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:14,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:14,150 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash -651171881, now seen corresponding path program 1 times [2019-11-16 00:02:14,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:14,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903671321] [2019-11-16 00:02:14,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:14,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:14,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:14,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903671321] [2019-11-16 00:02:14,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:14,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:14,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39391063] [2019-11-16 00:02:14,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:14,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:14,266 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 4 states. [2019-11-16 00:02:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:14,718 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-11-16 00:02:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:14,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:02:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:14,720 INFO L225 Difference]: With dead ends: 156 [2019-11-16 00:02:14,721 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:02:14,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:02:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-11-16 00:02:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-16 00:02:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-11-16 00:02:14,734 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 12 [2019-11-16 00:02:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:14,734 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-11-16 00:02:14,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-11-16 00:02:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:02:14,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:14,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:14,736 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1082872635, now seen corresponding path program 1 times [2019-11-16 00:02:14,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:14,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291102530] [2019-11-16 00:02:14,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:14,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:14,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:14,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291102530] [2019-11-16 00:02:14,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:14,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:14,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805297837] [2019-11-16 00:02:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:14,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:14,924 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 8 states. [2019-11-16 00:02:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:15,581 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-16 00:02:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:15,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:02:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:15,584 INFO L225 Difference]: With dead ends: 160 [2019-11-16 00:02:15,584 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:02:15,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:02:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2019-11-16 00:02:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-16 00:02:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2019-11-16 00:02:15,598 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 19 [2019-11-16 00:02:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:15,599 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2019-11-16 00:02:15,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2019-11-16 00:02:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:02:15,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:15,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:15,601 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1082872634, now seen corresponding path program 1 times [2019-11-16 00:02:15,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:15,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967161943] [2019-11-16 00:02:15,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:15,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:15,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967161943] [2019-11-16 00:02:15,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:15,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:15,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787952753] [2019-11-16 00:02:15,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:15,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:15,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:15,746 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 7 states. [2019-11-16 00:02:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:16,168 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-16 00:02:16,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:16,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:02:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:16,170 INFO L225 Difference]: With dead ends: 157 [2019-11-16 00:02:16,170 INFO L226 Difference]: Without dead ends: 157 [2019-11-16 00:02:16,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:02:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-16 00:02:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2019-11-16 00:02:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-16 00:02:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-16 00:02:16,180 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 19 [2019-11-16 00:02:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:16,181 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-16 00:02:16,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-16 00:02:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:02:16,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:16,182 INFO L380 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] [2019-11-16 00:02:16,183 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1870248748, now seen corresponding path program 1 times [2019-11-16 00:02:16,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:16,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023275033] [2019-11-16 00:02:16,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:02:16,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023275033] [2019-11-16 00:02:16,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:16,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:16,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782547147] [2019-11-16 00:02:16,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:16,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:16,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:16,311 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 8 states. [2019-11-16 00:02:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:16,825 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2019-11-16 00:02:16,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:16,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:02:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:16,828 INFO L225 Difference]: With dead ends: 157 [2019-11-16 00:02:16,828 INFO L226 Difference]: Without dead ends: 157 [2019-11-16 00:02:16,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-16 00:02:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2019-11-16 00:02:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-16 00:02:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2019-11-16 00:02:16,835 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 28 [2019-11-16 00:02:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:16,836 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2019-11-16 00:02:16,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2019-11-16 00:02:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:02:16,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:16,837 INFO L380 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] [2019-11-16 00:02:16,842 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1870248747, now seen corresponding path program 1 times [2019-11-16 00:02:16,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:16,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169528692] [2019-11-16 00:02:16,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:16,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:02:17,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169528692] [2019-11-16 00:02:17,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:17,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:17,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808814097] [2019-11-16 00:02:17,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:17,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:17,008 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 8 states. [2019-11-16 00:02:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:17,495 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-11-16 00:02:17,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:17,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-16 00:02:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:17,497 INFO L225 Difference]: With dead ends: 156 [2019-11-16 00:02:17,497 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:02:17,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:02:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2019-11-16 00:02:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-16 00:02:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-11-16 00:02:17,505 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 28 [2019-11-16 00:02:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:17,506 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-11-16 00:02:17,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-11-16 00:02:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:02:17,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:17,508 INFO L380 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] [2019-11-16 00:02:17,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2030464787, now seen corresponding path program 1 times [2019-11-16 00:02:17,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:17,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544351093] [2019-11-16 00:02:17,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:17,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:17,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:02:17,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544351093] [2019-11-16 00:02:17,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752835439] [2019-11-16 00:02:17,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:02:17,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:17,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:02:17,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:17,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-16 00:02:17,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:18,018 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:02:18,019 INFO L496 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. [2019-11-16 00:02:18,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-16 00:02:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:02:18,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:18,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-16 00:02:18,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473583357] [2019-11-16 00:02:18,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:02:18,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:02:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:02:18,037 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 12 states. [2019-11-16 00:02:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:18,866 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-11-16 00:02:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:02:18,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-16 00:02:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:18,868 INFO L225 Difference]: With dead ends: 156 [2019-11-16 00:02:18,868 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:02:18,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:02:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:02:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2019-11-16 00:02:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-16 00:02:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2019-11-16 00:02:18,876 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 31 [2019-11-16 00:02:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:18,876 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2019-11-16 00:02:18,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:02:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2019-11-16 00:02:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:02:18,878 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:18,878 INFO L380 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] [2019-11-16 00:02:19,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:19,086 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2030464788, now seen corresponding path program 1 times [2019-11-16 00:02:19,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:19,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780593323] [2019-11-16 00:02:19,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:19,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:19,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:02:19,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780593323] [2019-11-16 00:02:19,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998003645] [2019-11-16 00:02:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:19,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-16 00:02:19,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:19,507 INFO L375 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 [2019-11-16 00:02:19,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:19,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:19,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:19,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:02:19,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:19,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-11-16 00:02:19,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:19,721 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-16 00:02:19,722 INFO L496 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. [2019-11-16 00:02:19,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-16 00:02:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:02:19,745 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:19,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-16 00:02:19,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875214224] [2019-11-16 00:02:19,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:02:19,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:02:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:02:19,747 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 16 states. [2019-11-16 00:02:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:20,826 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2019-11-16 00:02:20,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:02:20,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-16 00:02:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:20,828 INFO L225 Difference]: With dead ends: 155 [2019-11-16 00:02:20,828 INFO L226 Difference]: Without dead ends: 155 [2019-11-16 00:02:20,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-16 00:02:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2019-11-16 00:02:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-16 00:02:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2019-11-16 00:02:20,835 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 31 [2019-11-16 00:02:20,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:20,836 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2019-11-16 00:02:20,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:02:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2019-11-16 00:02:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:02:20,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:20,842 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:21,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:21,047 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1593622880, now seen corresponding path program 1 times [2019-11-16 00:02:21,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:21,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674001790] [2019-11-16 00:02:21,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:21,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:21,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:21,792 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-11-16 00:02:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:02:22,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674001790] [2019-11-16 00:02:22,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434084946] [2019-11-16 00:02:22,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:22,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:02:22,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:22,193 INFO L375 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 [2019-11-16 00:02:22,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:22,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:02:22,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:02:22,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:22,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:02:22,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:22,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:22,342 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:02:22,343 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:02:22,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:22,361 INFO L496 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. [2019-11-16 00:02:22,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-16 00:02:22,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:22,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:02:22,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:22,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:02:22,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:22,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:22,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:22,518 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:02:22,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:22,543 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-16 00:02:22,544 INFO L496 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. [2019-11-16 00:02:22,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-16 00:02:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:02:22,584 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:22,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-16 00:02:22,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974796012] [2019-11-16 00:02:22,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:02:22,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:02:22,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:22,586 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 22 states. [2019-11-16 00:02:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:24,579 INFO L93 Difference]: Finished difference Result 254 states and 274 transitions. [2019-11-16 00:02:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:02:24,580 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-16 00:02:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:24,582 INFO L225 Difference]: With dead ends: 254 [2019-11-16 00:02:24,582 INFO L226 Difference]: Without dead ends: 254 [2019-11-16 00:02:24,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:02:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-16 00:02:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 159. [2019-11-16 00:02:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-16 00:02:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2019-11-16 00:02:24,589 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 47 [2019-11-16 00:02:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2019-11-16 00:02:24,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:02:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2019-11-16 00:02:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:02:24,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:24,591 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:24,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:24,803 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1593622879, now seen corresponding path program 1 times [2019-11-16 00:02:24,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:24,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519061660] [2019-11-16 00:02:24,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:24,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:24,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:02:25,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519061660] [2019-11-16 00:02:25,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580710020] [2019-11-16 00:02:25,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:25,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:02:25,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:25,413 INFO L375 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 [2019-11-16 00:02:25,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:25,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:02:25,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:02:25,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:25,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:02:25,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:25,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:25,564 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:02:25,565 INFO L375 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 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:02:25,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:25,581 INFO L496 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. [2019-11-16 00:02:25,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-16 00:02:25,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:25,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:02:25,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:25,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:02:25,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:25,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:25,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:25,733 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:02:25,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:25,770 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-16 00:02:25,770 INFO L496 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. [2019-11-16 00:02:25,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-16 00:02:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:02:25,819 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:25,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:02:25,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765118686] [2019-11-16 00:02:25,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:02:25,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:02:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:02:25,821 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand 18 states. [2019-11-16 00:02:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:26,886 INFO L93 Difference]: Finished difference Result 263 states and 283 transitions. [2019-11-16 00:02:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:02:26,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-16 00:02:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:26,891 INFO L225 Difference]: With dead ends: 263 [2019-11-16 00:02:26,892 INFO L226 Difference]: Without dead ends: 263 [2019-11-16 00:02:26,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:02:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-16 00:02:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 176. [2019-11-16 00:02:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-16 00:02:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2019-11-16 00:02:26,899 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 47 [2019-11-16 00:02:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:26,899 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2019-11-16 00:02:26,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:02:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2019-11-16 00:02:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:02:26,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:26,900 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:27,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:27,105 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1831737025, now seen corresponding path program 1 times [2019-11-16 00:02:27,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:27,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073371971] [2019-11-16 00:02:27,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:02:27,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073371971] [2019-11-16 00:02:27,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:27,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:27,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115104349] [2019-11-16 00:02:27,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:27,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:27,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:27,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:27,208 INFO L87 Difference]: Start difference. First operand 176 states and 211 transitions. Second operand 8 states. [2019-11-16 00:02:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:27,726 INFO L93 Difference]: Finished difference Result 193 states and 227 transitions. [2019-11-16 00:02:27,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:27,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-16 00:02:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:27,728 INFO L225 Difference]: With dead ends: 193 [2019-11-16 00:02:27,728 INFO L226 Difference]: Without dead ends: 193 [2019-11-16 00:02:27,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-16 00:02:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 174. [2019-11-16 00:02:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-16 00:02:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 207 transitions. [2019-11-16 00:02:27,735 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 207 transitions. Word has length 49 [2019-11-16 00:02:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:27,735 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 207 transitions. [2019-11-16 00:02:27,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 207 transitions. [2019-11-16 00:02:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:02:27,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:27,741 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:27,741 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1831737026, now seen corresponding path program 1 times [2019-11-16 00:02:27,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:27,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286401196] [2019-11-16 00:02:27,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:02:27,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286401196] [2019-11-16 00:02:27,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:27,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:27,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447854770] [2019-11-16 00:02:27,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:27,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:27,887 INFO L87 Difference]: Start difference. First operand 174 states and 207 transitions. Second operand 8 states. [2019-11-16 00:02:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:28,421 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2019-11-16 00:02:28,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:28,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-16 00:02:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:28,423 INFO L225 Difference]: With dead ends: 191 [2019-11-16 00:02:28,423 INFO L226 Difference]: Without dead ends: 191 [2019-11-16 00:02:28,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-16 00:02:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 172. [2019-11-16 00:02:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:02:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2019-11-16 00:02:28,429 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 49 [2019-11-16 00:02:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:28,432 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2019-11-16 00:02:28,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2019-11-16 00:02:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:02:28,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:28,434 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:28,434 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:02:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:28,435 INFO L82 PathProgramCache]: Analyzing trace with hash -637063898, now seen corresponding path program 1 times [2019-11-16 00:02:28,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:28,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838801586] [2019-11-16 00:02:28,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:28,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:28,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:02:29,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838801586] [2019-11-16 00:02:29,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172452015] [2019-11-16 00:02:29,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:02:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:29,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:02:29,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:02:29,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:02:29,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:29,415 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-16 00:02:29,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:02:29,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-16 00:02:38,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:38,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:02:38,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:38,043 INFO L567 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-16 00:02:38,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:38,054 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:02:38,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2019-11-16 00:02:38,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:38,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:38,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:38,063 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:30 [2019-11-16 00:02:39,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:02:39,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:02:39,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:02:39,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:02:39,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:02:39,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2019-11-16 00:02:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:02:39,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:02:39,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2019-11-16 00:02:39,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273951195] [2019-11-16 00:02:39,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:02:39,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:02:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=841, Unknown=7, NotChecked=0, Total=930 [2019-11-16 00:02:39,948 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand 31 states. [2019-11-16 00:02:50,579 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-16 00:02:52,697 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-16 00:03:09,547 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-16 00:03:11,209 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-16 00:03:15,957 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-16 00:03:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:29,503 INFO L93 Difference]: Finished difference Result 196 states and 227 transitions. [2019-11-16 00:03:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:03:29,503 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2019-11-16 00:03:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:29,505 INFO L225 Difference]: With dead ends: 196 [2019-11-16 00:03:29,505 INFO L226 Difference]: Without dead ends: 196 [2019-11-16 00:03:29,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=215, Invalid=1932, Unknown=15, NotChecked=0, Total=2162 [2019-11-16 00:03:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-16 00:03:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2019-11-16 00:03:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:03:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 203 transitions. [2019-11-16 00:03:29,511 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 203 transitions. Word has length 51 [2019-11-16 00:03:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:29,512 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 203 transitions. [2019-11-16 00:03:29,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:03:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 203 transitions. [2019-11-16 00:03:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:03:29,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:29,512 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:29,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:29,713 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:03:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -637063897, now seen corresponding path program 1 times [2019-11-16 00:03:29,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:29,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224628215] [2019-11-16 00:03:29,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:29,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:29,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:03:30,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224628215] [2019-11-16 00:03:30,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888871705] [2019-11-16 00:03:30,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:30,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-16 00:03:30,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:30,531 INFO L375 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 [2019-11-16 00:03:30,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:30,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:30,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:30,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:03:30,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:03:30,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:30,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:30,788 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-16 00:03:30,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-16 00:03:30,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:30,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:30,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:30,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:10 [2019-11-16 00:03:40,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:40,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:03:40,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:41,023 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.0 percent of original size [2019-11-16 00:03:41,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:41,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:41,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-16 00:03:41,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:41,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:41,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:41,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:41,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-11-16 00:03:41,050 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:41,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:41,061 INFO L496 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. [2019-11-16 00:03:41,061 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:75, output treesize:44 [2019-11-16 00:03:41,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:41,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-16 00:03:41,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:41,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:41,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:03:41,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:03:41,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:41,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:41,149 INFO L496 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. [2019-11-16 00:03:41,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:14 [2019-11-16 00:03:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:03:41,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:41,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2019-11-16 00:03:41,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100854623] [2019-11-16 00:03:41,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:03:41,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:03:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=900, Unknown=3, NotChecked=0, Total=992 [2019-11-16 00:03:41,168 INFO L87 Difference]: Start difference. First operand 172 states and 203 transitions. Second operand 32 states. [2019-11-16 00:03:51,543 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-16 00:04:12,615 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:04:16,810 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-16 00:04:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:17,876 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2019-11-16 00:04:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:04:17,876 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-11-16 00:04:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:17,878 INFO L225 Difference]: With dead ends: 214 [2019-11-16 00:04:17,878 INFO L226 Difference]: Without dead ends: 214 [2019-11-16 00:04:17,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=208, Invalid=1853, Unknown=9, NotChecked=0, Total=2070 [2019-11-16 00:04:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-16 00:04:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2019-11-16 00:04:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-16 00:04:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2019-11-16 00:04:17,885 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 51 [2019-11-16 00:04:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:17,886 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2019-11-16 00:04:17,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:04:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2019-11-16 00:04:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:04:17,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:17,887 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:18,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:18,087 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:04:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1585066850, now seen corresponding path program 1 times [2019-11-16 00:04:18,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:18,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802197975] [2019-11-16 00:04:18,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:18,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:18,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:19,141 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:04:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:04:19,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802197975] [2019-11-16 00:04:19,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521922087] [2019-11-16 00:04:19,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:19,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 126 conjunts are in the unsatisfiable core [2019-11-16 00:04:19,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:19,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:19,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:04:19,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:19,766 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-16 00:04:19,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:19,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-16 00:04:19,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:04:19,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:19,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:19,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:04:19,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:19,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:19,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:19,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-16 00:04:20,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2019-11-16 00:04:20,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:20,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:20,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2019-11-16 00:04:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:20,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:20,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2019-11-16 00:04:20,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-16 00:04:20,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:20,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 112 [2019-11-16 00:04:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,736 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:20,778 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.0 percent of original size [2019-11-16 00:04:20,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:20,783 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:20,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-11-16 00:04:20,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:20,800 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:20,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:20,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:20,813 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:173, output treesize:10 [2019-11-16 00:04:25,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:25,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 149 [2019-11-16 00:04:25,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:25,323 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:04:25,324 INFO L567 ElimStorePlain]: treesize reduction 76, result has 76.1 percent of original size [2019-11-16 00:04:25,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:25,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:25,407 INFO L341 Elim1Store]: treesize reduction 33, result has 72.0 percent of original size [2019-11-16 00:04:25,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 202 [2019-11-16 00:04:25,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:25,511 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-11-16 00:04:25,511 INFO L567 ElimStorePlain]: treesize reduction 225, result has 50.2 percent of original size [2019-11-16 00:04:25,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:25,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:25,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:25,671 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-16 00:04:25,671 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-16 00:04:25,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 193 treesize of output 234 [2019-11-16 00:04:25,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:25,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:25,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:25,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:25,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:25,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:25,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:25,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:25,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:25,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:25,679 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:25,823 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-11-16 00:04:25,823 INFO L567 ElimStorePlain]: treesize reduction 198, result has 45.8 percent of original size [2019-11-16 00:04:25,824 INFO L496 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. [2019-11-16 00:04:25,825 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:224, output treesize:212 [2019-11-16 00:04:26,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:26,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:26,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 196 treesize of output 193 [2019-11-16 00:04:26,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:26,644 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:26,739 INFO L567 ElimStorePlain]: treesize reduction 97, result has 58.0 percent of original size [2019-11-16 00:04:26,740 INFO L496 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. [2019-11-16 00:04:26,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:251, output treesize:131 [2019-11-16 00:04:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:27,075 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:27,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:27,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:27,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 86 [2019-11-16 00:04:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:27,111 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:27,166 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-16 00:04:27,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:27,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:118, output treesize:28 [2019-11-16 00:04:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:27,349 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:27,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33] total 61 [2019-11-16 00:04:27,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262136257] [2019-11-16 00:04:27,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-11-16 00:04:27,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-11-16 00:04:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3561, Unknown=2, NotChecked=0, Total=3782 [2019-11-16 00:04:27,351 INFO L87 Difference]: Start difference. First operand 180 states and 212 transitions. Second operand 62 states. [2019-11-16 00:04:27,652 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:04:38,110 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-11-16 00:04:40,258 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-11-16 00:04:41,119 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-16 00:04:41,766 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-16 00:04:42,141 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-16 00:04:42,515 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-16 00:04:42,813 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-16 00:04:43,458 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 132 [2019-11-16 00:04:47,940 WARN L191 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 124 DAG size of output: 113 [2019-11-16 00:04:48,383 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-16 00:04:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:50,180 INFO L93 Difference]: Finished difference Result 213 states and 242 transitions. [2019-11-16 00:04:50,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:04:50,181 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 56 [2019-11-16 00:04:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:50,183 INFO L225 Difference]: With dead ends: 213 [2019-11-16 00:04:50,183 INFO L226 Difference]: Without dead ends: 213 [2019-11-16 00:04:50,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=497, Invalid=6639, Unknown=4, NotChecked=0, Total=7140 [2019-11-16 00:04:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-16 00:04:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 181. [2019-11-16 00:04:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-16 00:04:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2019-11-16 00:04:50,191 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 56 [2019-11-16 00:04:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:50,192 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2019-11-16 00:04:50,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-11-16 00:04:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2019-11-16 00:04:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:04:50,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:50,193 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:50,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:50,396 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:04:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1585066851, now seen corresponding path program 1 times [2019-11-16 00:04:50,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:50,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022626329] [2019-11-16 00:04:50,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:50,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:50,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:51,970 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:04:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:04:51,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022626329] [2019-11-16 00:04:51,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72570574] [2019-11-16 00:04:51,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 [2019-11-16 00:04:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:52,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 137 conjunts are in the unsatisfiable core [2019-11-16 00:04:52,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:52,235 INFO L375 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 [2019-11-16 00:04:52,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:04:52,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:04:52,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:04:52,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:04:52,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-11-16 00:04:52,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:04:52,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:04:52,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:52,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-16 00:04:52,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:52,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-11-16 00:04:52,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:04:52,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:52,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:52,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:04:53,054 INFO L567 ElimStorePlain]: treesize reduction 53, result has 57.6 percent of original size [2019-11-16 00:04:53,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-11-16 00:04:53,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:53,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:53,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:53,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2019-11-16 00:04:53,722 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_23|], 1=[|v_#length_BEFORE_CALL_18|]} [2019-11-16 00:04:53,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:04:53,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:53,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:53,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2019-11-16 00:04:53,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:53,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:53,816 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:04:53,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:53,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 72 [2019-11-16 00:04:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:53,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:53,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:53,846 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:04:53,891 INFO L567 ElimStorePlain]: treesize reduction 20, result has 75.0 percent of original size [2019-11-16 00:04:53,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:53,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2019-11-16 00:04:53,902 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:04:53,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:04:53,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:04:53,913 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:13 [2019-11-16 00:05:02,327 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_36|], 3=[|v_old(#length)_AFTER_CALL_28|]} [2019-11-16 00:05:02,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:02,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:05:02,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:02,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:02,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:02,403 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 88 [2019-11-16 00:05:02,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:02,488 INFO L567 ElimStorePlain]: treesize reduction 50, result has 78.9 percent of original size [2019-11-16 00:05:02,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:05:02,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:05:02,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:05:02,616 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-16 00:05:02,616 INFO L341 Elim1Store]: treesize reduction 78, result has 63.7 percent of original size [2019-11-16 00:05:02,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 200 [2019-11-16 00:05:02,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,632 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:05:02,753 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-11-16 00:05:02,754 INFO L567 ElimStorePlain]: treesize reduction 121, result has 56.3 percent of original size [2019-11-16 00:05:02,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:05:02,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:05:02,835 INFO L341 Elim1Store]: treesize reduction 33, result has 67.6 percent of original size [2019-11-16 00:05:02,835 INFO L375 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 120 [2019-11-16 00:05:02,836 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:05:02,934 INFO L567 ElimStorePlain]: treesize reduction 47, result has 76.3 percent of original size [2019-11-16 00:05:02,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:02,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:05:02,937 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:194, output treesize:220 [2019-11-16 00:05:02,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:02,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:03,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:03,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:03,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:03,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:03,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:05:03,976 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-11-16 00:05:04,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:04,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:04,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:04,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:04,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:04,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:05:05,106 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:05:05,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:05,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 184 treesize of output 162 [2019-11-16 00:05:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,146 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:05:05,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:05:05,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 116 [2019-11-16 00:05:05,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:05:05,191 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:05:05,363 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2019-11-16 00:05:05,364 INFO L567 ElimStorePlain]: treesize reduction 76, result has 68.3 percent of original size [2019-11-16 00:05:05,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:05:05,566 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) 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.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:05:05,568 INFO L168 Benchmark]: Toolchain (without parser) took 173720.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -65.2 MB). Peak memory consumption was 214.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:05,569 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:05,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:05,569 INFO L168 Benchmark]: Boogie Preprocessor took 67.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:05,569 INFO L168 Benchmark]: RCFGBuilder took 897.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 77.7 MB). Peak memory consumption was 77.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:05,570 INFO L168 Benchmark]: TraceAbstraction took 172193.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 995.3 MB in the beginning and 1.0 GB in the end (delta: -9.3 MB). Peak memory consumption was 165.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:05,571 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 897.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 77.7 MB). Peak memory consumption was 77.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 172193.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 995.3 MB in the beginning and 1.0 GB in the end (delta: -9.3 MB). Peak memory consumption was 165.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:05:07,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:05:07,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:05:07,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:05:07,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:05:07,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:05:07,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:05:07,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:05:07,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:05:07,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:05:07,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:05:07,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:05:07,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:05:07,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:05:07,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:05:07,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:05:07,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:05:07,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:05:07,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:05:07,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:05:07,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:05:07,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:05:07,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:05:07,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:05:07,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:05:07,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:05:07,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:05:07,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:05:07,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:05:07,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:05:07,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:05:07,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:05:07,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:05:07,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:05:07,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:05:07,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:05:07,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:05:07,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:05:07,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:05:07,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:05:07,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:05:07,826 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:05:07,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:05:07,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:05:07,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:05:07,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:05:07,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:05:07,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:05:07,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:05:07,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:05:07,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:05:07,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:05:07,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:05:07,841 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:05:07,842 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:05:07,842 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:05:07,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:05:07,842 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:05:07,842 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:05:07,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:05:07,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:05:07,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:05:07,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:05:07,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:05:07,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:05:07,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:05:07,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:05:07,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:05:07,845 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:05:07,845 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:05:07,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:05:07,845 INFO L138 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/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 -> 1eb62d582bb1f498de7f5f7de60817c0efb48782 [2019-11-16 00:05:07,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:05:07,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:05:07,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:05:07,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:05:07,892 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:05:07,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2019-11-16 00:05:07,945 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/31aefdd5d/d428212de28f4efc8334fbb9681cda32/FLAG7b8850f8a [2019-11-16 00:05:08,418 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:05:08,419 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2019-11-16 00:05:08,431 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/31aefdd5d/d428212de28f4efc8334fbb9681cda32/FLAG7b8850f8a [2019-11-16 00:05:08,450 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/uautomizer/data/31aefdd5d/d428212de28f4efc8334fbb9681cda32 [2019-11-16 00:05:08,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:05:08,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:05:08,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:08,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:05:08,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:05:08,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:08" (1/1) ... [2019-11-16 00:05:08,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213a6361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:08, skipping insertion in model container [2019-11-16 00:05:08,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:08" (1/1) ... [2019-11-16 00:05:08,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:05:08,506 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:05:08,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:08,955 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:05:09,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:09,091 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:05:09,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09 WrapperNode [2019-11-16 00:05:09,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:09,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:05:09,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:05:09,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:05:09,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... [2019-11-16 00:05:09,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:05:09,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:05:09,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:05:09,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:05:09,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 [2019-11-16 00:05:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:05:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:05:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:05:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:05:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:05:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:05:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-16 00:05:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2019-11-16 00:05:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_append [2019-11-16 00:05:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:05:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:05:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:05:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:05:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:05:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:05:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:05:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:05:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:05:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:05:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:05:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:05:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:05:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:05:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:05:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:05:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:05:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:05:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:05:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:05:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:05:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:05:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:05:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:05:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:05:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:05:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:05:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:05:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:05:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:05:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:05:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:05:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:05:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:05:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:05:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:05:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:05:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:05:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:05:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:05:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:05:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:05:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:05:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:05:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:05:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:05:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:05:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:05:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:05:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:05:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:05:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:05:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:05:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:05:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:05:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:05:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:05:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:05:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:05:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:05:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:05:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:05:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:05:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:05:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:05:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:05:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:05:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:05:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:05:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:05:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:05:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:05:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:05:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:05:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:05:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:05:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:05:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:05:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:05:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:05:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:05:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:05:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:05:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:05:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:05:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:05:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:05:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:05:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:05:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:05:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:05:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:05:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:05:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:05:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:05:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:05:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:05:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:05:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:05:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:05:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:05:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:05:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:05:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:05:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:05:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-16 00:05:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2019-11-16 00:05:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:05:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:05:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_append [2019-11-16 00:05:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:05:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:05:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:05:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:05:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:05:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:05:09,624 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:05:10,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:05:10,221 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:05:10,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:10 BoogieIcfgContainer [2019-11-16 00:05:10,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:05:10,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:05:10,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:05:10,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:05:10,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:05:08" (1/3) ... [2019-11-16 00:05:10,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b57ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:10, skipping insertion in model container [2019-11-16 00:05:10,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:09" (2/3) ... [2019-11-16 00:05:10,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b57ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:10, skipping insertion in model container [2019-11-16 00:05:10,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:10" (3/3) ... [2019-11-16 00:05:10,231 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2019-11-16 00:05:10,239 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:05:10,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-16 00:05:10,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-16 00:05:10,276 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:05:10,276 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:05:10,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:05:10,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:05:10,277 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:05:10,277 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:05:10,277 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:05:10,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:05:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-16 00:05:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:05:10,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:10,304 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:05:10,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_appendErr17REQUIRES_VIOLATION, sll_circular_appendErr6REQUIRES_VIOLATION, sll_circular_appendErr5REQUIRES_VIOLATION, sll_circular_appendErr16REQUIRES_VIOLATION, sll_circular_appendErr15REQUIRES_VIOLATION, sll_circular_appendErr4REQUIRES_VIOLATION, sll_circular_appendErr3REQUIRES_VIOLATION, sll_circular_appendErr14REQUIRES_VIOLATION, sll_circular_appendErr13REQUIRES_VIOLATION, sll_circular_appendErr2REQUIRES_VIOLATION, sll_circular_appendErr1REQUIRES_VIOLATION, sll_circular_appendErr12REQUIRES_VIOLATION, sll_circular_appendErr11REQUIRES_VIOLATION, sll_circular_appendErr0REQUIRES_VIOLATION, sll_circular_appendErr10REQUIRES_VIOLATION, sll_circular_appendErr9REQUIRES_VIOLATION, sll_circular_appendErr19REQUIRES_VIOLATION, sll_circular_appendErr8REQUIRES_VIOLATION, sll_circular_appendErr7REQUIRES_VIOLATION, sll_circular_appendErr18REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, sll_circular_destroyErr2REQUIRES_VIOLATION, sll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr3REQUIRES_VIOLATION, sll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr0REQUIRES_VIOLATION, sll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, sll_circular_destroyErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-16 00:05:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -651171882, now seen corresponding path program 1 times [2019-11-16 00:05:10,320 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:05:10,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [613463136] [2019-11-16 00:05:10,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d78abef-e542-4713-9b17-5ec07261c1b4/bin/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 [2019-11-16 00:05:10,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:05:10,552 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-11-16 00:05:10,556 INFO L168 Benchmark]: Toolchain (without parser) took 2102.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 942.9 MB in the beginning and 1.0 GB in the end (delta: -93.4 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:10,556 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:10,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:10,557 INFO L168 Benchmark]: Boogie Preprocessor took 78.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:05:10,558 INFO L168 Benchmark]: RCFGBuilder took 1050.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:10,559 INFO L168 Benchmark]: TraceAbstraction took 331.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:05:10,561 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1050.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 331.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...