./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.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_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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 082b1bde50b1883aaa9112842176e8bb0db36577 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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 082b1bde50b1883aaa9112842176e8bb0db36577 .................................................................................................................................................................................................................................................................................................................................................................... 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-15 23:24:22,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:24:22,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:24:22,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:24:22,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:24:22,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:24:22,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:24:22,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:24:22,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:24:22,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:24:22,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:24:22,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:24:22,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:24:22,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:24:22,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:24:22,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:24:22,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:24:22,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:24:22,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:24:22,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:24:22,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:24:22,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:24:22,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:24:22,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:24:22,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:24:22,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:24:22,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:24:22,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:24:22,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:24:22,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:24:22,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:24:22,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:24:22,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:24:22,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:24:22,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:24:22,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:24:22,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:24:22,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:24:22,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:24:22,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:24:22,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:24:22,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:24:22,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:24:22,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:24:22,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:24:22,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:24:22,903 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:24:22,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:24:22,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:24:22,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:24:22,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:24:22,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:24:22,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:24:22,905 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:24:22,906 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:24:22,906 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:24:22,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:24:22,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:24:22,907 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:24:22,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:24:22,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:24:22,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:24:22,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:24:22,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:24:22,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:24:22,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:24:22,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:24:22,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:24:22,910 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_821d6dc5-35d8-462d-9253-a9883d60fc18/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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2019-11-15 23:24:22,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:24:22,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:24:22,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:24:22,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:24:22,977 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:24:22,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-11-15 23:24:23,058 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/eb1344bf6/0594c02f48af4a829cbbd0f1b138fcf0/FLAGb95b5615c [2019-11-15 23:24:23,726 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:24:23,727 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-11-15 23:24:23,750 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/eb1344bf6/0594c02f48af4a829cbbd0f1b138fcf0/FLAGb95b5615c [2019-11-15 23:24:23,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/eb1344bf6/0594c02f48af4a829cbbd0f1b138fcf0 [2019-11-15 23:24:23,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:24:23,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:24:23,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:23,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:24:23,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:24:23,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:23" (1/1) ... [2019-11-15 23:24:23,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6fec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:23, skipping insertion in model container [2019-11-15 23:24:23,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:23" (1/1) ... [2019-11-15 23:24:23,977 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:24:24,034 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:24:24,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:24,547 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:24:24,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:24,675 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:24:24,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24 WrapperNode [2019-11-15 23:24:24,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:24,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:24:24,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:24:24,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:24:24,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... [2019-11-15 23:24:24,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:24:24,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:24:24,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:24:24,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:24:24,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:24,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:24:24,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:24:24,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:24:24,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:24:24,862 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:24:24,862 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:24:24,863 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 23:24:24,863 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_first [2019-11-15 23:24:24,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:24:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:24:24,864 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:24:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:24:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:24:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:24:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:24:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:24:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:24:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:24:24,868 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:24:24,868 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:24:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:24:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:24:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:24:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:24:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:24:24,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:24:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:24:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:24:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:24:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:24:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:24:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:24:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:24:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:24:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:24:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:24:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:24:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:24:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:24:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:24:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:24:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:24:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:24:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:24:24,873 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:24:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:24:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:24:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:24:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:24:24,874 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:24:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:24:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:24:24,875 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:24:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:24:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:24:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:24:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:24:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:24:24,876 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:24:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:24:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:24:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:24:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:24:24,877 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:24:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:24:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:24:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:24:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:24:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:24:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:24:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:24:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:24:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:24:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:24:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:24:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:24:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:24:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:24:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:24:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:24:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:24:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:24:24,883 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:24:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:24:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:24:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:24:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:24:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:24:24,884 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:24:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:24:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:24:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:24:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:24:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:24:24,885 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:24:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:24:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:24:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:24:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:24:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:24:24,886 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:24:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:24:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:24:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:24:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:24:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:24:24,887 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:24:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:24:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:24:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:24:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:24:24,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:24:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:24:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:24:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 23:24:24,889 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_first [2019-11-15 23:24:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:24:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:24:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:24:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:24:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:24:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:24:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:24:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:24:25,429 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:24:25,784 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:24:25,785 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 23:24:25,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:25 BoogieIcfgContainer [2019-11-15 23:24:25,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:24:25,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:24:25,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:24:25,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:24:25,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:24:23" (1/3) ... [2019-11-15 23:24:25,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3b7463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:24:25, skipping insertion in model container [2019-11-15 23:24:25,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:24" (2/3) ... [2019-11-15 23:24:25,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3b7463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:24:25, skipping insertion in model container [2019-11-15 23:24:25,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:25" (3/3) ... [2019-11-15 23:24:25,794 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2019-11-15 23:24:25,805 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:24:25,814 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-15 23:24:25,829 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-15 23:24:25,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:24:25,854 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:24:25,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:24:25,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:24:25,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:24:25,856 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:24:25,856 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:24:25,856 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:24:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 23:24:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:24:25,892 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:25,893 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:25,897 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1298825814, now seen corresponding path program 1 times [2019-11-15 23:24:25,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:25,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162024932] [2019-11-15 23:24:25,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:25,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:26,148 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-15 23:24:26,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162024932] [2019-11-15 23:24:26,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:26,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:24:26,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769576778] [2019-11-15 23:24:26,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:24:26,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:24:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:24:26,173 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2019-11-15 23:24:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:26,552 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2019-11-15 23:24:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:24:26,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:24:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:26,564 INFO L225 Difference]: With dead ends: 105 [2019-11-15 23:24:26,564 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 23:24:26,566 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-15 23:24:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 23:24:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-15 23:24:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 23:24:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2019-11-15 23:24:26,614 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 12 [2019-11-15 23:24:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:26,615 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2019-11-15 23:24:26,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:24:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2019-11-15 23:24:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:24:26,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:26,616 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:26,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1298825815, now seen corresponding path program 1 times [2019-11-15 23:24:26,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830751731] [2019-11-15 23:24:26,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:26,764 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-15 23:24:26,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830751731] [2019-11-15 23:24:26,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:26,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:24:26,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861189803] [2019-11-15 23:24:26,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:24:26,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:26,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:24:26,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:24:26,768 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 4 states. [2019-11-15 23:24:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:27,183 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-11-15 23:24:27,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:24:27,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-15 23:24:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:27,186 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:24:27,186 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 23:24:27,187 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-15 23:24:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 23:24:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-15 23:24:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:24:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-11-15 23:24:27,199 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 12 [2019-11-15 23:24:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:27,200 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-11-15 23:24:27,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:24:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-11-15 23:24:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:24:27,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:27,201 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-15 23:24:27,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1533647586, now seen corresponding path program 1 times [2019-11-15 23:24:27,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:27,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135972423] [2019-11-15 23:24:27,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:27,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:27,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:27,377 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-15 23:24:27,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135972423] [2019-11-15 23:24:27,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:27,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:27,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156997183] [2019-11-15 23:24:27,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:24:27,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:24:27,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:24:27,379 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 8 states. [2019-11-15 23:24:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:28,072 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-11-15 23:24:28,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:28,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 23:24:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:28,076 INFO L225 Difference]: With dead ends: 100 [2019-11-15 23:24:28,076 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 23:24:28,077 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-15 23:24:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 23:24:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-15 23:24:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 23:24:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-11-15 23:24:28,091 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 19 [2019-11-15 23:24:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:28,092 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-11-15 23:24:28,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:24:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-11-15 23:24:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:24:28,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:28,093 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-15 23:24:28,094 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1533647587, now seen corresponding path program 1 times [2019-11-15 23:24:28,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:28,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604927773] [2019-11-15 23:24:28,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:28,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:28,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,241 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-15 23:24:28,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604927773] [2019-11-15 23:24:28,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:28,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:28,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946785828] [2019-11-15 23:24:28,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:24:28,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:28,251 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 7 states. [2019-11-15 23:24:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:28,746 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-11-15 23:24:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:28,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-15 23:24:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:28,748 INFO L225 Difference]: With dead ends: 97 [2019-11-15 23:24:28,748 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 23:24:28,749 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-15 23:24:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 23:24:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-15 23:24:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 23:24:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-11-15 23:24:28,757 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 19 [2019-11-15 23:24:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:28,757 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-11-15 23:24:28,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:24:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-11-15 23:24:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:24:28,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:28,759 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-15 23:24:28,759 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash 163990406, now seen corresponding path program 1 times [2019-11-15 23:24:28,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:28,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853958535] [2019-11-15 23:24:28,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:28,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:28,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:28,966 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-15 23:24:28,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853958535] [2019-11-15 23:24:28,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:28,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:28,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478465007] [2019-11-15 23:24:28,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:24:28,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:24:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:24:28,968 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 8 states. [2019-11-15 23:24:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:29,454 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-15 23:24:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:29,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 23:24:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:29,456 INFO L225 Difference]: With dead ends: 97 [2019-11-15 23:24:29,456 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 23:24:29,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-15 23:24:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 23:24:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-11-15 23:24:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:24:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-11-15 23:24:29,464 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 28 [2019-11-15 23:24:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:29,467 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-11-15 23:24:29,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:24:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-11-15 23:24:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:24:29,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:29,470 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-15 23:24:29,471 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:29,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash 163990407, now seen corresponding path program 1 times [2019-11-15 23:24:29,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:29,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361166288] [2019-11-15 23:24:29,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:29,678 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-15 23:24:29,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361166288] [2019-11-15 23:24:29,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:29,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:29,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203881079] [2019-11-15 23:24:29,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:24:29,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:29,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:24:29,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:24:29,680 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 8 states. [2019-11-15 23:24:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:30,045 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-11-15 23:24:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:30,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-15 23:24:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:30,049 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:24:30,049 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 23:24:30,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-15 23:24:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 23:24:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-11-15 23:24:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 23:24:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-11-15 23:24:30,059 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 28 [2019-11-15 23:24:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:30,059 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-11-15 23:24:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:24:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-11-15 23:24:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:24:30,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:30,061 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-15 23:24:30,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2060411056, now seen corresponding path program 1 times [2019-11-15 23:24:30,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:30,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100997675] [2019-11-15 23:24:30,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:30,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:30,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:30,293 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-15 23:24:30,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100997675] [2019-11-15 23:24:30,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942317915] [2019-11-15 23:24:30,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:30,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:24:30,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:30,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:24:30,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:30,640 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-15 23:24:30,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:30,662 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:24:30,663 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-15 23:24:30,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 23:24:30,677 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-15 23:24:30,678 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:30,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-15 23:24:30,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402523064] [2019-11-15 23:24:30,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:24:30,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:24:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:24:30,680 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 12 states. [2019-11-15 23:24:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:31,565 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-11-15 23:24:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:24:31,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-15 23:24:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:31,567 INFO L225 Difference]: With dead ends: 95 [2019-11-15 23:24:31,567 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 23:24:31,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:24:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 23:24:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-11-15 23:24:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 23:24:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2019-11-15 23:24:31,579 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 31 [2019-11-15 23:24:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:31,580 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2019-11-15 23:24:31,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:24:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2019-11-15 23:24:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:24:31,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:31,581 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-15 23:24:31,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:31,785 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2060411057, now seen corresponding path program 1 times [2019-11-15 23:24:31,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:31,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433382245] [2019-11-15 23:24:31,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:31,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:31,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:32,082 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-15 23:24:32,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433382245] [2019-11-15 23:24:32,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388426740] [2019-11-15 23:24:32,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:32,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 23:24:32,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:32,253 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-15 23:24:32,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:32,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:32,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:32,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:24:32,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:32,493 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-15 23:24:32,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:32,519 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-15 23:24:32,519 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-15 23:24:32,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-11-15 23:24:32,541 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-15 23:24:32,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:32,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 23:24:32,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820966505] [2019-11-15 23:24:32,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:24:32,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:24:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:24:32,543 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 16 states. [2019-11-15 23:24:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:33,589 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-11-15 23:24:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:24:33,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-15 23:24:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:33,591 INFO L225 Difference]: With dead ends: 95 [2019-11-15 23:24:33,591 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 23:24:33,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:24:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 23:24:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-11-15 23:24:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:24:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-11-15 23:24:33,600 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 31 [2019-11-15 23:24:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:33,600 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-11-15 23:24:33,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:24:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-11-15 23:24:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:24:33,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:33,602 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:33,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:33,806 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash -290959594, now seen corresponding path program 1 times [2019-11-15 23:24:33,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:33,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671739750] [2019-11-15 23:24:33,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:33,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:33,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:24:33,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671739750] [2019-11-15 23:24:33,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:33,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:24:33,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376571795] [2019-11-15 23:24:33,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:24:33,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:33,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:24:33,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:24:33,952 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 6 states. [2019-11-15 23:24:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:34,268 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-11-15 23:24:34,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:24:34,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 23:24:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:34,271 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:24:34,271 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 23:24:34,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 23:24:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-15 23:24:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 23:24:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2019-11-15 23:24:34,276 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 37 [2019-11-15 23:24:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:34,276 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2019-11-15 23:24:34,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:24:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2019-11-15 23:24:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:24:34,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:34,289 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:34,290 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash -439121942, now seen corresponding path program 1 times [2019-11-15 23:24:34,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:34,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060759622] [2019-11-15 23:24:34,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:34,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:34,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:35,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060759622] [2019-11-15 23:24:35,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853132907] [2019-11-15 23:24:35,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:35,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 23:24:35,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:35,369 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-15 23:24:35,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:35,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:35,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:35,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:24:35,388 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-15 23:24:35,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:35,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:35,402 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-15 23:24:35,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:24:35,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:24:35,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:24:35,675 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:24:35,675 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-15 23:24:35,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:35,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:35,690 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-15 23:24:35,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-11-15 23:24:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:35,814 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:35,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2019-11-15 23:24:35,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262734979] [2019-11-15 23:24:35,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:24:35,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:35,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:24:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:24:35,816 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 23 states. [2019-11-15 23:24:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:37,635 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2019-11-15 23:24:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:24:37,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-15 23:24:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:37,637 INFO L225 Difference]: With dead ends: 145 [2019-11-15 23:24:37,637 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 23:24:37,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:24:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 23:24:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2019-11-15 23:24:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 23:24:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-15 23:24:37,645 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 39 [2019-11-15 23:24:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:37,657 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-15 23:24:37,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:24:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-15 23:24:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:24:37,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:37,658 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:37,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:37,859 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -439121941, now seen corresponding path program 1 times [2019-11-15 23:24:37,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430196315] [2019-11-15 23:24:37,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,349 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 18 [2019-11-15 23:24:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:38,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430196315] [2019-11-15 23:24:38,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534972293] [2019-11-15 23:24:38,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:24:38,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:38,498 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-15 23:24:38,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:38,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:38,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:38,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:24:38,528 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-15 23:24:38,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:38,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:38,534 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-15 23:24:38,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:24:38,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:24:38,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:24:38,697 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:24:38,698 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-15 23:24:38,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:38,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:38,710 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-15 23:24:38,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-11-15 23:24:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:38,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:38,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 23:24:38,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804241527] [2019-11-15 23:24:38,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 23:24:38,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 23:24:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:24:38,834 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 21 states. [2019-11-15 23:24:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:40,322 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2019-11-15 23:24:40,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:24:40,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-11-15 23:24:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:40,324 INFO L225 Difference]: With dead ends: 154 [2019-11-15 23:24:40,325 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 23:24:40,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:24:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 23:24:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2019-11-15 23:24:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 23:24:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2019-11-15 23:24:40,332 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 39 [2019-11-15 23:24:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:40,333 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2019-11-15 23:24:40,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 23:24:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2019-11-15 23:24:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:24:40,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:40,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:40,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:40,542 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:40,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:40,542 INFO L82 PathProgramCache]: Analyzing trace with hash -727878259, now seen corresponding path program 1 times [2019-11-15 23:24:40,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:40,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396830947] [2019-11-15 23:24:40,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:40,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:40,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:24:40,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396830947] [2019-11-15 23:24:40,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:40,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:24:40,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235151975] [2019-11-15 23:24:40,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:24:40,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:24:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:24:40,818 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand 15 states. [2019-11-15 23:24:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:41,954 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2019-11-15 23:24:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:24:41,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-15 23:24:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:41,956 INFO L225 Difference]: With dead ends: 184 [2019-11-15 23:24:41,956 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 23:24:41,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:24:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 23:24:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 138. [2019-11-15 23:24:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 23:24:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2019-11-15 23:24:41,969 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 40 [2019-11-15 23:24:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2019-11-15 23:24:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:24:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2019-11-15 23:24:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:24:41,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:41,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:41,977 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash -727878258, now seen corresponding path program 1 times [2019-11-15 23:24:41,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:41,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534544470] [2019-11-15 23:24:41,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:41,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:42,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534544470] [2019-11-15 23:24:42,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:42,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:24:42,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728633558] [2019-11-15 23:24:42,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:24:42,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:42,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:24:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:24:42,354 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand 15 states. [2019-11-15 23:24:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:43,500 INFO L93 Difference]: Finished difference Result 187 states and 230 transitions. [2019-11-15 23:24:43,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:24:43,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-15 23:24:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:43,503 INFO L225 Difference]: With dead ends: 187 [2019-11-15 23:24:43,503 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 23:24:43,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:24:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 23:24:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 138. [2019-11-15 23:24:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 23:24:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2019-11-15 23:24:43,510 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 40 [2019-11-15 23:24:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:43,511 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2019-11-15 23:24:43,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:24:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2019-11-15 23:24:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:24:43,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:43,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:43,512 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 543954964, now seen corresponding path program 1 times [2019-11-15 23:24:43,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:43,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370826035] [2019-11-15 23:24:43,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:43,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:43,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:43,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370826035] [2019-11-15 23:24:43,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:43,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:24:43,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547429171] [2019-11-15 23:24:43,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:24:43,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:24:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:24:43,770 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand 15 states. [2019-11-15 23:24:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:44,632 INFO L93 Difference]: Finished difference Result 213 states and 267 transitions. [2019-11-15 23:24:44,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:24:44,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-11-15 23:24:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:44,635 INFO L225 Difference]: With dead ends: 213 [2019-11-15 23:24:44,635 INFO L226 Difference]: Without dead ends: 213 [2019-11-15 23:24:44,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:24:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-15 23:24:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 174. [2019-11-15 23:24:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 23:24:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 229 transitions. [2019-11-15 23:24:44,647 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 229 transitions. Word has length 45 [2019-11-15 23:24:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:44,648 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 229 transitions. [2019-11-15 23:24:44,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:24:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2019-11-15 23:24:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:24:44,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:44,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:44,650 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -316834220, now seen corresponding path program 1 times [2019-11-15 23:24:44,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:44,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672083435] [2019-11-15 23:24:44,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:44,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:44,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:24:44,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672083435] [2019-11-15 23:24:44,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:44,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:24:44,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760658543] [2019-11-15 23:24:44,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:24:44,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:24:44,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:24:44,775 INFO L87 Difference]: Start difference. First operand 174 states and 229 transitions. Second operand 8 states. [2019-11-15 23:24:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:45,163 INFO L93 Difference]: Finished difference Result 175 states and 229 transitions. [2019-11-15 23:24:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:45,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-15 23:24:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:45,165 INFO L225 Difference]: With dead ends: 175 [2019-11-15 23:24:45,165 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 23:24:45,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:24:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 23:24:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-11-15 23:24:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 23:24:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 229 transitions. [2019-11-15 23:24:45,174 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 229 transitions. Word has length 46 [2019-11-15 23:24:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:45,174 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 229 transitions. [2019-11-15 23:24:45,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:24:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2019-11-15 23:24:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:24:45,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:45,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:45,176 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash -316834219, now seen corresponding path program 1 times [2019-11-15 23:24:45,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:45,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734698575] [2019-11-15 23:24:45,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:45,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:45,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:45,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734698575] [2019-11-15 23:24:45,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:45,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 23:24:45,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961732424] [2019-11-15 23:24:45,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:24:45,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:45,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:24:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:24:45,578 INFO L87 Difference]: Start difference. First operand 174 states and 229 transitions. Second operand 17 states. [2019-11-15 23:24:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:46,705 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2019-11-15 23:24:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:24:46,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-11-15 23:24:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:46,708 INFO L225 Difference]: With dead ends: 253 [2019-11-15 23:24:46,708 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 23:24:46,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:24:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 23:24:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2019-11-15 23:24:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-15 23:24:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2019-11-15 23:24:46,727 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 46 [2019-11-15 23:24:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:46,728 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2019-11-15 23:24:46,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:24:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2019-11-15 23:24:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:24:46,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:46,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:46,731 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -317265169, now seen corresponding path program 1 times [2019-11-15 23:24:46,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:46,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453449637] [2019-11-15 23:24:46,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:46,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:46,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:47,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453449637] [2019-11-15 23:24:47,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:47,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 23:24:47,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994419438] [2019-11-15 23:24:47,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:24:47,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:24:47,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:24:47,030 INFO L87 Difference]: Start difference. First operand 208 states and 280 transitions. Second operand 15 states. [2019-11-15 23:24:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:47,893 INFO L93 Difference]: Finished difference Result 243 states and 319 transitions. [2019-11-15 23:24:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:24:47,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-11-15 23:24:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:47,895 INFO L225 Difference]: With dead ends: 243 [2019-11-15 23:24:47,895 INFO L226 Difference]: Without dead ends: 243 [2019-11-15 23:24:47,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:24:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-15 23:24:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 214. [2019-11-15 23:24:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-15 23:24:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 287 transitions. [2019-11-15 23:24:47,905 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 287 transitions. Word has length 46 [2019-11-15 23:24:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:47,906 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 287 transitions. [2019-11-15 23:24:47,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:24:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 287 transitions. [2019-11-15 23:24:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:24:47,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:47,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:47,908 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:47,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1245285514, now seen corresponding path program 1 times [2019-11-15 23:24:47,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:47,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296448860] [2019-11-15 23:24:47,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:47,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:47,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:24:48,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296448860] [2019-11-15 23:24:48,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:48,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:24:48,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918909772] [2019-11-15 23:24:48,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:24:48,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:24:48,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:24:48,003 INFO L87 Difference]: Start difference. First operand 214 states and 287 transitions. Second operand 7 states. [2019-11-15 23:24:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:48,292 INFO L93 Difference]: Finished difference Result 213 states and 283 transitions. [2019-11-15 23:24:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:24:48,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 23:24:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:48,299 INFO L225 Difference]: With dead ends: 213 [2019-11-15 23:24:48,299 INFO L226 Difference]: Without dead ends: 213 [2019-11-15 23:24:48,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:24:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-15 23:24:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-11-15 23:24:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-15 23:24:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2019-11-15 23:24:48,310 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 47 [2019-11-15 23:24:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:48,310 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2019-11-15 23:24:48,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:24:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2019-11-15 23:24:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:24:48,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:48,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:48,312 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 50854866, now seen corresponding path program 1 times [2019-11-15 23:24:48,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:48,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246930747] [2019-11-15 23:24:48,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:48,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:48,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:48,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246930747] [2019-11-15 23:24:48,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:48,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-15 23:24:48,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985782314] [2019-11-15 23:24:48,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:24:48,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:24:48,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:24:48,667 INFO L87 Difference]: Start difference. First operand 213 states and 283 transitions. Second operand 19 states. [2019-11-15 23:24:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:49,678 INFO L93 Difference]: Finished difference Result 240 states and 311 transitions. [2019-11-15 23:24:49,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 23:24:49,679 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-11-15 23:24:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:49,680 INFO L225 Difference]: With dead ends: 240 [2019-11-15 23:24:49,680 INFO L226 Difference]: Without dead ends: 240 [2019-11-15 23:24:49,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 23:24:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-15 23:24:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2019-11-15 23:24:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 23:24:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2019-11-15 23:24:49,694 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 48 [2019-11-15 23:24:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:49,695 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2019-11-15 23:24:49,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:24:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2019-11-15 23:24:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:24:49,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:49,696 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:49,696 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash 951737016, now seen corresponding path program 2 times [2019-11-15 23:24:49,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:49,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101865059] [2019-11-15 23:24:49,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:49,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:49,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:24:49,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101865059] [2019-11-15 23:24:49,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181432490] [2019-11-15 23:24:49,883 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:50,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:24:50,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:24:50,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:24:50,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 23:24:50,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:50,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 23:24:50,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391083879] [2019-11-15 23:24:50,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:24:50,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:50,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:24:50,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:24:50,116 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 9 states. [2019-11-15 23:24:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:50,381 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2019-11-15 23:24:50,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:24:50,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-15 23:24:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:50,384 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:24:50,384 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:24:50,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:24:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:24:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-15 23:24:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:24:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2019-11-15 23:24:50,389 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 51 [2019-11-15 23:24:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:50,389 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2019-11-15 23:24:50,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:24:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2019-11-15 23:24:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:24:50,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:50,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:50,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:50,591 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1410949234, now seen corresponding path program 1 times [2019-11-15 23:24:50,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:50,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270904418] [2019-11-15 23:24:50,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:50,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:50,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:24:50,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270904418] [2019-11-15 23:24:50,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:50,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 23:24:50,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041414004] [2019-11-15 23:24:50,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:24:50,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:24:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:24:50,788 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 13 states. [2019-11-15 23:24:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:51,402 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-11-15 23:24:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:24:51,402 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-11-15 23:24:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:51,403 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:24:51,403 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:24:51,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:24:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:24:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2019-11-15 23:24:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 23:24:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2019-11-15 23:24:51,407 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 51 [2019-11-15 23:24:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:51,407 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2019-11-15 23:24:51,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:24:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2019-11-15 23:24:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:24:51,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:51,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:51,408 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1411001849, now seen corresponding path program 1 times [2019-11-15 23:24:51,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:51,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808820872] [2019-11-15 23:24:51,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:51,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:51,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:51,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808820872] [2019-11-15 23:24:51,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614549221] [2019-11-15 23:24:51,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:24:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:51,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 103 conjunts are in the unsatisfiable core [2019-11-15 23:24:51,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:52,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:52,329 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 28 [2019-11-15 23:24:52,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:52,354 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-15 23:24:52,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:52,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2019-11-15 23:24:52,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:24:52,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:52,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:52,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:24:52,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:52,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:52,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:24:52,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-11-15 23:24:52,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:24:52,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:52,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 40 [2019-11-15 23:24:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:52,669 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-15 23:24:52,721 INFO L567 ElimStorePlain]: treesize reduction 12, result has 85.0 percent of original size [2019-11-15 23:24:52,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:52,743 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 41 treesize of output 55 [2019-11-15 23:24:52,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:52,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:24:52,782 INFO L567 ElimStorePlain]: treesize reduction 37, result has 63.7 percent of original size [2019-11-15 23:24:52,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:52,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:52,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:64 [2019-11-15 23:24:52,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:53,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,545 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 74 [2019-11-15 23:24:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:53,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:24:53,593 INFO L567 ElimStorePlain]: treesize reduction 54, result has 52.6 percent of original size [2019-11-15 23:24:53,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:53,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:113, output treesize:59 [2019-11-15 23:24:53,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:53,870 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:24:53,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:53,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2019-11-15 23:24:53,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:53,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:24:53,877 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-15 23:24:53,907 INFO L567 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2019-11-15 23:24:53,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:53,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2019-11-15 23:24:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:54,099 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:24:54,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 51 [2019-11-15 23:24:54,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460687789] [2019-11-15 23:24:54,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-15 23:24:54,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:54,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-15 23:24:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2505, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 23:24:54,101 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 52 states. [2019-11-15 23:24:55,085 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-15 23:24:56,112 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-11-15 23:24:57,159 WARN L191 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-11-15 23:24:58,562 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-11-15 23:24:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:59,449 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2019-11-15 23:24:59,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:24:59,451 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-11-15 23:24:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:59,452 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:24:59,452 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:24:59,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=447, Invalid=5253, Unknown=0, NotChecked=0, Total=5700 [2019-11-15 23:24:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:24:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-11-15 23:24:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:24:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2019-11-15 23:24:59,457 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 51 [2019-11-15 23:24:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:59,458 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2019-11-15 23:24:59,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-15 23:24:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2019-11-15 23:24:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:24:59,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:59,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:59,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:24:59,662 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:24:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1411001850, now seen corresponding path program 1 times [2019-11-15 23:24:59,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:59,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636097111] [2019-11-15 23:24:59,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:59,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:00,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636097111] [2019-11-15 23:25:00,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014090027] [2019-11-15 23:25:00,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:25:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:00,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 106 conjunts are in the unsatisfiable core [2019-11-15 23:25:00,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:01,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:01,250 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 14 treesize of output 30 [2019-11-15 23:25:01,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:01,277 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-11-15 23:25:01,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:01,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:28 [2019-11-15 23:25:01,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:01,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:01,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:01,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:01,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:01,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:01,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:01,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2019-11-15 23:25:01,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:01,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:01,558 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 46 [2019-11-15 23:25:01,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,559 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-15 23:25:01,596 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.0 percent of original size [2019-11-15 23:25:01,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:01,614 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 52 treesize of output 62 [2019-11-15 23:25:01,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:25:01,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:25:01,715 INFO L567 ElimStorePlain]: treesize reduction 182, result has 28.1 percent of original size [2019-11-15 23:25:01,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:01,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:70 [2019-11-15 23:25:01,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:01,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:02,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:02,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:02,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:02,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 72 [2019-11-15 23:25:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:02,896 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-15 23:25:02,930 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.0 percent of original size [2019-11-15 23:25:02,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 26 [2019-11-15 23:25:02,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:02,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:02,943 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-15 23:25:02,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:23 [2019-11-15 23:25:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:03,088 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:03,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30] total 54 [2019-11-15 23:25:03,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840364354] [2019-11-15 23:25:03,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 23:25:03,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:03,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 23:25:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2828, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 23:25:03,091 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 55 states. [2019-11-15 23:25:04,483 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-15 23:25:04,946 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-15 23:25:05,626 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-15 23:25:05,866 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-15 23:25:06,089 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-11-15 23:25:06,338 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-11-15 23:25:06,693 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-11-15 23:25:07,061 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-11-15 23:25:07,299 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-11-15 23:25:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:08,646 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2019-11-15 23:25:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 23:25:08,646 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-11-15 23:25:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:08,647 INFO L225 Difference]: With dead ends: 144 [2019-11-15 23:25:08,648 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:25:08,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=445, Invalid=6035, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 23:25:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:25:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 129. [2019-11-15 23:25:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 23:25:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-11-15 23:25:08,654 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 51 [2019-11-15 23:25:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:08,654 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-11-15 23:25:08,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 23:25:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-11-15 23:25:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:25:08,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:08,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:08,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:08,859 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:08,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2030376395, now seen corresponding path program 1 times [2019-11-15 23:25:08,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:08,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897658321] [2019-11-15 23:25:08,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:08,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:08,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:25:08,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897658321] [2019-11-15 23:25:08,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:25:08,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:25:08,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498624852] [2019-11-15 23:25:08,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:25:08,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:25:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:25:08,966 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 8 states. [2019-11-15 23:25:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:09,209 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2019-11-15 23:25:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:25:09,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-15 23:25:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:09,211 INFO L225 Difference]: With dead ends: 127 [2019-11-15 23:25:09,211 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 23:25:09,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:25:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 23:25:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-15 23:25:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 23:25:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2019-11-15 23:25:09,215 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 53 [2019-11-15 23:25:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:09,216 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2019-11-15 23:25:09,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:25:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2019-11-15 23:25:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:25:09,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:09,216 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, 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-15 23:25:09,217 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1276562601, now seen corresponding path program 1 times [2019-11-15 23:25:09,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:09,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866381051] [2019-11-15 23:25:09,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:09,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:09,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:25:09,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866381051] [2019-11-15 23:25:09,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303364533] [2019-11-15 23:25:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:25:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:09,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:25:09,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:25:09,525 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:09,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-15 23:25:09,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71099038] [2019-11-15 23:25:09,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:25:09,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:25:09,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:25:09,526 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 10 states. [2019-11-15 23:25:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:09,743 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2019-11-15 23:25:09,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:25:09,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-11-15 23:25:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:09,744 INFO L225 Difference]: With dead ends: 135 [2019-11-15 23:25:09,744 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 23:25:09,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:25:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 23:25:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2019-11-15 23:25:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 23:25:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2019-11-15 23:25:09,750 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 55 [2019-11-15 23:25:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:09,750 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2019-11-15 23:25:09,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:25:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2019-11-15 23:25:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:25:09,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:09,751 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:09,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:09,955 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash -913370610, now seen corresponding path program 1 times [2019-11-15 23:25:09,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:09,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907464063] [2019-11-15 23:25:09,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:09,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:09,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:11,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907464063] [2019-11-15 23:25:11,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371853073] [2019-11-15 23:25:11,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:11,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-15 23:25:11,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:11,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:11,545 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-15 23:25:11,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:11,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:11,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:11,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:25:11,605 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-15 23:25:11,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:11,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:11,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:11,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 23:25:11,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:11,696 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 28 treesize of output 46 [2019-11-15 23:25:11,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:11,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:11,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:11,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:11,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2019-11-15 23:25:12,241 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 27 treesize of output 19 [2019-11-15 23:25:12,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:12,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:12,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:12,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2019-11-15 23:25:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:12,339 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:12,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 61 [2019-11-15 23:25:12,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400068818] [2019-11-15 23:25:12,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-15 23:25:12,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-15 23:25:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3462, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 23:25:12,341 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand 61 states. [2019-11-15 23:25:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:15,695 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-11-15 23:25:15,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:25:15,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 56 [2019-11-15 23:25:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:15,696 INFO L225 Difference]: With dead ends: 115 [2019-11-15 23:25:15,696 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 23:25:15,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=581, Invalid=7609, Unknown=0, NotChecked=0, Total=8190 [2019-11-15 23:25:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 23:25:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-15 23:25:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:25:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-15 23:25:15,702 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 56 [2019-11-15 23:25:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:15,703 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-15 23:25:15,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-15 23:25:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-15 23:25:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:25:15,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:15,704 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:15,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:15,910 INFO L410 AbstractCegarLoop]: === Iteration 27 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:15,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1539198995, now seen corresponding path program 1 times [2019-11-15 23:25:15,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:15,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153367510] [2019-11-15 23:25:15,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:15,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:15,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:16,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153367510] [2019-11-15 23:25:16,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807998848] [2019-11-15 23:25:16,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:16,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 99 conjunts are in the unsatisfiable core [2019-11-15 23:25:16,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:17,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:17,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:17,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:17,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:17,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:17,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:17,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:17,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-15 23:25:17,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:17,636 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 45 treesize of output 59 [2019-11-15 23:25:17,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:17,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:25:17,671 INFO L567 ElimStorePlain]: treesize reduction 41, result has 58.2 percent of original size [2019-11-15 23:25:17,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:17,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:17,683 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 65 [2019-11-15 23:25:17,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:17,683 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:17,710 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-11-15 23:25:17,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:17,711 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-15 23:25:17,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:56 [2019-11-15 23:25:17,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:17,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:17,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:19,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:19,193 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:19,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 57 [2019-11-15 23:25:19,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:19,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:25:19,248 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.5 percent of original size [2019-11-15 23:25:19,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:19,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:115, output treesize:111 [2019-11-15 23:25:19,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:19,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:19,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2019-11-15 23:25:19,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:19,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,529 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-15 23:25:19,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2019-11-15 23:25:19,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:19,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:19,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-15 23:25:19,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:143, output treesize:119 [2019-11-15 23:25:19,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:19,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:19,786 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 61 treesize of output 44 [2019-11-15 23:25:19,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:19,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:19,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:19,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2019-11-15 23:25:19,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:19,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:19,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:19,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:127, output treesize:7 [2019-11-15 23:25:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:19,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:19,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2019-11-15 23:25:19,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642525114] [2019-11-15 23:25:19,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 23:25:19,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 23:25:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3141, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 23:25:19,872 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 58 states. [2019-11-15 23:25:20,942 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-15 23:25:21,582 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-15 23:25:21,830 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-11-15 23:25:22,098 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-11-15 23:25:22,353 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-15 23:25:22,616 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-15 23:25:22,859 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-15 23:25:23,126 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-15 23:25:23,391 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-15 23:25:23,817 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-11-15 23:25:24,151 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-11-15 23:25:24,616 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-11-15 23:25:25,032 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-11-15 23:25:25,516 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-15 23:25:25,760 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-11-15 23:25:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:26,366 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2019-11-15 23:25:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 23:25:26,367 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 56 [2019-11-15 23:25:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:26,368 INFO L225 Difference]: With dead ends: 130 [2019-11-15 23:25:26,368 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 23:25:26,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=499, Invalid=7333, Unknown=0, NotChecked=0, Total=7832 [2019-11-15 23:25:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 23:25:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2019-11-15 23:25:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 23:25:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2019-11-15 23:25:26,372 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 56 [2019-11-15 23:25:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:26,373 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2019-11-15 23:25:26,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 23:25:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2019-11-15 23:25:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:25:26,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:26,374 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:26,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:26,577 INFO L410 AbstractCegarLoop]: === Iteration 28 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1539146380, now seen corresponding path program 2 times [2019-11-15 23:25:26,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:26,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930211708] [2019-11-15 23:25:26,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:26,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:26,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:27,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930211708] [2019-11-15 23:25:27,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604446669] [2019-11-15 23:25:27,232 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:27,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:25:27,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:25:27,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 103 conjunts are in the unsatisfiable core [2019-11-15 23:25:27,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:27,481 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-15 23:25:27,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:25:27,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,717 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-15 23:25:27,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-11-15 23:25:27,877 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-15 23:25:27,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,894 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-15 23:25:27,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:27,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:27,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-11-15 23:25:28,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:28,108 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 55 treesize of output 73 [2019-11-15 23:25:28,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:28,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:28,128 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 39 treesize of output 33 [2019-11-15 23:25:28,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:28,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:28,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:28,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2019-11-15 23:25:28,724 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:28,724 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 120 [2019-11-15 23:25:28,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,727 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-15 23:25:28,748 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.8 percent of original size [2019-11-15 23:25:28,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:28,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:144, output treesize:62 [2019-11-15 23:25:28,899 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:28,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:28,914 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 60 treesize of output 54 [2019-11-15 23:25:28,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:28,916 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-15 23:25:28,932 INFO L567 ElimStorePlain]: treesize reduction 16, result has 55.6 percent of original size [2019-11-15 23:25:28,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:28,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:5 [2019-11-15 23:25:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:28,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:28,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 46 [2019-11-15 23:25:28,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681964753] [2019-11-15 23:25:28,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 23:25:28,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 23:25:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 23:25:28,949 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 47 states. [2019-11-15 23:25:29,978 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-15 23:25:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:31,629 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-11-15 23:25:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:25:31,629 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2019-11-15 23:25:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:31,630 INFO L225 Difference]: With dead ends: 123 [2019-11-15 23:25:31,630 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 23:25:31,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=337, Invalid=3823, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 23:25:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 23:25:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-11-15 23:25:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:25:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2019-11-15 23:25:31,634 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 56 [2019-11-15 23:25:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:31,635 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2019-11-15 23:25:31,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 23:25:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2019-11-15 23:25:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:25:31,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:31,636 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:31,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:31,840 INFO L410 AbstractCegarLoop]: === Iteration 29 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1539146379, now seen corresponding path program 2 times [2019-11-15 23:25:31,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:31,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879434087] [2019-11-15 23:25:31,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:31,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:31,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:32,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879434087] [2019-11-15 23:25:32,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772590253] [2019-11-15 23:25:32,516 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:32,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:25:32,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:25:32,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-15 23:25:32,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:32,710 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-15 23:25:32,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:32,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:32,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:32,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:25:33,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,036 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-15 23:25:33,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-15 23:25:33,143 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-15 23:25:33,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,157 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-15 23:25:33,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2019-11-15 23:25:33,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:33,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,291 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 55 treesize of output 57 [2019-11-15 23:25:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:33,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,306 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 53 treesize of output 39 [2019-11-15 23:25:33,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:33,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:33,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2019-11-15 23:25:34,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:34,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:34,353 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 190 treesize of output 123 [2019-11-15 23:25:34,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:34,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:34,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:34,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:34,356 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-15 23:25:34,407 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-11-15 23:25:34,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:34,418 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 40 [2019-11-15 23:25:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:34,420 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-15 23:25:34,442 INFO L567 ElimStorePlain]: treesize reduction 12, result has 69.2 percent of original size [2019-11-15 23:25:34,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:34,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:211, output treesize:13 [2019-11-15 23:25:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:25:34,511 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:34,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 55 [2019-11-15 23:25:34,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929241683] [2019-11-15 23:25:34,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 23:25:34,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 23:25:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 23:25:34,513 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 55 states. [2019-11-15 23:25:35,319 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-15 23:25:36,799 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-15 23:25:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:37,371 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-15 23:25:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 23:25:37,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-11-15 23:25:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:37,372 INFO L225 Difference]: With dead ends: 107 [2019-11-15 23:25:37,372 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 23:25:37,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=364, Invalid=4748, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 23:25:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 23:25:37,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-15 23:25:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:25:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-15 23:25:37,376 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 56 [2019-11-15 23:25:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:37,376 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-15 23:25:37,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 23:25:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-15 23:25:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 23:25:37,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:37,376 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:37,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:37,581 INFO L410 AbstractCegarLoop]: === Iteration 30 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash -470528415, now seen corresponding path program 1 times [2019-11-15 23:25:37,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:37,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017068281] [2019-11-15 23:25:37,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:37,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:37,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:38,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017068281] [2019-11-15 23:25:38,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2572403] [2019-11-15 23:25:38,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:38,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 99 conjunts are in the unsatisfiable core [2019-11-15 23:25:38,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:38,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:38,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:38,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:38,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:38,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:38,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:38,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:38,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-11-15 23:25:38,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:38,922 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 45 treesize of output 59 [2019-11-15 23:25:38,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:25:38,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:38,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:38,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:25:38,976 INFO L567 ElimStorePlain]: treesize reduction 162, result has 27.7 percent of original size [2019-11-15 23:25:38,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:38,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:38,990 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 65 [2019-11-15 23:25:38,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:38,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:39,021 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-15 23:25:39,021 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-15 23:25:39,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:57 [2019-11-15 23:25:39,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:25:39,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 43 [2019-11-15 23:25:39,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:40,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:40,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:40,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:114, output treesize:61 [2019-11-15 23:25:40,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:40,478 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-11-15 23:25:40,479 INFO L341 Elim1Store]: treesize reduction 24, result has 79.7 percent of original size [2019-11-15 23:25:40,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 124 [2019-11-15 23:25:40,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:25:40,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:25:40,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,486 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-15 23:25:40,556 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.0 percent of original size [2019-11-15 23:25:40,557 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-15 23:25:40,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:77 [2019-11-15 23:25:40,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:40,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:40,810 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2019-11-15 23:25:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:40,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:40,880 INFO L567 ElimStorePlain]: treesize reduction 80, result has 29.2 percent of original size [2019-11-15 23:25:40,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 23:25:40,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:11 [2019-11-15 23:25:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:25:40,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:40,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2019-11-15 23:25:40,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174938831] [2019-11-15 23:25:40,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 23:25:40,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:40,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 23:25:40,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2805, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 23:25:40,913 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 55 states. [2019-11-15 23:25:41,987 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-15 23:25:43,368 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-11-15 23:25:43,625 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-11-15 23:25:44,055 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-11-15 23:25:44,342 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-11-15 23:25:44,661 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-11-15 23:25:44,876 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-11-15 23:25:45,145 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-11-15 23:25:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:45,754 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-11-15 23:25:45,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:25:45,755 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 57 [2019-11-15 23:25:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:45,755 INFO L225 Difference]: With dead ends: 107 [2019-11-15 23:25:45,755 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 23:25:45,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=490, Invalid=6152, Unknown=0, NotChecked=0, Total=6642 [2019-11-15 23:25:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 23:25:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-15 23:25:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:25:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-15 23:25:45,759 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 57 [2019-11-15 23:25:45,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:45,759 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-15 23:25:45,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 23:25:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-15 23:25:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:25:45,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:45,760 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:45,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:45,961 INFO L410 AbstractCegarLoop]: === Iteration 31 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1701478801, now seen corresponding path program 1 times [2019-11-15 23:25:45,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:45,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985978727] [2019-11-15 23:25:45,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:45,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:45,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:46,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985978727] [2019-11-15 23:25:46,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865443659] [2019-11-15 23:25:46,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:46,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 98 conjunts are in the unsatisfiable core [2019-11-15 23:25:46,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:47,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:47,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:47,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:47,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:47,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:25:47,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:47,210 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 30 treesize of output 48 [2019-11-15 23:25:47,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:47,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:25:47,232 INFO L567 ElimStorePlain]: treesize reduction 30, result has 52.4 percent of original size [2019-11-15 23:25:47,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:47,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-11-15 23:25:47,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:47,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:47,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 84 [2019-11-15 23:25:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:47,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:47,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:47,945 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-15 23:25:47,973 INFO L567 ElimStorePlain]: treesize reduction 32, result has 59.5 percent of original size [2019-11-15 23:25:47,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:47,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:47 [2019-11-15 23:25:48,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,234 INFO L341 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 23:25:48,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 62 [2019-11-15 23:25:48,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,245 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-15 23:25:48,295 INFO L567 ElimStorePlain]: treesize reduction 32, result has 65.2 percent of original size [2019-11-15 23:25:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:25:48,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:60 [2019-11-15 23:25:48,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,392 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,396 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:48,396 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 40 [2019-11-15 23:25:48,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:48,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:25:48,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:48,412 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 65 treesize of output 59 [2019-11-15 23:25:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,413 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-15 23:25:48,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:48,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:25:48,445 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:119, output treesize:29 [2019-11-15 23:25:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:25:48,474 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:25:48,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 54 [2019-11-15 23:25:48,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131310230] [2019-11-15 23:25:48,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-15 23:25:48,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:48,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-15 23:25:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2831, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 23:25:48,476 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 55 states. [2019-11-15 23:25:50,367 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-15 23:25:50,561 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-15 23:25:50,853 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-11-15 23:25:51,073 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-15 23:25:51,280 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-15 23:25:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:52,196 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2019-11-15 23:25:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:25:52,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 58 [2019-11-15 23:25:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:52,197 INFO L225 Difference]: With dead ends: 105 [2019-11-15 23:25:52,197 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 23:25:52,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=401, Invalid=5919, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 23:25:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 23:25:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-15 23:25:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:25:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2019-11-15 23:25:52,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 58 [2019-11-15 23:25:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:52,200 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2019-11-15 23:25:52,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-15 23:25:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2019-11-15 23:25:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:25:52,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:52,201 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:52,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:52,404 INFO L410 AbstractCegarLoop]: === Iteration 32 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1206235100, now seen corresponding path program 1 times [2019-11-15 23:25:52,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:52,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746809916] [2019-11-15 23:25:52,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:52,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:52,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:25:52,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746809916] [2019-11-15 23:25:52,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:25:52,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:25:52,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909339385] [2019-11-15 23:25:52,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:25:52,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:25:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:25:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:25:52,537 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 11 states. [2019-11-15 23:25:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:25:52,829 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-11-15 23:25:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:25:52,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-11-15 23:25:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:25:52,830 INFO L225 Difference]: With dead ends: 104 [2019-11-15 23:25:52,830 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 23:25:52,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:25:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 23:25:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 23:25:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:25:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-11-15 23:25:52,833 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 59 [2019-11-15 23:25:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:25:52,833 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-11-15 23:25:52,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:25:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-11-15 23:25:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:25:52,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:25:52,834 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:25:52,834 INFO L410 AbstractCegarLoop]: === Iteration 33 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:25:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:25:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1056502880, now seen corresponding path program 1 times [2019-11-15 23:25:52,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:25:52,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152592162] [2019-11-15 23:25:52,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:52,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:25:52,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:25:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:25:54,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152592162] [2019-11-15 23:25:54,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757846383] [2019-11-15 23:25:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:25:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:25:54,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 123 conjunts are in the unsatisfiable core [2019-11-15 23:25:54,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:25:55,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:55,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:55,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:25:55,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:55,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:55,230 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-11-15 23:25:55,336 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_53|], 2=[|v_#memory_$Pointer$.offset_52|]} [2019-11-15 23:25:55,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:25:55,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:55,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,363 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 41 treesize of output 55 [2019-11-15 23:25:55,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:25:55,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:55,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:55,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:25:55,402 INFO L567 ElimStorePlain]: treesize reduction 146, result has 23.2 percent of original size [2019-11-15 23:25:55,403 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-15 23:25:55,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2019-11-15 23:25:55,714 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|], 2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|]} [2019-11-15 23:25:55,717 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 31 treesize of output 23 [2019-11-15 23:25:55,717 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-15 23:25:55,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2019-11-15 23:25:55,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:25:55,736 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:25:55,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:25:55,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:25:55,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:7 [2019-11-15 23:25:59,372 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 23:26:01,073 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-15 23:26:02,911 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 23:26:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:02,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:02,933 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 111 treesize of output 171 [2019-11-15 23:26:02,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:03,026 INFO L567 ElimStorePlain]: treesize reduction 38, result has 86.4 percent of original size [2019-11-15 23:26:03,049 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:03,049 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 1 case distinctions, treesize of input 111 treesize of output 171 [2019-11-15 23:26:03,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:03,144 INFO L567 ElimStorePlain]: treesize reduction 38, result has 87.3 percent of original size [2019-11-15 23:26:03,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:26:03,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:223, output treesize:261 [2019-11-15 23:26:06,317 WARN L191 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 23:26:06,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:06,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:06,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:06,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:06,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:26:10,835 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 19=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_47|]} [2019-11-15 23:26:10,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:10,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 210 [2019-11-15 23:26:10,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,847 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:26:10,921 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.4 percent of original size [2019-11-15 23:26:10,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:26:10,954 INFO L341 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2019-11-15 23:26:10,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 97 [2019-11-15 23:26:10,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:10,968 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-15 23:26:11,029 INFO L567 ElimStorePlain]: treesize reduction 68, result has 52.4 percent of original size [2019-11-15 23:26:11,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:11,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:26:11,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:282, output treesize:68 [2019-11-15 23:26:11,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:11,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:11,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:11,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:26:11,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:26:11,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:11,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 62 [2019-11-15 23:26:11,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:11,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:11,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:26:11,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:26:11,724 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:11,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 38 [2019-11-15 23:26:11,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:26:11,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:26:11,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:26:11,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:131, output treesize:23 [2019-11-15 23:26:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:26:11,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:26:11,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 68 [2019-11-15 23:26:11,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639171218] [2019-11-15 23:26:11,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 23:26:11,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:26:11,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 23:26:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4482, Unknown=2, NotChecked=0, Total=4692 [2019-11-15 23:26:11,947 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 69 states. [2019-11-15 23:26:13,270 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-15 23:26:27,105 WARN L191 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-15 23:26:31,210 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-15 23:26:35,435 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-15 23:26:36,659 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-11-15 23:26:37,126 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-11-15 23:26:37,364 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-11-15 23:26:37,637 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 102 [2019-11-15 23:26:37,893 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-15 23:26:38,191 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-15 23:26:38,745 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 99 [2019-11-15 23:26:39,046 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 95 [2019-11-15 23:26:41,163 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 97 [2019-11-15 23:26:47,932 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2019-11-15 23:27:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:09,131 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2019-11-15 23:27:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-15 23:27:09,132 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 67 [2019-11-15 23:27:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:09,133 INFO L225 Difference]: With dead ends: 170 [2019-11-15 23:27:09,133 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 23:27:09,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2912 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=914, Invalid=12648, Unknown=10, NotChecked=0, Total=13572 [2019-11-15 23:27:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 23:27:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2019-11-15 23:27:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:27:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2019-11-15 23:27:09,138 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 67 [2019-11-15 23:27:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:09,139 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2019-11-15 23:27:09,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 23:27:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2019-11-15 23:27:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:27:09,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:09,139 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:09,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:09,344 INFO L410 AbstractCegarLoop]: === Iteration 34 === [sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:27:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1056502881, now seen corresponding path program 1 times [2019-11-15 23:27:09,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:09,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968786720] [2019-11-15 23:27:09,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:09,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:27:09,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968786720] [2019-11-15 23:27:09,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118446792] [2019-11-15 23:27:09,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:10,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 23:27:10,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:10,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:10,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 48 [2019-11-15 23:27:10,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:10,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:10,270 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-15 23:27:10,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:10,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:10,503 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-15 23:27:10,507 INFO L168 Benchmark]: Toolchain (without parser) took 166551.48 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 845.7 MB). Free memory was 950.1 MB in the beginning and 1.8 GB in the end (delta: -819.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:10,507 INFO L168 Benchmark]: CDTParser took 0.30 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-15 23:27:10,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:10,508 INFO L168 Benchmark]: Boogie Preprocessor took 109.95 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-15 23:27:10,508 INFO L168 Benchmark]: RCFGBuilder took 999.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:10,508 INFO L168 Benchmark]: TraceAbstraction took 164718.91 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 734.0 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -749.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:27:10,509 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.95 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 999.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 164718.91 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 734.0 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -749.7 MB). There was no memory consumed. 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. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:27:12,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:27:12,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:27:12,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:27:12,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:27:12,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:27:12,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:27:12,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:27:12,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:27:12,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:27:12,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:27:12,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:27:12,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:27:12,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:27:12,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:27:12,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:27:12,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:27:12,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:27:12,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:27:12,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:27:12,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:27:12,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:27:12,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:27:12,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:27:12,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:27:12,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:27:12,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:27:12,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:27:12,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:27:12,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:27:12,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:27:12,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:27:12,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:27:12,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:27:12,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:27:12,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:27:12,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:27:12,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:27:12,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:27:12,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:27:12,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:27:12,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 23:27:12,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:27:12,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:27:12,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:27:12,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:27:12,806 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:27:12,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:27:12,807 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:27:12,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:27:12,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:27:12,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:27:12,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:27:12,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:27:12,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:27:12,808 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:27:12,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:27:12,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:27:12,809 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:27:12,809 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:27:12,809 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:27:12,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:27:12,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:27:12,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:27:12,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:27:12,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:27:12,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:27:12,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:27:12,812 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:27:12,812 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:27:12,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:27:12,813 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_821d6dc5-35d8-462d-9253-a9883d60fc18/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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2019-11-15 23:27:12,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:27:12,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:27:12,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:27:12,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:27:12,872 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:27:12,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-11-15 23:27:12,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/aa501037c/f6d47f80ce8f45ed8012bcb58e50f842/FLAGc05338a95 [2019-11-15 23:27:13,415 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:27:13,415 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-11-15 23:27:13,427 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/aa501037c/f6d47f80ce8f45ed8012bcb58e50f842/FLAGc05338a95 [2019-11-15 23:27:13,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/bin/uautomizer/data/aa501037c/f6d47f80ce8f45ed8012bcb58e50f842 [2019-11-15 23:27:13,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:27:13,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:27:13,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:27:13,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:27:13,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:27:13,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:27:13" (1/1) ... [2019-11-15 23:27:13,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503f564f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:13, skipping insertion in model container [2019-11-15 23:27:13,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:27:13" (1/1) ... [2019-11-15 23:27:13,770 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:27:13,803 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:27:14,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:27:14,215 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:27:14,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:27:14,330 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:27:14,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14 WrapperNode [2019-11-15 23:27:14,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:27:14,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:27:14,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:27:14,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:27:14,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... [2019-11-15 23:27:14,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:27:14,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:27:14,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:27:14,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:27:14,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:27:14,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:27:14,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:27:14,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:27:14,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:27:14,481 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:27:14,481 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:27:14,481 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-15 23:27:14,482 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_first [2019-11-15 23:27:14,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:27:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:27:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:27:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:27:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:27:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:27:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:27:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:27:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:27:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:27:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:27:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:27:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:27:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:27:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:27:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:27:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:27:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:27:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:27:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:27:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:27:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:27:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:27:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:27:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:27:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:27:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:27:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:27:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:27:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:27:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:27:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:27:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:27:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:27:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:27:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:27:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:27:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:27:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:27:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:27:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:27:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:27:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:27:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:27:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:27:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:27:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:27:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:27:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:27:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:27:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:27:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:27:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:27:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:27:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:27:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:27:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:27:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:27:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:27:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:27:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:27:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:27:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:27:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:27:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:27:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:27:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:27:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:27:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:27:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:27:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:27:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:27:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:27:14,503 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:27:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:27:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:27:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:27:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:27:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:27:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:27:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:27:14,506 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:27:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:27:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:27:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:27:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:27:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:27:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:27:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:27:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:27:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-15 23:27:14,508 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_first [2019-11-15 23:27:14,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:27:14,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:27:14,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:27:14,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:27:14,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:27:14,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:27:14,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:27:14,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:27:14,865 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:27:15,398 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:27:15,399 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 23:27:15,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:15 BoogieIcfgContainer [2019-11-15 23:27:15,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:27:15,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:27:15,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:27:15,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:27:15,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:27:13" (1/3) ... [2019-11-15 23:27:15,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61756ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:27:15, skipping insertion in model container [2019-11-15 23:27:15,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:14" (2/3) ... [2019-11-15 23:27:15,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61756ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:27:15, skipping insertion in model container [2019-11-15 23:27:15,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:15" (3/3) ... [2019-11-15 23:27:15,417 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2019-11-15 23:27:15,427 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:27:15,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-15 23:27:15,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-15 23:27:15,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:27:15,467 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:27:15,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:27:15,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:27:15,467 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:27:15,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:27:15,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:27:15,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:27:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 23:27:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:27:15,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:15,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:15,502 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr24REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr29REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr28REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr27ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-15 23:27:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1298825814, now seen corresponding path program 1 times [2019-11-15 23:27:15,520 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:15,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [114237849] [2019-11-15 23:27:15,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_821d6dc5-35d8-462d-9253-a9883d60fc18/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-15 23:27:15,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:27:15,747 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-15 23:27:15,754 INFO L168 Benchmark]: Toolchain (without parser) took 1998.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:15,755 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:27:15,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:15,757 INFO L168 Benchmark]: Boogie Preprocessor took 90.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:15,759 INFO L168 Benchmark]: RCFGBuilder took 977.67 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:15,760 INFO L168 Benchmark]: TraceAbstraction took 349.66 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.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:27:15,772 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 977.67 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 349.66 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.4 MB). Peak memory consumption was 12.4 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...