./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.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_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/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 5a3a274b64e7ba6d81948d0b8c45cbd715251888 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/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 5a3a274b64e7ba6d81948d0b8c45cbd715251888 ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:11:53,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:11:53,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:11:53,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:11:53,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:11:53,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:11:53,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:11:53,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:11:53,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:11:53,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:11:53,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:11:53,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:11:53,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:11:53,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:11:53,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:11:53,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:11:53,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:11:53,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:11:53,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:11:53,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:11:53,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:11:53,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:11:53,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:11:53,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:11:53,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:11:53,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:11:53,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:11:53,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:11:53,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:11:53,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:11:53,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:11:53,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:11:53,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:11:53,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:11:53,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:11:53,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:11:53,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:11:53,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:11:53,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:11:53,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:11:53,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:11:53,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:11:53,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:11:53,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:11:53,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:11:53,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:11:53,354 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:11:53,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:11:53,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:11:53,354 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:11:53,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:11:53,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:11:53,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:11:53,355 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:11:53,355 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:11:53,355 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:11:53,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:11:53,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:11:53,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:11:53,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:11:53,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:11:53,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:11:53,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:11:53,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:11:53,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:11:53,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:11:53,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:11:53,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:11:53,368 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_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/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 -> 5a3a274b64e7ba6d81948d0b8c45cbd715251888 [2019-11-15 21:11:53,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:11:53,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:11:53,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:11:53,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:11:53,418 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:11:53,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2019-11-15 21:11:53,479 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/a5170660f/52b9de2928e04f008b9faf799c5359cb/FLAG8ab264eed [2019-11-15 21:11:53,908 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:11:53,909 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2019-11-15 21:11:53,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/a5170660f/52b9de2928e04f008b9faf799c5359cb/FLAG8ab264eed [2019-11-15 21:11:54,285 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/a5170660f/52b9de2928e04f008b9faf799c5359cb [2019-11-15 21:11:54,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:11:54,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:11:54,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:11:54,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:11:54,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:11:54,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54, skipping insertion in model container [2019-11-15 21:11:54,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:11:54,356 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:11:54,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:11:54,712 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:11:54,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:11:54,812 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:11:54,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54 WrapperNode [2019-11-15 21:11:54,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:11:54,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:11:54,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:11:54,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:11:54,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... [2019-11-15 21:11:54,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:11:54,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:11:54,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:11:54,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:11:54,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:11:54,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:11:54,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:11:54,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:11:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:11:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:11:54,942 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:11:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:11:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:11:54,943 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:11:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:11:54,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:11:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:11:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:11:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:11:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:11:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:11:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:11:54,946 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:11:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:11:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:11:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:11:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:11:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:11:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:11:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:11:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:11:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:11:54,952 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:11:54,952 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:11:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:11:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:11:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:11:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:11:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:11:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:11:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:11:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:11:54,956 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:11:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:11:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:11:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:11:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:11:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:11:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:11:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:11:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:11:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:11:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:11:54,963 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:11:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:11:54,964 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:11:54,965 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:11:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:11:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:11:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:11:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:11:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:11:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:11:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:11:54,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:11:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:11:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:11:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:11:54,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:11:55,714 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:11:55,714 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:11:55,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:55 BoogieIcfgContainer [2019-11-15 21:11:55,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:11:55,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:11:55,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:11:55,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:11:55,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:11:54" (1/3) ... [2019-11-15 21:11:55,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54359197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:11:55, skipping insertion in model container [2019-11-15 21:11:55,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:54" (2/3) ... [2019-11-15 21:11:55,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54359197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:11:55, skipping insertion in model container [2019-11-15 21:11:55,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:55" (3/3) ... [2019-11-15 21:11:55,726 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2019-11-15 21:11:55,736 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:11:55,746 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-11-15 21:11:55,757 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-11-15 21:11:55,778 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:11:55,781 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:11:55,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:11:55,781 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:11:55,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:11:55,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:11:55,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:11:55,783 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:11:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2019-11-15 21:11:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:11:55,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:55,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:55,817 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash -821259240, now seen corresponding path program 1 times [2019-11-15 21:11:55,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:55,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630457520] [2019-11-15 21:11:55,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:55,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:55,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:56,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630457520] [2019-11-15 21:11:56,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:56,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:11:56,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657361525] [2019-11-15 21:11:56,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:11:56,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:56,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:11:56,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:11:56,079 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 4 states. [2019-11-15 21:11:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:56,494 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-11-15 21:11:56,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:11:56,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:11:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:56,509 INFO L225 Difference]: With dead ends: 127 [2019-11-15 21:11:56,509 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 21:11:56,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:11:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 21:11:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2019-11-15 21:11:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:11:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2019-11-15 21:11:56,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 7 [2019-11-15 21:11:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:56,571 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2019-11-15 21:11:56,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:11:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2019-11-15 21:11:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:11:56,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:56,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:56,573 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -821259239, now seen corresponding path program 1 times [2019-11-15 21:11:56,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:56,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421212671] [2019-11-15 21:11:56,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:56,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:56,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:56,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421212671] [2019-11-15 21:11:56,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:56,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:11:56,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269263217] [2019-11-15 21:11:56,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:11:56,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:11:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:11:56,661 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 4 states. [2019-11-15 21:11:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:56,974 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-15 21:11:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:11:56,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:11:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:56,976 INFO L225 Difference]: With dead ends: 119 [2019-11-15 21:11:56,976 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 21:11:56,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:11:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 21:11:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2019-11-15 21:11:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 21:11:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-11-15 21:11:56,986 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 7 [2019-11-15 21:11:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:56,986 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-11-15 21:11:56,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:11:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-11-15 21:11:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:11:56,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:56,987 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:56,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1833450902, now seen corresponding path program 1 times [2019-11-15 21:11:56,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:56,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156969137] [2019-11-15 21:11:56,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:56,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:56,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:57,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156969137] [2019-11-15 21:11:57,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:57,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:11:57,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620404040] [2019-11-15 21:11:57,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:11:57,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:57,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:11:57,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:11:57,100 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 5 states. [2019-11-15 21:11:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:57,382 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2019-11-15 21:11:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:11:57,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 21:11:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:57,384 INFO L225 Difference]: With dead ends: 95 [2019-11-15 21:11:57,384 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 21:11:57,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:11:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 21:11:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-15 21:11:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 21:11:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-11-15 21:11:57,398 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 12 [2019-11-15 21:11:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:57,399 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-11-15 21:11:57,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:11:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-11-15 21:11:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:11:57,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:57,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:57,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:57,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1833450903, now seen corresponding path program 1 times [2019-11-15 21:11:57,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:57,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305899215] [2019-11-15 21:11:57,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:57,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:57,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:57,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305899215] [2019-11-15 21:11:57,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:57,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:11:57,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51479370] [2019-11-15 21:11:57,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:11:57,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:11:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:11:57,534 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 5 states. [2019-11-15 21:11:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:57,864 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-11-15 21:11:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:11:57,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 21:11:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:57,866 INFO L225 Difference]: With dead ends: 115 [2019-11-15 21:11:57,866 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 21:11:57,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:11:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 21:11:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2019-11-15 21:11:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 21:11:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-15 21:11:57,875 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 12 [2019-11-15 21:11:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:57,876 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-15 21:11:57,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:11:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-15 21:11:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:11:57,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:57,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:57,877 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1236711396, now seen corresponding path program 1 times [2019-11-15 21:11:57,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:57,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332699870] [2019-11-15 21:11:57,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:57,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:57,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:57,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332699870] [2019-11-15 21:11:57,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:57,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:11:57,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536440082] [2019-11-15 21:11:57,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:11:57,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:57,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:11:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:11:57,966 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 7 states. [2019-11-15 21:11:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:58,477 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2019-11-15 21:11:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:11:58,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 21:11:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:58,478 INFO L225 Difference]: With dead ends: 164 [2019-11-15 21:11:58,479 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:11:58,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:11:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:11:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 99. [2019-11-15 21:11:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 21:11:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-11-15 21:11:58,487 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 15 [2019-11-15 21:11:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:58,487 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-11-15 21:11:58,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:11:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-11-15 21:11:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:11:58,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:58,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:58,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:58,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1236711397, now seen corresponding path program 1 times [2019-11-15 21:11:58,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:58,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225392488] [2019-11-15 21:11:58,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:58,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:58,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:58,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225392488] [2019-11-15 21:11:58,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:58,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:11:58,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642862310] [2019-11-15 21:11:58,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:11:58,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:11:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:11:58,603 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2019-11-15 21:11:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:59,134 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2019-11-15 21:11:59,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:11:59,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 21:11:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:59,135 INFO L225 Difference]: With dead ends: 173 [2019-11-15 21:11:59,135 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 21:11:59,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:11:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 21:11:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 91. [2019-11-15 21:11:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 21:11:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-15 21:11:59,143 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 15 [2019-11-15 21:11:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:59,143 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-15 21:11:59,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:11:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-11-15 21:11:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:11:59,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:59,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:59,144 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1309291650, now seen corresponding path program 1 times [2019-11-15 21:11:59,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:59,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634708246] [2019-11-15 21:11:59,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:59,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:59,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:59,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634708246] [2019-11-15 21:11:59,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:59,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:11:59,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896918998] [2019-11-15 21:11:59,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:11:59,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:11:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:11:59,269 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2019-11-15 21:11:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:59,507 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2019-11-15 21:11:59,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:11:59,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-15 21:11:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:11:59,508 INFO L225 Difference]: With dead ends: 102 [2019-11-15 21:11:59,508 INFO L226 Difference]: Without dead ends: 102 [2019-11-15 21:11:59,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:11:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-15 21:11:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2019-11-15 21:11:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:11:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2019-11-15 21:11:59,514 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 19 [2019-11-15 21:11:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:11:59,514 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2019-11-15 21:11:59,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:11:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2019-11-15 21:11:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:11:59,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:11:59,515 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] [2019-11-15 21:11:59,516 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:11:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -911523577, now seen corresponding path program 1 times [2019-11-15 21:11:59,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:59,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395740552] [2019-11-15 21:11:59,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:59,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:59,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:59,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395740552] [2019-11-15 21:11:59,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717835432] [2019-11-15 21:11:59,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:59,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 21:11:59,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:59,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:59,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:11:59,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:59,854 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:11:59,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:59,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 21:11:59,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:11:59,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:59,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:59,881 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-15 21:11:59,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-15 21:11:59,951 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 17 treesize of output 9 [2019-11-15 21:11:59,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:59,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:59,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:59,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-11-15 21:11:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:59,991 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:11:59,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 21:11:59,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12388920] [2019-11-15 21:11:59,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:11:59,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:59,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:11:59,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:11:59,992 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 11 states. [2019-11-15 21:12:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:00,427 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2019-11-15 21:12:00,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:12:00,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-15 21:12:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:00,428 INFO L225 Difference]: With dead ends: 139 [2019-11-15 21:12:00,429 INFO L226 Difference]: Without dead ends: 139 [2019-11-15 21:12:00,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:12:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-15 21:12:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2019-11-15 21:12:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 21:12:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2019-11-15 21:12:00,435 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 22 [2019-11-15 21:12:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:00,435 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2019-11-15 21:12:00,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:12:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2019-11-15 21:12:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:12:00,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:00,436 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] [2019-11-15 21:12:00,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:00,640 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash -911523576, now seen corresponding path program 1 times [2019-11-15 21:12:00,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:00,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255254977] [2019-11-15 21:12:00,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:00,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:00,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:00,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255254977] [2019-11-15 21:12:00,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718294552] [2019-11-15 21:12:00,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:00,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 21:12:00,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:00,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:12:00,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:00,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:00,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:00,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:12:01,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:01,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-11-15 21:12:01,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:01,034 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-15 21:12:01,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:01,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2019-11-15 21:12:01,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:01,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:01,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:01,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:01,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:01,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:01,128 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-15 21:12:01,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2019-11-15 21:12:01,205 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 17 treesize of output 9 [2019-11-15 21:12:01,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:01,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:01,225 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 24 treesize of output 12 [2019-11-15 21:12:01,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:01,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:01,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:01,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2019-11-15 21:12:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:01,288 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:01,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 21:12:01,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352099352] [2019-11-15 21:12:01,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:12:01,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:12:01,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:12:01,290 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 16 states. [2019-11-15 21:12:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:02,378 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2019-11-15 21:12:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:12:02,378 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-15 21:12:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:02,380 INFO L225 Difference]: With dead ends: 158 [2019-11-15 21:12:02,380 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 21:12:02,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:12:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 21:12:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2019-11-15 21:12:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 21:12:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2019-11-15 21:12:02,387 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 22 [2019-11-15 21:12:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:02,387 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2019-11-15 21:12:02,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:12:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2019-11-15 21:12:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:12:02,388 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:02,388 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] [2019-11-15 21:12:02,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:02,593 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1805909334, now seen corresponding path program 1 times [2019-11-15 21:12:02,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:02,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554664439] [2019-11-15 21:12:02,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:02,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:02,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:02,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554664439] [2019-11-15 21:12:02,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:02,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:12:02,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837944089] [2019-11-15 21:12:02,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:12:02,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:12:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:12:02,674 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 8 states. [2019-11-15 21:12:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:03,001 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2019-11-15 21:12:03,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:12:03,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-15 21:12:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:03,003 INFO L225 Difference]: With dead ends: 145 [2019-11-15 21:12:03,003 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 21:12:03,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:12:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 21:12:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2019-11-15 21:12:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 21:12:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2019-11-15 21:12:03,008 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 23 [2019-11-15 21:12:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:03,008 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2019-11-15 21:12:03,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:12:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2019-11-15 21:12:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:12:03,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:03,009 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] [2019-11-15 21:12:03,010 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:03,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1805909335, now seen corresponding path program 1 times [2019-11-15 21:12:03,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:03,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799491928] [2019-11-15 21:12:03,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:03,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:03,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:03,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799491928] [2019-11-15 21:12:03,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:03,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:12:03,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893610520] [2019-11-15 21:12:03,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:12:03,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:12:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:12:03,147 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 9 states. [2019-11-15 21:12:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:03,641 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2019-11-15 21:12:03,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:12:03,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-15 21:12:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:03,643 INFO L225 Difference]: With dead ends: 162 [2019-11-15 21:12:03,643 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:12:03,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:12:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:12:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2019-11-15 21:12:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 21:12:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2019-11-15 21:12:03,647 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 23 [2019-11-15 21:12:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:03,648 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2019-11-15 21:12:03,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:12:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2019-11-15 21:12:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:12:03,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:03,649 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, 1] [2019-11-15 21:12:03,649 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1109958107, now seen corresponding path program 1 times [2019-11-15 21:12:03,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:03,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271549118] [2019-11-15 21:12:03,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:03,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:03,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:03,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271549118] [2019-11-15 21:12:03,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:03,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:12:03,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113426283] [2019-11-15 21:12:03,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:12:03,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:12:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:12:03,781 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 9 states. [2019-11-15 21:12:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:04,113 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2019-11-15 21:12:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:12:04,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-15 21:12:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:04,114 INFO L225 Difference]: With dead ends: 175 [2019-11-15 21:12:04,115 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 21:12:04,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:12:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 21:12:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 111. [2019-11-15 21:12:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:12:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-11-15 21:12:04,119 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 26 [2019-11-15 21:12:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:04,119 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-11-15 21:12:04,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:12:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-11-15 21:12:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:12:04,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:04,120 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, 1] [2019-11-15 21:12:04,120 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1083854378, now seen corresponding path program 1 times [2019-11-15 21:12:04,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:04,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813373032] [2019-11-15 21:12:04,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:04,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:04,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:04,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813373032] [2019-11-15 21:12:04,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:04,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:12:04,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687562122] [2019-11-15 21:12:04,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:12:04,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:12:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:12:04,192 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 8 states. [2019-11-15 21:12:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:04,505 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2019-11-15 21:12:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:12:04,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-15 21:12:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:04,507 INFO L225 Difference]: With dead ends: 157 [2019-11-15 21:12:04,507 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 21:12:04,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:12:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 21:12:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 111. [2019-11-15 21:12:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:12:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-11-15 21:12:04,512 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 26 [2019-11-15 21:12:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:04,512 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-11-15 21:12:04,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:12:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-11-15 21:12:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:12:04,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:04,513 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:04,514 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1868180739, now seen corresponding path program 2 times [2019-11-15 21:12:04,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:04,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249444005] [2019-11-15 21:12:04,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:04,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:04,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:12:04,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249444005] [2019-11-15 21:12:04,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:04,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:12:04,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888758887] [2019-11-15 21:12:04,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:12:04,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:04,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:12:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:12:04,722 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 9 states. [2019-11-15 21:12:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:05,148 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2019-11-15 21:12:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:12:05,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-15 21:12:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:05,150 INFO L225 Difference]: With dead ends: 135 [2019-11-15 21:12:05,150 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 21:12:05,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:12:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 21:12:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2019-11-15 21:12:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:12:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-11-15 21:12:05,155 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 26 [2019-11-15 21:12:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:05,156 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-11-15 21:12:05,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:12:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-11-15 21:12:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:12:05,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:05,159 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:12:05,160 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 72704195, now seen corresponding path program 1 times [2019-11-15 21:12:05,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:05,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395380247] [2019-11-15 21:12:05,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:05,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:05,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:05,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395380247] [2019-11-15 21:12:05,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15203132] [2019-11-15 21:12:05,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:05,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 21:12:05,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:05,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:05,538 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-15 21:12:05,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:05,556 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:12:05,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:05,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:12:05,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:05,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:05,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:05,604 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-15 21:12:05,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:12:05,705 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:05,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 21:12:05,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:05,720 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 21:12:05,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:05,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-11-15 21:12:05,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:05,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 21:12:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:05,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:12:05,793 INFO L567 ElimStorePlain]: treesize reduction 70, result has 33.3 percent of original size [2019-11-15 21:12:05,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:05,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 21:12:05,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:05,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:12:05,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:05,891 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 21:12:05,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:05,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 21:12:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:05,941 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:05,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-15 21:12:05,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764026260] [2019-11-15 21:12:05,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 21:12:05,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:05,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 21:12:05,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:12:05,943 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 22 states. [2019-11-15 21:12:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:07,178 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2019-11-15 21:12:07,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:12:07,179 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-15 21:12:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:07,180 INFO L225 Difference]: With dead ends: 166 [2019-11-15 21:12:07,180 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:12:07,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:12:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:12:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 124. [2019-11-15 21:12:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 21:12:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2019-11-15 21:12:07,185 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 26 [2019-11-15 21:12:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:07,185 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2019-11-15 21:12:07,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 21:12:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2019-11-15 21:12:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:12:07,186 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:07,186 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:12:07,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:07,390 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:07,390 INFO L82 PathProgramCache]: Analyzing trace with hash 72704196, now seen corresponding path program 1 times [2019-11-15 21:12:07,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:07,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374962165] [2019-11-15 21:12:07,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:07,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:07,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:07,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374962165] [2019-11-15 21:12:07,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192177866] [2019-11-15 21:12:07,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:07,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 21:12:07,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:07,769 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_62|]} [2019-11-15 21:12:07,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:12:07,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:07,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:07,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:07,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:07,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:12:07,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:07,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:07,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:07,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:07,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 21:12:07,977 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:07,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 21:12:07,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:07,999 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.1 percent of original size [2019-11-15 21:12:08,003 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 27 treesize of output 11 [2019-11-15 21:12:08,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:08,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:08,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:08,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:24 [2019-11-15 21:12:08,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:08,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-11-15 21:12:08,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:08,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:08,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:08,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:12:08,095 INFO L567 ElimStorePlain]: treesize reduction 108, result has 34.1 percent of original size [2019-11-15 21:12:08,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-11-15 21:12:08,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:08,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:08,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:08,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-11-15 21:12:08,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:08,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:12:08,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:08,227 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 21:12:08,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:12:08,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:08,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:08,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:08,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 21:12:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:08,253 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:08,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2019-11-15 21:12:08,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285786449] [2019-11-15 21:12:08,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:12:08,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:12:08,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:12:08,255 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 18 states. [2019-11-15 21:12:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:09,449 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2019-11-15 21:12:09,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:12:09,450 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-15 21:12:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:09,451 INFO L225 Difference]: With dead ends: 176 [2019-11-15 21:12:09,451 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 21:12:09,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:12:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 21:12:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2019-11-15 21:12:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 21:12:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2019-11-15 21:12:09,458 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 26 [2019-11-15 21:12:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:09,458 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2019-11-15 21:12:09,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:12:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2019-11-15 21:12:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:12:09,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:09,459 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, 1, 1] [2019-11-15 21:12:09,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:09,663 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 47332098, now seen corresponding path program 1 times [2019-11-15 21:12:09,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:09,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251876018] [2019-11-15 21:12:09,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:09,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:09,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:09,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251876018] [2019-11-15 21:12:09,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:09,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 21:12:09,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374491864] [2019-11-15 21:12:09,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:12:09,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:12:09,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:12:09,823 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 12 states. [2019-11-15 21:12:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:10,359 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2019-11-15 21:12:10,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:12:10,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-15 21:12:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:10,361 INFO L225 Difference]: With dead ends: 159 [2019-11-15 21:12:10,361 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:12:10,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:12:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:12:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2019-11-15 21:12:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 21:12:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2019-11-15 21:12:10,365 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 27 [2019-11-15 21:12:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:10,366 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2019-11-15 21:12:10,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:12:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2019-11-15 21:12:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:12:10,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:10,368 INFO L380 BasicCegarLoop]: trace histogram [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-15 21:12:10,369 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1249815265, now seen corresponding path program 1 times [2019-11-15 21:12:10,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:10,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299710539] [2019-11-15 21:12:10,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:10,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:10,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299710539] [2019-11-15 21:12:10,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865135718] [2019-11-15 21:12:10,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:10,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 21:12:10,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:10,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:10,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,801 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2019-11-15 21:12:10,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:10,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-15 21:12:10,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:10,835 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 27 treesize of output 11 [2019-11-15 21:12:10,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:10,848 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 27 treesize of output 11 [2019-11-15 21:12:10,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:12:10,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:10,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-11-15 21:12:10,949 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 27 treesize of output 11 [2019-11-15 21:12:10,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,965 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 27 treesize of output 11 [2019-11-15 21:12:10,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:22 [2019-11-15 21:12:10,978 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 19 treesize of output 18 [2019-11-15 21:12:10,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:10,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:10,994 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 19 treesize of output 18 [2019-11-15 21:12:10,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:11,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:11,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:11,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2019-11-15 21:12:11,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:11,175 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 61 treesize of output 63 [2019-11-15 21:12:11,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:11,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:11,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:11,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:11,179 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:11,209 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-15 21:12:11,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:11,216 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 26 treesize of output 21 [2019-11-15 21:12:11,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:11,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:11,223 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-15 21:12:11,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-15 21:12:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:11,271 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:11,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-15 21:12:11,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211745217] [2019-11-15 21:12:11,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 21:12:11,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 21:12:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:12:11,272 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 22 states. [2019-11-15 21:12:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:12,523 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2019-11-15 21:12:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:12:12,523 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-15 21:12:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:12,524 INFO L225 Difference]: With dead ends: 185 [2019-11-15 21:12:12,524 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 21:12:12,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:12:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 21:12:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 155. [2019-11-15 21:12:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 21:12:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2019-11-15 21:12:12,529 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 28 [2019-11-15 21:12:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:12,530 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2019-11-15 21:12:12,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 21:12:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2019-11-15 21:12:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:12:12,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:12,530 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:12,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:12,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2004953300, now seen corresponding path program 2 times [2019-11-15 21:12:12,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:12,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994566158] [2019-11-15 21:12:12,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:12,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:12,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:13,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994566158] [2019-11-15 21:12:13,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331709150] [2019-11-15 21:12:13,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:13,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:12:13,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:12:13,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 21:12:13,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:13,198 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:13,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 21:12:13,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:13,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:13,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,256 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-15 21:12:13,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2019-11-15 21:12:13,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:13,378 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 27 treesize of output 11 [2019-11-15 21:12:13,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,412 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:13,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 21:12:13,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,426 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 21:12:13,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:22 [2019-11-15 21:12:13,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2019-11-15 21:12:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:13,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,480 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-15 21:12:13,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-11-15 21:12:13,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,490 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2019-11-15 21:12:13,646 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-15 21:12:13,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:13,649 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:13,673 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-15 21:12:13,677 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 23 treesize of output 10 [2019-11-15 21:12:13,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:13,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:13,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2019-11-15 21:12:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:13,686 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:13,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-11-15 21:12:13,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984715088] [2019-11-15 21:12:13,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 21:12:13,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 21:12:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:12:13,687 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand 26 states. [2019-11-15 21:12:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:14,976 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2019-11-15 21:12:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:12:14,976 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2019-11-15 21:12:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:14,977 INFO L225 Difference]: With dead ends: 184 [2019-11-15 21:12:14,977 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 21:12:14,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:12:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 21:12:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 154. [2019-11-15 21:12:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 21:12:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2019-11-15 21:12:14,982 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 31 [2019-11-15 21:12:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:14,982 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2019-11-15 21:12:14,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 21:12:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2019-11-15 21:12:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:12:14,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:14,983 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:15,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:15,187 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1980172162, now seen corresponding path program 1 times [2019-11-15 21:12:15,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:15,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412865942] [2019-11-15 21:12:15,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:15,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:15,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:15,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412865942] [2019-11-15 21:12:15,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:15,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:15,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807998878] [2019-11-15 21:12:15,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:12:15,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:15,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:12:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:15,245 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 5 states. [2019-11-15 21:12:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:15,391 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2019-11-15 21:12:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:12:15,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 21:12:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:15,392 INFO L225 Difference]: With dead ends: 157 [2019-11-15 21:12:15,392 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 21:12:15,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:12:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 21:12:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-11-15 21:12:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 21:12:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2019-11-15 21:12:15,396 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 32 [2019-11-15 21:12:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:15,396 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2019-11-15 21:12:15,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:12:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2019-11-15 21:12:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:12:15,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:15,398 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:15,398 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -947054238, now seen corresponding path program 3 times [2019-11-15 21:12:15,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:15,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829861366] [2019-11-15 21:12:15,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:15,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:15,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:15,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829861366] [2019-11-15 21:12:15,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083983542] [2019-11-15 21:12:15,633 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:15,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:12:15,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:12:15,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 21:12:15,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:15,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:15,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:15,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:15,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:15,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:15,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 21:12:15,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:15,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:15,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:15,971 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-15 21:12:15,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-15 21:12:16,116 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:16,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 21:12:16,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,139 INFO L567 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2019-11-15 21:12:16,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:20 [2019-11-15 21:12:16,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 21:12:16,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,216 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-15 21:12:16,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-11-15 21:12:16,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,273 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:16,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 21:12:16,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:12:16,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,337 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-15 21:12:16,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-11-15 21:12:16,507 INFO L341 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2019-11-15 21:12:16,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2019-11-15 21:12:16,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,511 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:16,543 INFO L567 ElimStorePlain]: treesize reduction 22, result has 65.1 percent of original size [2019-11-15 21:12:16,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:16,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:44 [2019-11-15 21:12:16,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 104 [2019-11-15 21:12:16,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:16,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 54 [2019-11-15 21:12:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:16,835 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-11-15 21:12:16,836 INFO L567 ElimStorePlain]: treesize reduction 474, result has 15.1 percent of original size [2019-11-15 21:12:16,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 21:12:16,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:81 [2019-11-15 21:12:16,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:16,973 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_4], 6=[|#memory_$Pointer$.base|]} [2019-11-15 21:12:16,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:16,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:12:16,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:17,011 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.0 percent of original size [2019-11-15 21:12:17,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:17,030 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 52 treesize of output 62 [2019-11-15 21:12:17,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:17,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:17,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:17,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:17,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:17,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:17,034 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:17,079 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-15 21:12:17,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:17,080 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:89, output treesize:5 [2019-11-15 21:12:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:17,086 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:17,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-11-15 21:12:17,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756187493] [2019-11-15 21:12:17,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:12:17,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:17,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:12:17,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:12:17,087 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand 33 states. [2019-11-15 21:12:18,580 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-11-15 21:12:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:19,926 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2019-11-15 21:12:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 21:12:19,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-11-15 21:12:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:19,928 INFO L225 Difference]: With dead ends: 235 [2019-11-15 21:12:19,928 INFO L226 Difference]: Without dead ends: 235 [2019-11-15 21:12:19,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=587, Invalid=3193, Unknown=2, NotChecked=0, Total=3782 [2019-11-15 21:12:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-15 21:12:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 169. [2019-11-15 21:12:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:12:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2019-11-15 21:12:19,934 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 33 [2019-11-15 21:12:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:19,934 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2019-11-15 21:12:19,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:12:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2019-11-15 21:12:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:12:19,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:19,935 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:20,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:20,139 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash -947054237, now seen corresponding path program 2 times [2019-11-15 21:12:20,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:20,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119063217] [2019-11-15 21:12:20,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:20,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:20,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:20,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119063217] [2019-11-15 21:12:20,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367560532] [2019-11-15 21:12:20,479 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:20,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:12:20,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:12:20,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 21:12:20,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:20,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:20,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:20,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:20,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:20,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:20,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 21:12:20,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:20,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:20,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:20,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:20,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:20,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:20,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:20,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-11-15 21:12:20,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:20,963 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 27 treesize of output 11 [2019-11-15 21:12:20,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:20,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:20,995 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:20,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 21:12:20,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,013 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 21:12:21,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,013 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:27 [2019-11-15 21:12:21,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:21,045 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 19 treesize of output 18 [2019-11-15 21:12:21,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 21:12:21,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,104 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.7 percent of original size [2019-11-15 21:12:21,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:44 [2019-11-15 21:12:21,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,150 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:21,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2019-11-15 21:12:21,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:12:21,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:12:21,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,250 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-15 21:12:21,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:40 [2019-11-15 21:12:21,373 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_56|]} [2019-11-15 21:12:21,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:21,378 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 27 treesize of output 11 [2019-11-15 21:12:21,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,440 INFO L341 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2019-11-15 21:12:21,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2019-11-15 21:12:21,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,444 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:21,487 INFO L567 ElimStorePlain]: treesize reduction 22, result has 70.7 percent of original size [2019-11-15 21:12:21,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:21,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:62 [2019-11-15 21:12:21,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,564 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_47|], 10=[|v_#memory_$Pointer$.base_57|]} [2019-11-15 21:12:21,575 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 99 treesize of output 90 [2019-11-15 21:12:21,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,583 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 73 treesize of output 68 [2019-11-15 21:12:21,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 123 [2019-11-15 21:12:21,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,667 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:21,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 75 [2019-11-15 21:12:21,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,719 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:21,949 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-11-15 21:12:21,949 INFO L567 ElimStorePlain]: treesize reduction 379, result has 29.8 percent of original size [2019-11-15 21:12:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:21,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 21:12:21,951 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:173, output treesize:161 [2019-11-15 21:12:21,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:22,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:22,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:22,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:22,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:22,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:22,787 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_12, v_prenex_11, v_prenex_16], 6=[v_prenex_15]} [2019-11-15 21:12:22,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:22,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2019-11-15 21:12:22,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:22,889 INFO L567 ElimStorePlain]: treesize reduction 12, result has 94.1 percent of original size [2019-11-15 21:12:22,894 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 38 treesize of output 26 [2019-11-15 21:12:22,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:22,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:22,958 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 66 treesize of output 50 [2019-11-15 21:12:22,958 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:22,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:23,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:23,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-11-15 21:12:23,006 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:23,067 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.2 percent of original size [2019-11-15 21:12:23,071 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 86 treesize of output 66 [2019-11-15 21:12:23,071 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:23,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:23,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:23,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 70 [2019-11-15 21:12:23,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,121 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:23,184 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.3 percent of original size [2019-11-15 21:12:23,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 21:12:23,187 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:221, output treesize:36 [2019-11-15 21:12:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:23,277 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:23,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2019-11-15 21:12:23,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890960747] [2019-11-15 21:12:23,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 21:12:23,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 21:12:23,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1065, Unknown=8, NotChecked=0, Total=1190 [2019-11-15 21:12:23,279 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand 35 states. [2019-11-15 21:12:24,385 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-11-15 21:12:24,796 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 69 [2019-11-15 21:12:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:27,136 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2019-11-15 21:12:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 21:12:27,139 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 33 [2019-11-15 21:12:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:27,140 INFO L225 Difference]: With dead ends: 224 [2019-11-15 21:12:27,140 INFO L226 Difference]: Without dead ends: 224 [2019-11-15 21:12:27,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=427, Invalid=2871, Unknown=8, NotChecked=0, Total=3306 [2019-11-15 21:12:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-15 21:12:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 171. [2019-11-15 21:12:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:12:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2019-11-15 21:12:27,146 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 33 [2019-11-15 21:12:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:27,146 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2019-11-15 21:12:27,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 21:12:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2019-11-15 21:12:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:12:27,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:27,147 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:27,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:27,352 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -66733142, now seen corresponding path program 1 times [2019-11-15 21:12:27,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:27,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111851601] [2019-11-15 21:12:27,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:27,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:27,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:27,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111851601] [2019-11-15 21:12:27,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693022345] [2019-11-15 21:12:27,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:27,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 21:12:27,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:27,715 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-15 21:12:27,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:27,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,728 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-15 21:12:27,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:27,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:27,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2019-11-15 21:12:27,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:27,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:27,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:27,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:27,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:27,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-15 21:12:27,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 21:12:27,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:12:27,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 21:12:27,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 21:12:27,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:27,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:27,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:27,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:27,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 21:12:27,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:37 [2019-11-15 21:12:27,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:27,968 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:27,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2019-11-15 21:12:27,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905603535] [2019-11-15 21:12:27,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:12:27,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:12:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:12:27,969 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 21 states. [2019-11-15 21:12:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:29,279 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2019-11-15 21:12:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:12:29,280 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2019-11-15 21:12:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:29,281 INFO L225 Difference]: With dead ends: 209 [2019-11-15 21:12:29,281 INFO L226 Difference]: Without dead ends: 209 [2019-11-15 21:12:29,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:12:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-15 21:12:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 182. [2019-11-15 21:12:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-15 21:12:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 204 transitions. [2019-11-15 21:12:29,286 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 204 transitions. Word has length 35 [2019-11-15 21:12:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:29,286 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 204 transitions. [2019-11-15 21:12:29,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:12:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 204 transitions. [2019-11-15 21:12:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:12:29,287 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:29,287 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:29,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:29,491 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1484734334, now seen corresponding path program 1 times [2019-11-15 21:12:29,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:29,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545653146] [2019-11-15 21:12:29,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:29,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:29,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:29,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545653146] [2019-11-15 21:12:29,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390526280] [2019-11-15 21:12:29,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:29,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-15 21:12:29,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:29,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:29,941 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-15 21:12:29,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:29,967 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:12:29,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:29,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:12:30,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:30,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:30,014 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-15 21:12:30,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:12:30,134 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:30,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 21:12:30,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,155 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 21:12:30,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-11-15 21:12:30,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:30,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 21:12:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:30,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:12:30,243 INFO L567 ElimStorePlain]: treesize reduction 70, result has 33.3 percent of original size [2019-11-15 21:12:30,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:30,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 21:12:30,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:30,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:12:30,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,329 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-11-15 21:12:30,330 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-15 21:12:30,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:21 [2019-11-15 21:12:30,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:30,379 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 22 treesize of output 69 [2019-11-15 21:12:30,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,427 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-15 21:12:30,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:30,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:34 [2019-11-15 21:12:30,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:30,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:30,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:30,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:40 [2019-11-15 21:12:30,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2019-11-15 21:12:30,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:30,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:30,619 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-15 21:12:30,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:28 [2019-11-15 21:12:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:30,723 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:30,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-11-15 21:12:30,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400809703] [2019-11-15 21:12:30,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 21:12:30,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 21:12:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:12:30,725 INFO L87 Difference]: Start difference. First operand 182 states and 204 transitions. Second operand 29 states. [2019-11-15 21:12:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:33,568 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2019-11-15 21:12:33,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-15 21:12:33,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-11-15 21:12:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:33,570 INFO L225 Difference]: With dead ends: 309 [2019-11-15 21:12:33,570 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:12:33,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 21:12:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:12:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 194. [2019-11-15 21:12:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-15 21:12:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2019-11-15 21:12:33,577 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 35 [2019-11-15 21:12:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:33,577 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2019-11-15 21:12:33,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 21:12:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2019-11-15 21:12:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:12:33,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:33,578 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:33,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:33,779 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1484734333, now seen corresponding path program 1 times [2019-11-15 21:12:33,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:33,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722251464] [2019-11-15 21:12:33,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:33,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:33,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:34,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722251464] [2019-11-15 21:12:34,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794152564] [2019-11-15 21:12:34,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:34,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-15 21:12:34,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:34,264 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_54|], 3=[|v_#valid_71|]} [2019-11-15 21:12:34,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:12:34,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,296 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-15 21:12:34,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,319 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 21:12:34,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:12:34,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:34,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:34,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2019-11-15 21:12:34,484 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:34,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2019-11-15 21:12:34,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,510 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.1 percent of original size [2019-11-15 21:12:34,513 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 27 treesize of output 11 [2019-11-15 21:12:34,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 [2019-11-15 21:12:34,559 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 27 treesize of output 22 [2019-11-15 21:12:34,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,592 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 63 [2019-11-15 21:12:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:12:34,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:34,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:12:34,647 INFO L567 ElimStorePlain]: treesize reduction 110, result has 36.0 percent of original size [2019-11-15 21:12:34,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:34,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2019-11-15 21:12:34,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 43 [2019-11-15 21:12:34,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,803 INFO L567 ElimStorePlain]: treesize reduction 12, result has 79.7 percent of original size [2019-11-15 21:12:34,808 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:12:34,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:29 [2019-11-15 21:12:34,852 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_55|], 3=[|v_#valid_72|]} [2019-11-15 21:12:34,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:34,861 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-15 21:12:34,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,887 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 16 treesize of output 26 [2019-11-15 21:12:34,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:34,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-11-15 21:12:34,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:34,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:34,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:34,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:34,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:34,961 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:42 [2019-11-15 21:12:35,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2019-11-15 21:12:35,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:35,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:35,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:12:35,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:35,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:35,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:35,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:18 [2019-11-15 21:12:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:35,146 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:35,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2019-11-15 21:12:35,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783724170] [2019-11-15 21:12:35,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 21:12:35,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 21:12:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:12:35,147 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand 29 states. [2019-11-15 21:12:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:37,465 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2019-11-15 21:12:37,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 21:12:37,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-11-15 21:12:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:37,467 INFO L225 Difference]: With dead ends: 260 [2019-11-15 21:12:37,467 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 21:12:37,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 21:12:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 21:12:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2019-11-15 21:12:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 21:12:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2019-11-15 21:12:37,473 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 35 [2019-11-15 21:12:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:37,473 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2019-11-15 21:12:37,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 21:12:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2019-11-15 21:12:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:12:37,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:37,474 INFO L380 BasicCegarLoop]: trace histogram [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-15 21:12:37,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:37,677 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1985125890, now seen corresponding path program 1 times [2019-11-15 21:12:37,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:37,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021784192] [2019-11-15 21:12:37,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:37,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021784192] [2019-11-15 21:12:37,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552883946] [2019-11-15 21:12:37,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 21:12:38,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:38,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:38,143 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-15 21:12:38,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,160 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:12:38,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:12:38,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:38,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,212 INFO L567 ElimStorePlain]: treesize reduction 5, result has 84.8 percent of original size [2019-11-15 21:12:38,212 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-15 21:12:38,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-15 21:12:38,326 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:38,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 21:12:38,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,340 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 21:12:38,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-11-15 21:12:38,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:38,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 21:12:38,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:38,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,389 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-15 21:12:38,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:38,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 21:12:38,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:38,463 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 26 treesize of output 89 [2019-11-15 21:12:38,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,492 INFO L567 ElimStorePlain]: treesize reduction 40, result has 56.0 percent of original size [2019-11-15 21:12:38,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:38,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:51 [2019-11-15 21:12:38,582 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 21:12:38,582 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 56 [2019-11-15 21:12:38,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,628 INFO L567 ElimStorePlain]: treesize reduction 34, result has 60.0 percent of original size [2019-11-15 21:12:38,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:38,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:51 [2019-11-15 21:12:38,661 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_53|], 6=[|v_#memory_$Pointer$.base_71|]} [2019-11-15 21:12:38,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:38,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:38,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:38,723 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 77 [2019-11-15 21:12:38,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,769 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-11-15 21:12:38,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:38,770 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:95 [2019-11-15 21:12:38,904 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 80 treesize of output 60 [2019-11-15 21:12:38,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:38,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:38,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:38,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:109, output treesize:86 [2019-11-15 21:12:39,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:39,069 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 85 treesize of output 71 [2019-11-15 21:12:39,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:39,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:39,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:39,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:39,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:39,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:39,073 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:39,109 INFO L567 ElimStorePlain]: treesize reduction 36, result has 43.8 percent of original size [2019-11-15 21:12:39,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:39,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2019-11-15 21:12:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:39,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:12:39,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 34 [2019-11-15 21:12:39,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253972571] [2019-11-15 21:12:39,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 21:12:39,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 21:12:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 21:12:39,229 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand 35 states. [2019-11-15 21:12:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:41,985 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2019-11-15 21:12:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-15 21:12:41,995 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-11-15 21:12:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:41,996 INFO L225 Difference]: With dead ends: 271 [2019-11-15 21:12:41,996 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 21:12:41,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 21:12:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 21:12:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 208. [2019-11-15 21:12:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-15 21:12:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 233 transitions. [2019-11-15 21:12:42,003 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 233 transitions. Word has length 35 [2019-11-15 21:12:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:42,003 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 233 transitions. [2019-11-15 21:12:42,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 21:12:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 233 transitions. [2019-11-15 21:12:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:12:42,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:42,005 INFO L380 BasicCegarLoop]: trace histogram [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-15 21:12:42,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:42,206 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION]=== [2019-11-15 21:12:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1985125889, now seen corresponding path program 1 times [2019-11-15 21:12:42,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:42,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170700609] [2019-11-15 21:12:42,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:42,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:42,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:42,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170700609] [2019-11-15 21:12:42,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322183791] [2019-11-15 21:12:42,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:42,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 21:12:43,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:43,048 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 1=[|v_#valid_75|]} [2019-11-15 21:12:43,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:12:43,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:43,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:12:43,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:43,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:12:43,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,131 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-11-15 21:12:43,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:12:43,226 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 27 treesize of output 11 [2019-11-15 21:12:43,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,254 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 21:12:43,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 21:12:43,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,271 INFO L567 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2019-11-15 21:12:43,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:29 [2019-11-15 21:12:43,305 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 27 treesize of output 22 [2019-11-15 21:12:43,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-11-15 21:12:43,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,353 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-11-15 21:12:43,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:43,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:52 [2019-11-15 21:12:43,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:12:43,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,425 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 16 treesize of output 44 [2019-11-15 21:12:43,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,451 INFO L567 ElimStorePlain]: treesize reduction 26, result has 68.3 percent of original size [2019-11-15 21:12:43,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:43,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:56 [2019-11-15 21:12:43,511 INFO L341 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2019-11-15 21:12:43,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2019-11-15 21:12:43,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,562 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 21:12:43,562 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 69 [2019-11-15 21:12:43,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,602 INFO L567 ElimStorePlain]: treesize reduction 20, result has 80.8 percent of original size [2019-11-15 21:12:43,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:43,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:84 [2019-11-15 21:12:43,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:43,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 116 [2019-11-15 21:12:43,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,685 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 63 treesize of output 62 [2019-11-15 21:12:43,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,761 INFO L567 ElimStorePlain]: treesize reduction 49, result has 71.2 percent of original size [2019-11-15 21:12:43,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 65 [2019-11-15 21:12:43,782 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:43,804 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 103 [2019-11-15 21:12:43,805 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:12:43,877 INFO L567 ElimStorePlain]: treesize reduction 80, result has 57.7 percent of original size [2019-11-15 21:12:43,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 21:12:43,878 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:149 [2019-11-15 21:12:44,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:44,221 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 134 treesize of output 104 [2019-11-15 21:12:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,226 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:44,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:12:44,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 57 [2019-11-15 21:12:44,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:12:44,247 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:12:44,350 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-15 21:12:44,350 INFO L567 ElimStorePlain]: treesize reduction 48, result has 66.7 percent of original size [2019-11-15 21:12:44,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:12:44,552 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 21:12:44,555 INFO L168 Benchmark]: Toolchain (without parser) took 50267.27 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 613.9 MB). Free memory was 944.7 MB in the beginning and 927.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 631.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:44,555 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:12:44,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:44,556 INFO L168 Benchmark]: Boogie Preprocessor took 63.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:12:44,556 INFO L168 Benchmark]: RCFGBuilder took 837.56 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: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:44,556 INFO L168 Benchmark]: TraceAbstraction took 48838.10 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 469.8 MB). Free memory was 1.1 GB in the beginning and 927.1 MB in the end (delta: 131.9 MB). Peak memory consumption was 601.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:44,557 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 524.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 837.56 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: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48838.10 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 469.8 MB). Free memory was 1.1 GB in the beginning and 927.1 MB in the end (delta: 131.9 MB). Peak memory consumption was 601.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:12:46,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:12:46,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:12:46,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:12:46,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:12:46,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:12:46,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:12:46,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:12:46,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:12:46,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:12:46,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:12:46,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:12:46,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:12:46,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:12:46,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:12:46,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:12:46,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:12:46,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:12:46,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:12:46,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:12:46,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:12:46,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:12:46,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:12:46,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:12:46,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:12:46,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:12:46,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:12:46,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:12:46,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:12:46,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:12:46,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:12:46,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:12:46,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:12:46,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:12:46,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:12:46,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:12:46,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:12:46,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:12:46,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:12:46,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:12:46,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:12:46,755 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:12:46,769 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:12:46,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:12:46,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:12:46,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:12:46,771 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:12:46,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:12:46,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:12:46,771 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:12:46,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:12:46,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:12:46,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:12:46,772 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:12:46,773 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:12:46,773 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:12:46,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:12:46,773 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:12:46,773 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:12:46,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:12:46,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:12:46,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:12:46,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:12:46,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:12:46,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:12:46,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:12:46,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:12:46,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:12:46,776 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:12:46,776 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:12:46,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:12:46,776 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_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/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 -> 5a3a274b64e7ba6d81948d0b8c45cbd715251888 [2019-11-15 21:12:46,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:12:46,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:12:46,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:12:46,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:12:46,846 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:12:46,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2019-11-15 21:12:46,911 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/f79c6f788/bb2ca7d160f744d68b24bccd8d36d33b/FLAG98f6fce9a [2019-11-15 21:12:47,446 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:12:47,447 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2019-11-15 21:12:47,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/f79c6f788/bb2ca7d160f744d68b24bccd8d36d33b/FLAG98f6fce9a [2019-11-15 21:12:47,729 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/data/f79c6f788/bb2ca7d160f744d68b24bccd8d36d33b [2019-11-15 21:12:47,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:12:47,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:12:47,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:12:47,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:12:47,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:12:47,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:12:47" (1/1) ... [2019-11-15 21:12:47,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b82f1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:47, skipping insertion in model container [2019-11-15 21:12:47,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:12:47" (1/1) ... [2019-11-15 21:12:47,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:12:47,793 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:12:48,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:12:48,202 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:12:48,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:12:48,312 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:12:48,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48 WrapperNode [2019-11-15 21:12:48,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:12:48,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:12:48,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:12:48,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:12:48,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... [2019-11-15 21:12:48,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:12:48,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:12:48,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:12:48,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:12:48,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:12:48,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:12:48,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:12:48,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:12:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:12:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:12:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:12:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:12:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:12:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:12:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:12:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:12:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:12:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:12:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:12:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:12:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:12:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:12:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:12:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:12:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:12:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:12:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:12:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:12:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:12:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:12:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:12:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:12:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:12:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:12:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:12:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:12:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:12:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:12:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:12:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:12:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:12:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:12:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:12:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:12:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:12:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:12:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:12:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:12:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:12:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:12:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:12:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:12:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:12:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:12:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:12:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:12:48,439 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:12:48,439 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:12:48,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:12:48,439 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:12:48,439 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:12:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:12:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:12:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:12:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:12:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:12:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:12:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:12:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:12:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:12:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:12:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:12:48,441 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:12:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:12:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:12:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:12:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:12:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:12:48,442 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:12:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:12:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:12:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:12:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:12:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:12:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:12:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:12:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:12:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:12:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:12:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:12:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:12:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:12:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:12:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:12:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:12:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:12:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:12:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:12:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:12:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:12:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:12:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:12:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:12:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:12:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:12:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:12:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:12:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:12:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:12:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:12:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:12:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:12:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:12:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:12:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:12:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:12:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:12:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:12:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:12:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:12:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:12:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:12:49,277 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:12:49,278 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:12:49,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:49 BoogieIcfgContainer [2019-11-15 21:12:49,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:12:49,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:12:49,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:12:49,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:12:49,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:12:47" (1/3) ... [2019-11-15 21:12:49,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327d1d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:12:49, skipping insertion in model container [2019-11-15 21:12:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:48" (2/3) ... [2019-11-15 21:12:49,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327d1d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:12:49, skipping insertion in model container [2019-11-15 21:12:49,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:49" (3/3) ... [2019-11-15 21:12:49,291 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2019-11-15 21:12:49,301 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:12:49,319 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-11-15 21:12:49,330 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-11-15 21:12:49,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:12:49,352 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:12:49,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:12:49,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:12:49,353 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:12:49,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:12:49,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:12:49,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:12:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-11-15 21:12:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:12:49,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:49,387 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:49,389 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 21:12:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1698639190, now seen corresponding path program 1 times [2019-11-15 21:12:49,401 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:12:49,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1264453269] [2019-11-15 21:12:49,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0f5ed3b3-dff9-4b58-a6c7-3479d39a4742/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:12:49,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:12:49,621 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:12:49,626 INFO L168 Benchmark]: Toolchain (without parser) took 1893.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.0 MB in the beginning and 1.0 GB in the end (delta: -99.9 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:49,627 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:12:49,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:49,629 INFO L168 Benchmark]: Boogie Preprocessor took 65.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:49,631 INFO L168 Benchmark]: RCFGBuilder took 900.13 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.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:49,632 INFO L168 Benchmark]: TraceAbstraction took 343.71 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:49,634 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.80 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 900.13 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.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 343.71 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: 13.2 MB). Peak memory consumption was 13.2 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...