./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.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_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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 85f309ef7120c25bf3b7104ad3a9bfa2e1a59886 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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 85f309ef7120c25bf3b7104ad3a9bfa2e1a59886 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:08:40,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:08:40,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:08:40,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:08:40,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:08:40,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:08:40,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:08:40,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:08:40,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:08:40,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:08:40,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:08:40,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:08:40,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:08:40,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:08:40,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:08:40,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:08:40,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:08:40,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:08:40,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:08:40,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:08:40,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:08:40,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:08:40,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:08:40,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:08:40,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:08:40,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:08:40,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:08:40,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:08:40,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:08:40,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:08:40,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:08:40,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:08:40,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:08:40,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:08:40,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:08:40,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:08:40,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:08:40,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:08:40,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:08:40,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:08:40,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:08:40,694 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:08:40,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:08:40,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:08:40,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:08:40,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:08:40,709 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:08:40,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:08:40,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:08:40,710 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:08:40,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:08:40,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:08:40,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:08:40,711 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:08:40,711 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:08:40,712 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:08:40,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:08:40,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:08:40,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:08:40,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:08:40,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:08:40,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:08:40,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:08:40,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:08:40,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:08:40,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:08:40,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:08:40,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:08:40,714 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_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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 -> 85f309ef7120c25bf3b7104ad3a9bfa2e1a59886 [2019-11-16 00:08:40,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:08:40,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:08:40,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:08:40,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:08:40,764 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:08:40,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2019-11-16 00:08:40,817 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/72e6c80f3/b06062fa8a2f4760a9e0638bee829219/FLAG9d2a62665 [2019-11-16 00:08:41,219 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:08:41,220 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2019-11-16 00:08:41,236 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/72e6c80f3/b06062fa8a2f4760a9e0638bee829219/FLAG9d2a62665 [2019-11-16 00:08:41,554 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/72e6c80f3/b06062fa8a2f4760a9e0638bee829219 [2019-11-16 00:08:41,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:08:41,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:08:41,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:08:41,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:08:41,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:08:41,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:41" (1/1) ... [2019-11-16 00:08:41,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f90b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:41, skipping insertion in model container [2019-11-16 00:08:41,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:41" (1/1) ... [2019-11-16 00:08:41,572 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:08:41,607 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:08:41,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:08:41,991 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:08:42,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:08:42,116 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:08:42,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42 WrapperNode [2019-11-16 00:08:42,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:08:42,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:08:42,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:08:42,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:08:42,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... [2019-11-16 00:08:42,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:08:42,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:08:42,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:08:42,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:08:42,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:08:42,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:08:42,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:08:42,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:08:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:08:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:08:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:08:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-16 00:08:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-16 00:08:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-11-16 00:08:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:08:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:08:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:08:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:08:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:08:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:08:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:08:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:08:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:08:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:08:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:08:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:08:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:08:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:08:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:08:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:08:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:08:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:08:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:08:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:08:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:08:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:08:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:08:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:08:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:08:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:08:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:08:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:08:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:08:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:08:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:08:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:08:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:08:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:08:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:08:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:08:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:08:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:08:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:08:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:08:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:08:42,303 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:08:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:08:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:08:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:08:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:08:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:08:42,304 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:08:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:08:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:08:42,305 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:08:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:08:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:08:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:08:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:08:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:08:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:08:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:08:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:08:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:08:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:08:42,308 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:08:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:08:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:08:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:08:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:08:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-11-16 00:08:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:08:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:08:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:08:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:08:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:08:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:08:42,657 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:08:42,890 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:08:42,891 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-16 00:08:42,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:42 BoogieIcfgContainer [2019-11-16 00:08:42,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:08:42,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:08:42,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:08:42,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:08:42,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:08:41" (1/3) ... [2019-11-16 00:08:42,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2336f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:42, skipping insertion in model container [2019-11-16 00:08:42,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:42" (2/3) ... [2019-11-16 00:08:42,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2336f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:42, skipping insertion in model container [2019-11-16 00:08:42,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:42" (3/3) ... [2019-11-16 00:08:42,899 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2019-11-16 00:08:42,908 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:08:42,919 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2019-11-16 00:08:42,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2019-11-16 00:08:42,958 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:08:42,959 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:08:42,959 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:08:42,959 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:08:42,959 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:08:42,959 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:08:42,959 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:08:42,960 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:08:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-16 00:08:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:08:42,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:42,996 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:42,999 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -426863343, now seen corresponding path program 1 times [2019-11-16 00:08:43,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:43,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186337296] [2019-11-16 00:08:43,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:43,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:43,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:43,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186337296] [2019-11-16 00:08:43,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:43,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:43,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311238140] [2019-11-16 00:08:43,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:43,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:43,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:43,301 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2019-11-16 00:08:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:43,644 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-16 00:08:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:43,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:08:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:43,668 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:08:43,668 INFO L226 Difference]: Without dead ends: 98 [2019-11-16 00:08:43,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-16 00:08:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2019-11-16 00:08:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-16 00:08:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-16 00:08:43,719 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 13 [2019-11-16 00:08:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:43,720 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-16 00:08:43,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-16 00:08:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:08:43,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:43,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:43,722 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -426863342, now seen corresponding path program 1 times [2019-11-16 00:08:43,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:43,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872773109] [2019-11-16 00:08:43,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:43,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:43,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872773109] [2019-11-16 00:08:43,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:43,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:43,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812945220] [2019-11-16 00:08:43,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:43,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:43,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:43,857 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 4 states. [2019-11-16 00:08:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:44,107 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2019-11-16 00:08:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:44,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:08:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:44,109 INFO L225 Difference]: With dead ends: 96 [2019-11-16 00:08:44,109 INFO L226 Difference]: Without dead ends: 96 [2019-11-16 00:08:44,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-16 00:08:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-11-16 00:08:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-16 00:08:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-16 00:08:44,120 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 13 [2019-11-16 00:08:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:44,122 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-16 00:08:44,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-16 00:08:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:08:44,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:44,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:44,124 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash 66438265, now seen corresponding path program 1 times [2019-11-16 00:08:44,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:44,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576650464] [2019-11-16 00:08:44,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:44,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:44,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:44,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576650464] [2019-11-16 00:08:44,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:44,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:44,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486838868] [2019-11-16 00:08:44,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:08:44,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:08:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:44,339 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 8 states. [2019-11-16 00:08:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:44,840 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2019-11-16 00:08:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:44,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:08:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:44,843 INFO L225 Difference]: With dead ends: 95 [2019-11-16 00:08:44,843 INFO L226 Difference]: Without dead ends: 95 [2019-11-16 00:08:44,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-16 00:08:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-11-16 00:08:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-16 00:08:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-16 00:08:44,852 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-11-16 00:08:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:44,853 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-16 00:08:44,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:08:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-16 00:08:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:08:44,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:44,854 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:44,855 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash 66438266, now seen corresponding path program 1 times [2019-11-16 00:08:44,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:44,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396123397] [2019-11-16 00:08:44,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:44,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:44,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:45,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396123397] [2019-11-16 00:08:45,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:45,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:08:45,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868556146] [2019-11-16 00:08:45,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:08:45,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:08:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:45,128 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 10 states. [2019-11-16 00:08:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:45,543 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-16 00:08:45,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:45,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-16 00:08:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:45,545 INFO L225 Difference]: With dead ends: 94 [2019-11-16 00:08:45,545 INFO L226 Difference]: Without dead ends: 94 [2019-11-16 00:08:45,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:08:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-16 00:08:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2019-11-16 00:08:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-16 00:08:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-16 00:08:45,554 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 19 [2019-11-16 00:08:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:45,555 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-16 00:08:45,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-16 00:08:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:08:45,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:45,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:45,557 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash 332572156, now seen corresponding path program 1 times [2019-11-16 00:08:45,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:45,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785764835] [2019-11-16 00:08:45,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:45,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:45,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:45,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785764835] [2019-11-16 00:08:45,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:45,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:45,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236653568] [2019-11-16 00:08:45,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:45,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:45,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:45,662 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 7 states. [2019-11-16 00:08:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:45,916 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-11-16 00:08:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:45,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-16 00:08:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:45,917 INFO L225 Difference]: With dead ends: 98 [2019-11-16 00:08:45,917 INFO L226 Difference]: Without dead ends: 95 [2019-11-16 00:08:45,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-16 00:08:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2019-11-16 00:08:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-16 00:08:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-16 00:08:45,926 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 25 [2019-11-16 00:08:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:45,926 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-16 00:08:45,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-16 00:08:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:08:45,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:45,927 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] [2019-11-16 00:08:45,928 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 578742953, now seen corresponding path program 1 times [2019-11-16 00:08:45,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:45,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885393838] [2019-11-16 00:08:45,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:45,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:45,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:08:46,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885393838] [2019-11-16 00:08:46,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193687922] [2019-11-16 00:08:46,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:46,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:08:46,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:46,279 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:46,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-16 00:08:46,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840155388] [2019-11-16 00:08:46,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:08:46,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:08:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:08:46,288 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 9 states. [2019-11-16 00:08:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:46,640 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-16 00:08:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:46,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-11-16 00:08:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:46,642 INFO L225 Difference]: With dead ends: 104 [2019-11-16 00:08:46,642 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:08:46,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:08:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:08:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-11-16 00:08:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:08:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-11-16 00:08:46,649 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 38 [2019-11-16 00:08:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:46,650 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-11-16 00:08:46,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:08:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-11-16 00:08:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:08:46,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:46,659 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:46,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:46,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -675125476, now seen corresponding path program 2 times [2019-11-16 00:08:46,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:46,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116889166] [2019-11-16 00:08:46,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:46,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:46,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:08:47,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116889166] [2019-11-16 00:08:47,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491944585] [2019-11-16 00:08:47,702 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:47,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:08:47,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:47,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-16 00:08:47,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:47,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:47,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:47,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:47,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:47,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:08:47,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:08:47,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:47,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:47,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:47,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:08:48,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:48,260 INFO L341 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2019-11-16 00:08:48,261 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 2 case distinctions, treesize of input 15 treesize of output 23 [2019-11-16 00:08:48,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:48,281 INFO L567 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2019-11-16 00:08:48,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:48,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:24 [2019-11-16 00:08:48,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:48,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:08:48,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:48,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:48,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:48,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:08:48,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:48,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:48,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:48,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:08:48,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:48,528 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-16 00:08:48,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:48,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-16 00:08:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:08:48,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:48,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-16 00:08:48,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445842560] [2019-11-16 00:08:48,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:08:48,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:08:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:08:48,601 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 25 states. [2019-11-16 00:08:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:50,178 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2019-11-16 00:08:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:08:50,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2019-11-16 00:08:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:50,181 INFO L225 Difference]: With dead ends: 153 [2019-11-16 00:08:50,181 INFO L226 Difference]: Without dead ends: 153 [2019-11-16 00:08:50,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:08:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-16 00:08:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2019-11-16 00:08:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-16 00:08:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-16 00:08:50,196 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 51 [2019-11-16 00:08:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:50,197 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-16 00:08:50,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:08:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-16 00:08:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:08:50,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:50,205 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:50,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:50,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash -675125475, now seen corresponding path program 1 times [2019-11-16 00:08:50,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:50,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295870837] [2019-11-16 00:08:50,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:50,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:50,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:08:50,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295870837] [2019-11-16 00:08:50,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078636129] [2019-11-16 00:08:50,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:51,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:08:51,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:51,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:51,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:51,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:08:51,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:08:51,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:51,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:08:51,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:51,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:51,237 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:08:51,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:08:51,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:51,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:51,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-16 00:08:51,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:51,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:08:51,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:51,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:08:51,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:51,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:51,432 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:51,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:08:51,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:51,474 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-16 00:08:51,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:51,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-16 00:08:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:08:51,534 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:51,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:08:51,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708064069] [2019-11-16 00:08:51,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:08:51,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:08:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:08:51,537 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 18 states. [2019-11-16 00:08:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:52,732 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2019-11-16 00:08:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:52,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-11-16 00:08:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:52,734 INFO L225 Difference]: With dead ends: 160 [2019-11-16 00:08:52,734 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:08:52,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:08:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:08:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2019-11-16 00:08:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:08:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-11-16 00:08:52,746 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 51 [2019-11-16 00:08:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:52,747 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-11-16 00:08:52,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:08:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-11-16 00:08:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:08:52,748 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:52,749 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:52,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:52,955 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash 545946816, now seen corresponding path program 1 times [2019-11-16 00:08:52,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:52,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400335260] [2019-11-16 00:08:52,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:52,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:52,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:08:53,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400335260] [2019-11-16 00:08:53,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:53,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:53,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500296854] [2019-11-16 00:08:53,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:08:53,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:08:53,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:53,113 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 8 states. [2019-11-16 00:08:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:53,381 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-11-16 00:08:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:53,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-16 00:08:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:53,383 INFO L225 Difference]: With dead ends: 122 [2019-11-16 00:08:53,383 INFO L226 Difference]: Without dead ends: 122 [2019-11-16 00:08:53,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-16 00:08:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2019-11-16 00:08:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-16 00:08:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-11-16 00:08:53,392 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 52 [2019-11-16 00:08:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:53,392 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-11-16 00:08:53,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:08:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-11-16 00:08:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:08:53,394 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:53,394 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:53,394 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash 545946817, now seen corresponding path program 1 times [2019-11-16 00:08:53,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:53,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305150161] [2019-11-16 00:08:53,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:53,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:53,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:08:53,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305150161] [2019-11-16 00:08:53,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:53,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:08:53,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290644276] [2019-11-16 00:08:53,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:08:53,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:08:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:53,574 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 10 states. [2019-11-16 00:08:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:53,841 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2019-11-16 00:08:53,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:53,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-16 00:08:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:53,843 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:08:53,843 INFO L226 Difference]: Without dead ends: 121 [2019-11-16 00:08:53,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:08:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-16 00:08:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2019-11-16 00:08:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-16 00:08:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-11-16 00:08:53,849 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 52 [2019-11-16 00:08:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:53,849 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-11-16 00:08:53,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-11-16 00:08:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:08:53,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:53,851 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:53,852 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:53,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1639373266, now seen corresponding path program 1 times [2019-11-16 00:08:53,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:53,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365104783] [2019-11-16 00:08:53,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:53,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:53,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:08:54,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365104783] [2019-11-16 00:08:54,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:54,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-16 00:08:54,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076781002] [2019-11-16 00:08:54,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:08:54,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:08:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:08:54,084 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 13 states. [2019-11-16 00:08:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:54,568 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-11-16 00:08:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:08:54,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-11-16 00:08:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:54,570 INFO L225 Difference]: With dead ends: 133 [2019-11-16 00:08:54,570 INFO L226 Difference]: Without dead ends: 133 [2019-11-16 00:08:54,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:08:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-16 00:08:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2019-11-16 00:08:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-16 00:08:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-11-16 00:08:54,576 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 60 [2019-11-16 00:08:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:54,576 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-11-16 00:08:54,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:08:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-11-16 00:08:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:08:54,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:54,578 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:54,578 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1639373267, now seen corresponding path program 1 times [2019-11-16 00:08:54,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:54,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481415826] [2019-11-16 00:08:54,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:08:54,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481415826] [2019-11-16 00:08:54,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:54,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:08:54,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592441999] [2019-11-16 00:08:54,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:08:54,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:54,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:08:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:08:54,917 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 15 states. [2019-11-16 00:08:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:55,389 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2019-11-16 00:08:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:08:55,389 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-11-16 00:08:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:55,391 INFO L225 Difference]: With dead ends: 139 [2019-11-16 00:08:55,391 INFO L226 Difference]: Without dead ends: 139 [2019-11-16 00:08:55,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:08:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-16 00:08:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2019-11-16 00:08:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:08:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2019-11-16 00:08:55,396 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 60 [2019-11-16 00:08:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:55,397 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2019-11-16 00:08:55,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:08:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2019-11-16 00:08:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:08:55,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:55,398 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:55,398 INFO L410 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash -341181047, now seen corresponding path program 3 times [2019-11-16 00:08:55,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:55,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003642241] [2019-11-16 00:08:55,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:55,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:55,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-16 00:08:55,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003642241] [2019-11-16 00:08:55,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397687351] [2019-11-16 00:08:55,565 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:55,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:08:55,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:55,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:08:55,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:08:55,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:55,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-16 00:08:55,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623124684] [2019-11-16 00:08:55,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:08:55,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:08:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:55,916 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2019-11-16 00:08:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:56,242 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-11-16 00:08:56,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:08:56,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-11-16 00:08:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:56,244 INFO L225 Difference]: With dead ends: 98 [2019-11-16 00:08:56,244 INFO L226 Difference]: Without dead ends: 89 [2019-11-16 00:08:56,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:08:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-16 00:08:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2019-11-16 00:08:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-16 00:08:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-11-16 00:08:56,248 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 64 [2019-11-16 00:08:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:56,248 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-11-16 00:08:56,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-11-16 00:08:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:08:56,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:56,253 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:56,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:56,459 INFO L410 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1390395874, now seen corresponding path program 1 times [2019-11-16 00:08:56,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:56,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651686269] [2019-11-16 00:08:56,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-16 00:08:56,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651686269] [2019-11-16 00:08:56,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:56,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:08:56,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466392220] [2019-11-16 00:08:56,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:08:56,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:08:56,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:08:56,589 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 6 states. [2019-11-16 00:08:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:56,789 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-11-16 00:08:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:08:56,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:08:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:56,791 INFO L225 Difference]: With dead ends: 91 [2019-11-16 00:08:56,791 INFO L226 Difference]: Without dead ends: 90 [2019-11-16 00:08:56,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-16 00:08:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-16 00:08:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2019-11-16 00:08:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-16 00:08:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-16 00:08:56,795 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 65 [2019-11-16 00:08:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:56,795 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-16 00:08:56,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:08:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-16 00:08:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:08:56,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:56,796 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:08:56,796 INFO L410 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:56,797 INFO L82 PathProgramCache]: Analyzing trace with hash -176468909, now seen corresponding path program 1 times [2019-11-16 00:08:56,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:56,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690348981] [2019-11-16 00:08:56,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:56,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:57,829 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-16 00:08:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,356 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-11-16 00:08:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:08:58,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690348981] [2019-11-16 00:08:58,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641296019] [2019-11-16 00:08:58,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:58,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-16 00:08:58,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:58,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:08:58,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:58,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:58,726 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_1| vanished before elimination [2019-11-16 00:08:58,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:58,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-16 00:08:58,954 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 13 treesize of output 9 [2019-11-16 00:08:58,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:58,972 INFO L567 ElimStorePlain]: treesize reduction 5, result has 87.5 percent of original size [2019-11-16 00:08:58,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:58,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2019-11-16 00:08:59,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:59,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:08:59,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:59,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:59,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:59,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:45 [2019-11-16 00:08:59,592 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_29|], 6=[|v_#memory_$Pointer$.base_29|]} [2019-11-16 00:08:59,602 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 0 case distinctions, treesize of input 23 treesize of output 13 [2019-11-16 00:08:59,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:59,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:59,648 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:59,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:59,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:59,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:60 [2019-11-16 00:09:02,792 WARN L191 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-16 00:09:02,810 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-16 00:09:02,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:02,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:02,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:02,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:145 [2019-11-16 00:09:03,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:03,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:09:03,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:03,072 INFO L567 ElimStorePlain]: treesize reduction 26, result has 85.9 percent of original size [2019-11-16 00:09:03,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:03,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:03,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:03,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 37 [2019-11-16 00:09:03,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:03,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:03,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:03,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:159, output treesize:55 [2019-11-16 00:09:03,432 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-16 00:09:03,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:03,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 28 [2019-11-16 00:09:03,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:03,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:03,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:03,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:03,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2019-11-16 00:09:03,452 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:03,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:03,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:03,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:17 [2019-11-16 00:09:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:09:03,486 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:03,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 45 [2019-11-16 00:09:03,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762033309] [2019-11-16 00:09:03,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-16 00:09:03,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-16 00:09:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1954, Unknown=2, NotChecked=0, Total=2070 [2019-11-16 00:09:03,488 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 46 states. [2019-11-16 00:09:14,581 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-16 00:09:17,832 WARN L191 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-11-16 00:09:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:21,453 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-16 00:09:21,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:09:21,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-11-16 00:09:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:21,454 INFO L225 Difference]: With dead ends: 99 [2019-11-16 00:09:21,454 INFO L226 Difference]: Without dead ends: 99 [2019-11-16 00:09:21,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=302, Invalid=4386, Unknown=4, NotChecked=0, Total=4692 [2019-11-16 00:09:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-16 00:09:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2019-11-16 00:09:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-16 00:09:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-16 00:09:21,459 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 65 [2019-11-16 00:09:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:21,460 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-16 00:09:21,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-16 00:09:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-16 00:09:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:09:21,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:21,461 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:09:21,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:21,665 INFO L410 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:09:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash -176468908, now seen corresponding path program 1 times [2019-11-16 00:09:21,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:21,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341800996] [2019-11-16 00:09:21,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:21,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:21,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:22,897 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-11-16 00:09:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,757 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-16 00:09:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:09:23,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341800996] [2019-11-16 00:09:23,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849306610] [2019-11-16 00:09:23,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:23,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 111 conjunts are in the unsatisfiable core [2019-11-16 00:09:23,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:24,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:24,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:24,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:24,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:24,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:09:24,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:09:24,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:24,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:24,611 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 15 treesize of output 7 [2019-11-16 00:09:24,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:24,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:24,619 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-16 00:09:24,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:24,620 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2019-11-16 00:09:25,572 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:25,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:25,605 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:25,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:25,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:25,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:98 [2019-11-16 00:09:30,941 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-16 00:09:41,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:41,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:09:41,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:42,079 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-16 00:09:42,079 INFO L567 ElimStorePlain]: treesize reduction 26, result has 88.7 percent of original size [2019-11-16 00:09:42,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:09:42,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 30 [2019-11-16 00:09:42,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:42,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:42,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 29 [2019-11-16 00:09:42,130 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:42,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:42,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:42,153 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:206, output treesize:89 [2019-11-16 00:09:42,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:09:42,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:42,529 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 3 case distinctions, treesize of input 98 treesize of output 60 [2019-11-16 00:09:42,530 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:42,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:42,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:42,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:42,556 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 1 case distinctions, treesize of input 57 treesize of output 34 [2019-11-16 00:09:42,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:42,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:42,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:42,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:23 [2019-11-16 00:09:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:09:42,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:42,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2019-11-16 00:09:42,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338537218] [2019-11-16 00:09:42,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-16 00:09:42,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-16 00:09:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=3375, Unknown=6, NotChecked=0, Total=3540 [2019-11-16 00:09:42,914 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 60 states. [2019-11-16 00:10:00,503 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-11-16 00:10:24,926 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-11-16 00:10:33,282 WARN L191 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-11-16 00:10:41,702 WARN L191 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-16 00:10:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:48,111 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-16 00:10:48,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:10:48,111 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 65 [2019-11-16 00:10:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:48,113 INFO L225 Difference]: With dead ends: 101 [2019-11-16 00:10:48,113 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:10:48,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=403, Invalid=7240, Unknown=13, NotChecked=0, Total=7656 [2019-11-16 00:10:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:10:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-11-16 00:10:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-16 00:10:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-11-16 00:10:48,119 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 65 [2019-11-16 00:10:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:48,120 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-11-16 00:10:48,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-16 00:10:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-11-16 00:10:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:10:48,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:48,121 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:48,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:48,334 INFO L410 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:48,334 INFO L82 PathProgramCache]: Analyzing trace with hash 947139645, now seen corresponding path program 1 times [2019-11-16 00:10:48,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:48,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391228447] [2019-11-16 00:10:48,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:48,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:48,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-16 00:10:48,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391228447] [2019-11-16 00:10:48,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684941708] [2019-11-16 00:10:48,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:10:48,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-16 00:10:48,767 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:48,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-11-16 00:10:48,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459063500] [2019-11-16 00:10:48,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:10:48,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:10:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:10:48,768 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2019-11-16 00:10:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:49,196 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-11-16 00:10:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:10:49,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-11-16 00:10:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:49,197 INFO L225 Difference]: With dead ends: 94 [2019-11-16 00:10:49,197 INFO L226 Difference]: Without dead ends: 93 [2019-11-16 00:10:49,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:10:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-16 00:10:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2019-11-16 00:10:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:10:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-11-16 00:10:49,201 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 70 [2019-11-16 00:10:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:49,201 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-11-16 00:10:49,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:10:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-11-16 00:10:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:10:49,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:49,202 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:10:49,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:49,406 INFO L410 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2133900686, now seen corresponding path program 2 times [2019-11-16 00:10:49,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:49,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863894074] [2019-11-16 00:10:49,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:49,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:49,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,176 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-11-16 00:10:51,530 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-11-16 00:10:51,844 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-11-16 00:10:52,189 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-11-16 00:10:52,650 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-11-16 00:10:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:53,805 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-11-16 00:10:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:10:53,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863894074] [2019-11-16 00:10:53,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951594432] [2019-11-16 00:10:53,834 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:53,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:10:53,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:10:53,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 152 conjunts are in the unsatisfiable core [2019-11-16 00:10:53,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:54,193 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 13 treesize of output 9 [2019-11-16 00:10:54,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,207 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 13 treesize of output 9 [2019-11-16 00:10:54,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-16 00:10:54,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:10:54,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:10:54,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:10:54,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:10:54,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:39 [2019-11-16 00:10:54,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:10:54,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,589 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-11-16 00:10:54,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2019-11-16 00:10:54,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-11-16 00:10:54,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-11-16 00:10:54,844 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:54,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:54,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:36 [2019-11-16 00:10:55,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-11-16 00:10:55,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:55,486 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_5|], 2=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|]} [2019-11-16 00:10:55,491 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 37 treesize of output 25 [2019-11-16 00:10:55,492 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:55,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:55,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:10:55,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:55,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 11 [2019-11-16 00:10:55,525 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:55,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,545 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:10 [2019-11-16 00:10:56,902 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:56,961 INFO L567 ElimStorePlain]: treesize reduction 5, result has 95.3 percent of original size [2019-11-16 00:10:56,964 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:56,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:56,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:56,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:103 [2019-11-16 00:11:04,173 WARN L191 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-16 00:11:25,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:25,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 159 [2019-11-16 00:11:25,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:25,586 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-16 00:11:25,586 INFO L567 ElimStorePlain]: treesize reduction 82, result has 77.4 percent of original size [2019-11-16 00:11:25,588 INFO L392 ElimStorePlain]: Different costs {16=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|], 26=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_36|]} [2019-11-16 00:11:25,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:25,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 77 [2019-11-16 00:11:25,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:25,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:25,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:25,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:25,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:25,668 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 2 case distinctions, treesize of input 147 treesize of output 93 [2019-11-16 00:11:25,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:25,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:25,672 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:25,795 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-16 00:11:25,795 INFO L567 ElimStorePlain]: treesize reduction 58, result has 68.8 percent of original size [2019-11-16 00:11:25,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:25,796 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:261, output treesize:241 [2019-11-16 00:11:27,131 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-16 00:11:27,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:27,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:27,157 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 283 treesize of output 193 [2019-11-16 00:11:27,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,164 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:27,219 INFO L567 ElimStorePlain]: treesize reduction 50, result has 73.8 percent of original size [2019-11-16 00:11:27,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:27,224 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:11:27,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:27,228 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 51 [2019-11-16 00:11:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:27,229 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:27,270 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-16 00:11:27,271 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-16 00:11:27,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:301, output treesize:34 [2019-11-16 00:11:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:27,778 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:27,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 75 [2019-11-16 00:11:27,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520178210] [2019-11-16 00:11:27,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-11-16 00:11:27,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-11-16 00:11:27,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=5419, Unknown=11, NotChecked=0, Total=5700 [2019-11-16 00:11:27,782 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 76 states. [2019-11-16 00:12:00,465 WARN L191 SmtUtils]: Spent 7.10 s on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-11-16 00:12:03,259 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-16 00:12:03,538 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-11-16 00:12:03,888 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-11-16 00:12:04,184 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-11-16 00:12:04,479 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2019-11-16 00:12:04,768 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-11-16 00:12:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:06,073 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-11-16 00:12:06,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-16 00:12:06,073 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 70 [2019-11-16 00:12:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:12:06,074 INFO L225 Difference]: With dead ends: 101 [2019-11-16 00:12:06,074 INFO L226 Difference]: Without dead ends: 101 [2019-11-16 00:12:06,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=571, Invalid=8924, Unknown=11, NotChecked=0, Total=9506 [2019-11-16 00:12:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-16 00:12:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2019-11-16 00:12:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-16 00:12:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-11-16 00:12:06,081 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 70 [2019-11-16 00:12:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:12:06,081 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-11-16 00:12:06,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-11-16 00:12:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-11-16 00:12:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:12:06,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:12:06,083 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:12:06,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:12:06,286 INFO L410 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:12:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2133900685, now seen corresponding path program 2 times [2019-11-16 00:12:06,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:06,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016117830] [2019-11-16 00:12:06,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:06,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:06,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:08,413 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-11-16 00:12:08,799 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-11-16 00:12:09,226 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-11-16 00:12:09,752 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-11-16 00:12:11,361 WARN L191 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-16 00:12:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:13,184 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-11-16 00:12:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:12:13,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016117830] [2019-11-16 00:12:13,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526112793] [2019-11-16 00:12:13,227 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:12:13,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:12:13,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:12:13,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 159 conjunts are in the unsatisfiable core [2019-11-16 00:12:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:13,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-16 00:12:13,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:13,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:13,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:13,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:12:14,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:14,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-11-16 00:12:14,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:14,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:14,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:14,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:12:14,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:14,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:14,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:14,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2019-11-16 00:12:15,149 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 13 treesize of output 9 [2019-11-16 00:12:15,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:15,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:15,182 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 13 treesize of output 9 [2019-11-16 00:12:15,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:15,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:15,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:15,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:71 [2019-11-16 00:12:16,090 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_22|], 1=[|v_#length_BEFORE_CALL_16|]} [2019-11-16 00:12:16,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:12:16,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:16,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:16,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2019-11-16 00:12:16,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:16,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:16,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:16,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:16,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2019-11-16 00:12:16,152 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:16,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:16,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:16,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 20 [2019-11-16 00:12:16,174 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:16,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:16,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:12:16,184 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:150, output treesize:13 [2019-11-16 00:12:17,628 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:17,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:17,671 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:17,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:17,704 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-16 00:12:17,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:106 [2019-11-16 00:12:38,593 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-16 00:12:38,595 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_50|], 3=[|v_#length_BEFORE_CALL_19|]} [2019-11-16 00:12:38,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:38,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:12:38,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,729 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:12:38,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:38,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:38,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 115 [2019-11-16 00:12:38,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:38,999 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-16 00:12:39,000 INFO L567 ElimStorePlain]: treesize reduction 56, result has 84.4 percent of original size [2019-11-16 00:12:39,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:12:39,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,156 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-11-16 00:12:39,156 INFO L341 Elim1Store]: treesize reduction 19, result has 88.0 percent of original size [2019-11-16 00:12:39,156 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 4 case distinctions, treesize of input 159 treesize of output 209 [2019-11-16 00:12:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,159 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:39,350 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-11-16 00:12:39,351 INFO L567 ElimStorePlain]: treesize reduction 143, result has 64.6 percent of original size [2019-11-16 00:12:39,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:39,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:39,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 126 [2019-11-16 00:12:39,385 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:12:39,521 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-16 00:12:39,522 INFO L567 ElimStorePlain]: treesize reduction 52, result has 80.8 percent of original size [2019-11-16 00:12:39,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:39,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:39,526 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:327, output treesize:409 [2019-11-16 00:12:39,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:40,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:40,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:41,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:42,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:42,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:12:42,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:42,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 309 treesize of output 252 [2019-11-16 00:12:42,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,397 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:42,540 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-11-16 00:12:42,540 INFO L567 ElimStorePlain]: treesize reduction 152, result has 47.6 percent of original size [2019-11-16 00:12:42,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:42,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:12:42,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:12:42,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 57 [2019-11-16 00:12:42,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:12:42,557 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:12:42,608 INFO L567 ElimStorePlain]: treesize reduction 28, result has 67.4 percent of original size [2019-11-16 00:12:42,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:12:42,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:333, output treesize:38 [2019-11-16 00:12:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:43,409 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:12:43,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 81 [2019-11-16 00:12:43,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21244698] [2019-11-16 00:12:43,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-11-16 00:12:43,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-11-16 00:12:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=6407, Unknown=10, NotChecked=0, Total=6642 [2019-11-16 00:12:43,413 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 82 states. [2019-11-16 00:13:01,561 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-11-16 00:13:06,043 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-11-16 00:13:15,162 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-11-16 00:13:27,583 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-11-16 00:13:40,111 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-16 00:13:54,868 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 110 DAG size of output: 65 [2019-11-16 00:14:07,465 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2019-11-16 00:14:12,734 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 62 [2019-11-16 00:14:13,723 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2019-11-16 00:14:14,204 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 85 [2019-11-16 00:14:14,971 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 96 [2019-11-16 00:14:15,695 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 96 [2019-11-16 00:14:16,383 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 100 [2019-11-16 00:14:17,142 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 105 [2019-11-16 00:14:17,561 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-11-16 00:14:18,054 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2019-11-16 00:14:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:20,015 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-11-16 00:14:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-16 00:14:20,015 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 70 [2019-11-16 00:14:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:20,016 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:14:20,016 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:14:20,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 92.4s TimeCoverageRelationStatistics Valid=586, Invalid=12500, Unknown=24, NotChecked=0, Total=13110 [2019-11-16 00:14:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:14:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2019-11-16 00:14:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-16 00:14:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-11-16 00:14:20,025 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 70 [2019-11-16 00:14:20,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:20,025 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-11-16 00:14:20,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-11-16 00:14:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-11-16 00:14:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:14:20,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:14:20,027 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:14:20,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:20,227 INFO L410 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:14:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -972015233, now seen corresponding path program 1 times [2019-11-16 00:14:20,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:20,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377287561] [2019-11-16 00:14:20,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:20,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:20,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-16 00:14:20,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377287561] [2019-11-16 00:14:20,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3730482] [2019-11-16 00:14:20,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:14:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:20,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:14:20,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-16 00:14:20,639 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:14:20,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-11-16 00:14:20,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96962952] [2019-11-16 00:14:20,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:14:20,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:14:20,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:14:20,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:14:20,641 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 11 states. [2019-11-16 00:14:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:14:20,949 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-11-16 00:14:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:14:20,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-11-16 00:14:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:14:20,950 INFO L225 Difference]: With dead ends: 98 [2019-11-16 00:14:20,950 INFO L226 Difference]: Without dead ends: 97 [2019-11-16 00:14:20,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:14:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-16 00:14:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2019-11-16 00:14:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-16 00:14:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-11-16 00:14:20,953 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 75 [2019-11-16 00:14:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:14:20,953 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-11-16 00:14:20,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:14:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-11-16 00:14:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:14:20,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:14:20,954 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:14:21,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:14:21,155 INFO L410 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:14:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:14:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 241911731, now seen corresponding path program 3 times [2019-11-16 00:14:21,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:14:21,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235822842] [2019-11-16 00:14:21,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:21,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:14:21,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:14:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:23,623 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-16 00:14:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:24,186 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2019-11-16 00:14:24,581 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-11-16 00:14:25,037 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-11-16 00:14:25,517 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 50 [2019-11-16 00:14:26,718 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-16 00:14:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:14:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:14:28,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235822842] [2019-11-16 00:14:28,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557836380] [2019-11-16 00:14:28,487 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:14:29,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:14:29,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:14:29,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 181 conjunts are in the unsatisfiable core [2019-11-16 00:14:29,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:14:29,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:14:29,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:14:29,139 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 13 treesize of output 9 [2019-11-16 00:14:29,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,155 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 13 treesize of output 9 [2019-11-16 00:14:29,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,168 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-11-16 00:14:29,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:14:29,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-16 00:14:29,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-16 00:14:29,231 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,238 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:10 [2019-11-16 00:14:29,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:14:29,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,935 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.0 percent of original size [2019-11-16 00:14:29,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:14:29,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-16 00:14:29,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:14:29,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-11-16 00:14:29,973 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:29,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:29,995 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:88, output treesize:64 [2019-11-16 00:14:30,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-16 00:14:30,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:30,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:30,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-16 00:14:30,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:30,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:30,336 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-16 00:14:30,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:82 [2019-11-16 00:14:30,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-11-16 00:14:30,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:31,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:31,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:14:31,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:31,063 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 108 treesize of output 80 [2019-11-16 00:14:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:14:31,070 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:14:31,151 INFO L567 ElimStorePlain]: treesize reduction 38, result has 61.6 percent of original size [2019-11-16 00:14:31,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:14:31,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:14:31,159 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 35 treesize of output 18 [2019-11-16 00:14:31,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:14:31,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:31,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:14:31,176 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:10 [2019-11-16 00:14:32,430 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:14:32,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:32,465 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:14:32,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:14:32,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:14:32,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:97 [2019-11-16 00:14:39,492 WARN L191 SmtUtils]: Spent 3.07 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-16 00:15:07,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:15:07,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 34 treesize of output 44 [2019-11-16 00:15:07,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:15:07,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:15:07,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:15:07,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:15:07,235 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:15:07,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 191 treesize of output 255 [2019-11-16 00:15:07,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:15:07,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:15:07,259 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:15:07,465 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-11-16 00:15:07,465 INFO L567 ElimStorePlain]: treesize reduction 248, result has 45.0 percent of original size [2019-11-16 00:15:07,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:15:07,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:15:07,534 INFO L341 Elim1Store]: treesize reduction 73, result has 58.0 percent of original size [2019-11-16 00:15:07,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 163 [2019-11-16 00:15:07,535 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:15:07,662 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-11-16 00:15:07,662 INFO L567 ElimStorePlain]: treesize reduction 141, result has 50.5 percent of original size [2019-11-16 00:15:07,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:15:07,663 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:330, output treesize:329 [2019-11-16 00:20:48,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:20:48,896 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:20:48,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:48,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 438 treesize of output 272 [2019-11-16 00:20:48,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:20:49,060 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:20:49,208 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2019-11-16 00:20:49,208 INFO L567 ElimStorePlain]: treesize reduction 179, result has 41.1 percent of original size [2019-11-16 00:20:49,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:49,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:49,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:49,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:49,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 45 [2019-11-16 00:20:49,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:49,277 INFO L567 ElimStorePlain]: treesize reduction 7, result has 84.1 percent of original size [2019-11-16 00:20:49,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:49,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:452, output treesize:10 [2019-11-16 00:20:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:20:49,371 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:20:49,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 80 [2019-11-16 00:20:49,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214024697] [2019-11-16 00:20:49,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-11-16 00:20:49,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-11-16 00:20:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5910, Unknown=169, NotChecked=0, Total=6320 [2019-11-16 00:20:49,377 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 80 states. [2019-11-16 00:20:59,922 WARN L191 SmtUtils]: Spent 7.79 s on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-11-16 00:21:01,480 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:21:01,866 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-16 00:21:02,193 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-16 00:21:02,545 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:21:03,075 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-11-16 00:21:03,389 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-11-16 00:21:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:04,212 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2019-11-16 00:21:04,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:21:04,213 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 75 [2019-11-16 00:21:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:04,213 INFO L225 Difference]: With dead ends: 90 [2019-11-16 00:21:04,213 INFO L226 Difference]: Without dead ends: 90 [2019-11-16 00:21:04,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2858 ImplicationChecksByTransitivity, 396.9s TimeCoverageRelationStatistics Valid=474, Invalid=10487, Unknown=169, NotChecked=0, Total=11130 [2019-11-16 00:21:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-16 00:21:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-11-16 00:21:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-16 00:21:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-11-16 00:21:04,216 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 75 [2019-11-16 00:21:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:04,217 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-11-16 00:21:04,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-11-16 00:21:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-11-16 00:21:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:21:04,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:04,218 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:04,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:21:04,418 INFO L410 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:21:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1360680158, now seen corresponding path program 2 times [2019-11-16 00:21:04,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:04,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397550042] [2019-11-16 00:21:04,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:04,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:04,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-16 00:21:04,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397550042] [2019-11-16 00:21:04,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481403335] [2019-11-16 00:21:04,584 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:21:04,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:21:04,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:21:04,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-16 00:21:04,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:04,884 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-16 00:21:04,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:04,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:04,896 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-16 00:21:04,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:04,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:04,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:04,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:30 [2019-11-16 00:21:04,965 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 23 treesize of output 15 [2019-11-16 00:21:04,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:04,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:04,974 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 33 treesize of output 17 [2019-11-16 00:21:04,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:04,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:04,979 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-16 00:21:04,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2019-11-16 00:21:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:21:05,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:21:05,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 23 [2019-11-16 00:21:05,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385300413] [2019-11-16 00:21:05,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:21:05,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:21:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:21:05,070 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 15 states. [2019-11-16 00:21:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:05,409 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-11-16 00:21:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:21:05,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2019-11-16 00:21:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:05,416 INFO L225 Difference]: With dead ends: 88 [2019-11-16 00:21:05,416 INFO L226 Difference]: Without dead ends: 88 [2019-11-16 00:21:05,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:21:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-16 00:21:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-11-16 00:21:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:21:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-11-16 00:21:05,419 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 80 [2019-11-16 00:21:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:05,419 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-11-16 00:21:05,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:21:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-11-16 00:21:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:21:05,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:05,420 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:05,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:21:05,624 INFO L410 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:21:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 119869960, now seen corresponding path program 1 times [2019-11-16 00:21:05,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:05,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460632997] [2019-11-16 00:21:05,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:05,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:05,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-16 00:21:05,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460632997] [2019-11-16 00:21:05,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134230162] [2019-11-16 00:21:05,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:21:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:21:06,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:06,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:06,025 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 23 treesize of output 15 [2019-11-16 00:21:06,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:06,030 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 23 treesize of output 19 [2019-11-16 00:21:06,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:06,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:06,043 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 16 treesize of output 8 [2019-11-16 00:21:06,043 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:06,045 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 12 treesize of output 8 [2019-11-16 00:21:06,045 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:06,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:06,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:21:06,049 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-11-16 00:21:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-16 00:21:06,060 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:21:06,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2019-11-16 00:21:06,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506300400] [2019-11-16 00:21:06,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:21:06,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:21:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:21:06,063 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 11 states. [2019-11-16 00:21:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:06,547 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-11-16 00:21:06,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:21:06,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-11-16 00:21:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:06,548 INFO L225 Difference]: With dead ends: 88 [2019-11-16 00:21:06,549 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:21:06,549 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:21:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:21:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-11-16 00:21:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:21:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-11-16 00:21:06,552 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 83 [2019-11-16 00:21:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:06,552 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-11-16 00:21:06,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:21:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-11-16 00:21:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:21:06,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:06,553 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:06,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:21:06,762 INFO L410 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:21:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash 121205687, now seen corresponding path program 1 times [2019-11-16 00:21:06,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:06,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109230268] [2019-11-16 00:21:06,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:06,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:06,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:21:07,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109230268] [2019-11-16 00:21:07,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:07,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:21:07,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528612555] [2019-11-16 00:21:07,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:21:07,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:07,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:21:07,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:21:07,050 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 14 states. [2019-11-16 00:21:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:07,609 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-11-16 00:21:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:21:07,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-16 00:21:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:07,610 INFO L225 Difference]: With dead ends: 85 [2019-11-16 00:21:07,610 INFO L226 Difference]: Without dead ends: 85 [2019-11-16 00:21:07,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:21:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-16 00:21:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-11-16 00:21:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-16 00:21:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-11-16 00:21:07,613 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 83 [2019-11-16 00:21:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:07,614 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-11-16 00:21:07,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:21:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-11-16 00:21:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:21:07,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:07,615 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:21:07,615 INFO L410 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:21:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1228821214, now seen corresponding path program 1 times [2019-11-16 00:21:07,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:07,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948900617] [2019-11-16 00:21:07,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:07,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:07,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:09,746 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-16 00:21:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:21:10,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948900617] [2019-11-16 00:21:10,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642138166] [2019-11-16 00:21:10,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:21:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:11,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-16 00:21:11,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:11,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:21:11,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:11,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:11,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:11,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:21:11,411 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-16 00:21:11,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:11,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:11,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:11,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-11-16 00:21:12,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:12,002 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 31 treesize of output 35 [2019-11-16 00:21:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:12,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:21:12,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:12,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:12,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:123, output treesize:119 [2019-11-16 00:21:13,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:13,107 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 189 treesize of output 130 [2019-11-16 00:21:13,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,113 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-16 00:21:13,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:13,140 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 194 treesize of output 145 [2019-11-16 00:21:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,146 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:21:13,243 INFO L567 ElimStorePlain]: treesize reduction 114, result has 58.7 percent of original size [2019-11-16 00:21:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-16 00:21:13,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:384, output treesize:162 [2019-11-16 00:21:13,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:21:13,691 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:21:14,258 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-16 00:21:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:21:14,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:14,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 123 [2019-11-16 00:21:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,317 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:21:14,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:14,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 96 [2019-11-16 00:21:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,359 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:21:14,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:14,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:14,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 123 [2019-11-16 00:21:14,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,413 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:21:14,582 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-11-16 00:21:14,583 INFO L567 ElimStorePlain]: treesize reduction 28, result has 85.2 percent of original size [2019-11-16 00:21:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-16 00:21:14,587 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:246, output treesize:161 [2019-11-16 00:21:14,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:21:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:21:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:21:15,050 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 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:21:15,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:15,064 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-11-16 00:21:15,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:21:15,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2019-11-16 00:21:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:21:15,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:21:15,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 70 [2019-11-16 00:21:15,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526270651] [2019-11-16 00:21:15,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-11-16 00:21:15,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-11-16 00:21:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=4771, Unknown=0, NotChecked=0, Total=4970 [2019-11-16 00:21:15,212 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 71 states. [2019-11-16 00:21:21,079 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2019-11-16 00:21:21,338 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-11-16 00:21:21,906 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 154 [2019-11-16 00:21:22,459 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2019-11-16 00:21:23,017 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 157 [2019-11-16 00:21:23,522 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 143 [2019-11-16 00:21:24,011 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 139 [2019-11-16 00:21:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:24,712 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2019-11-16 00:21:24,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-16 00:21:24,713 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 86 [2019-11-16 00:21:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:24,713 INFO L225 Difference]: With dead ends: 96 [2019-11-16 00:21:24,713 INFO L226 Difference]: Without dead ends: 96 [2019-11-16 00:21:24,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3050 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=680, Invalid=12200, Unknown=2, NotChecked=0, Total=12882 [2019-11-16 00:21:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-16 00:21:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2019-11-16 00:21:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-16 00:21:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-11-16 00:21:24,717 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 86 [2019-11-16 00:21:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:24,731 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-11-16 00:21:24,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-11-16 00:21:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-11-16 00:21:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:21:24,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:24,732 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:21:24,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:21:24,936 INFO L410 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION]=== [2019-11-16 00:21:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1228821213, now seen corresponding path program 1 times [2019-11-16 00:21:24,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:24,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159201140] [2019-11-16 00:21:24,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:24,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:24,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:26,500 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-11-16 00:21:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:27,363 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-16 00:21:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:21:27,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159201140] [2019-11-16 00:21:27,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720350569] [2019-11-16 00:21:27,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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-16 00:21:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:27,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:21:27,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:33,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:21:33,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:33,150 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 79 treesize of output 81 [2019-11-16 00:21:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:21:33,152 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:21:33,189 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-16 00:21:33,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:21:33,391 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:21:33,394 INFO L168 Benchmark]: Toolchain (without parser) took 771837.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 939.3 MB in the beginning and 899.6 MB in the end (delta: 39.8 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:33,394 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:33,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:33,395 INFO L168 Benchmark]: Boogie Preprocessor took 109.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:33,395 INFO L168 Benchmark]: RCFGBuilder took 664.41 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:33,395 INFO L168 Benchmark]: TraceAbstraction took 770500.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.6 MB). Free memory was 1.0 GB in the beginning and 899.6 MB in the end (delta: 143.9 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:33,397 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 558.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 664.41 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 770500.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.6 MB). Free memory was 1.0 GB in the beginning and 899.6 MB in the end (delta: 143.9 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. [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-16 00:21:35,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:21:35,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:21:35,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:21:35,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:21:35,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:21:35,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:21:35,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:21:35,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:21:35,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:21:35,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:21:35,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:21:35,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:21:35,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:21:35,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:21:35,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:21:35,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:21:35,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:21:35,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:21:35,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:21:35,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:21:35,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:21:35,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:21:35,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:21:35,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:21:35,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:21:35,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:21:35,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:21:35,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:21:35,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:21:35,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:21:35,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:21:35,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:21:35,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:21:35,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:21:35,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:21:35,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:21:35,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:21:35,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:21:35,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:21:35,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:21:35,508 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:21:35,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:21:35,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:21:35,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:21:35,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:21:35,545 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:21:35,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:21:35,550 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:21:35,551 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:21:35,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:21:35,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:21:35,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:21:35,552 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:21:35,553 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:21:35,553 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:21:35,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:21:35,553 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:21:35,554 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:21:35,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:21:35,554 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:21:35,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:21:35,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:21:35,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:21:35,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:21:35,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:35,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:21:35,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:21:35,560 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:21:35,560 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:21:35,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:21:35,560 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_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/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 -> 85f309ef7120c25bf3b7104ad3a9bfa2e1a59886 [2019-11-16 00:21:35,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:21:35,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:21:35,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:21:35,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:21:35,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:21:35,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2019-11-16 00:21:35,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/741a84f06/1df7a38401714574b5b3658f4104d6bd/FLAG0e1fcb730 [2019-11-16 00:21:36,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:21:36,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2019-11-16 00:21:36,095 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/741a84f06/1df7a38401714574b5b3658f4104d6bd/FLAG0e1fcb730 [2019-11-16 00:21:36,405 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/data/741a84f06/1df7a38401714574b5b3658f4104d6bd [2019-11-16 00:21:36,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:21:36,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:21:36,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:36,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:21:36,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:21:36,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58365d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36, skipping insertion in model container [2019-11-16 00:21:36,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:21:36,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:21:36,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:36,838 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:21:36,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:36,940 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:21:36,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36 WrapperNode [2019-11-16 00:21:36,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:36,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:21:36,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:21:36,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:21:36,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:36,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:37,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... [2019-11-16 00:21:37,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:21:37,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:21:37,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:21:37,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:21:37,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:21:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:21:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:21:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:21:37,067 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:21:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:21:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-16 00:21:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-11-16 00:21:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-11-16 00:21:37,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:21:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:21:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:21:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:21:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:21:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:21:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:21:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:21:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:21:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:21:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:21:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:21:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:21:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:21:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:21:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:21:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:21:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:21:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:21:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:21:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:21:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:21:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:21:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:21:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:21:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:21:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:21:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:21:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:21:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:21:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:21:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:21:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:21:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:21:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:21:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:21:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:21:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:21:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:21:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:21:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:21:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:21:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:21:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:21:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:21:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:21:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:21:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:21:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:21:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:21:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:21:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:21:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:21:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:21:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:21:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:21:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:21:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:21:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:21:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:21:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:21:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:21:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:21:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:21:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:21:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:21:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:21:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:21:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:21:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:21:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:21:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:21:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:21:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:21:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:21:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:21:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:21:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:21:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:21:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:21:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:21:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:21:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:21:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:21:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:21:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:21:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:21:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:21:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:21:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:21:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:21:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:21:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:21:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-16 00:21:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-11-16 00:21:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:21:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:21:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-11-16 00:21:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:21:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:21:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:21:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:21:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:21:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:21:37,437 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:21:37,811 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:21:37,812 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-16 00:21:37,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:37 BoogieIcfgContainer [2019-11-16 00:21:37,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:21:37,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:21:37,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:21:37,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:21:37,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:36" (1/3) ... [2019-11-16 00:21:37,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@971eb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:37, skipping insertion in model container [2019-11-16 00:21:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:36" (2/3) ... [2019-11-16 00:21:37,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@971eb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:37, skipping insertion in model container [2019-11-16 00:21:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:37" (3/3) ... [2019-11-16 00:21:37,821 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2019-11-16 00:21:37,831 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:21:37,838 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2019-11-16 00:21:37,849 INFO L249 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2019-11-16 00:21:37,867 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:21:37,867 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:21:37,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:21:37,867 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:21:37,868 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:21:37,868 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:21:37,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:21:37,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:21:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-16 00:21:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:21:37,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:37,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:37,898 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, sll_prependErr1REQUIRES_VIOLATION, sll_prependErr2REQUIRES_VIOLATION, sll_prependErr3REQUIRES_VIOLATION, sll_prependErr4REQUIRES_VIOLATION, sll_prependErr5REQUIRES_VIOLATION, sll_prependErr0REQUIRES_VIOLATION]=== [2019-11-16 00:21:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash -426863343, now seen corresponding path program 1 times [2019-11-16 00:21:37,910 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:37,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [842385451] [2019-11-16 00:21:37,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4d7580b7-7e70-4656-82f0-e9a08bdfa18f/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:38,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:38,129 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:21:38,134 INFO L168 Benchmark]: Toolchain (without parser) took 1725.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -100.7 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:38,134 INFO L168 Benchmark]: CDTParser took 0.24 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-16 00:21:38,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 532.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:38,136 INFO L168 Benchmark]: Boogie Preprocessor took 69.10 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:38,138 INFO L168 Benchmark]: RCFGBuilder took 802.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:38,138 INFO L168 Benchmark]: TraceAbstraction took 317.45 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:38,141 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.24 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 532.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.10 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 802.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 317.45 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: 12.1 MB). Peak memory consumption was 12.1 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...