./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa 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_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/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 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no XNF --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:54:11,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:54:11,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:54:11,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:54:11,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:54:11,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:54:11,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:54:11,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:54:11,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:54:11,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:54:11,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:54:11,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:54:11,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:54:11,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:54:11,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:54:11,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:54:11,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:54:11,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:54:11,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:54:11,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:54:11,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:54:11,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:54:11,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:54:11,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:54:11,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:54:11,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:54:11,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:54:11,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:54:11,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:54:11,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:54:11,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:54:11,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:54:11,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:54:11,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:54:11,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:54:11,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:54:11,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:54:11,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:54:11,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:54:11,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:54:11,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:54:11,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 08:54:11,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:54:11,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:54:11,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:54:11,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:54:11,738 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:54:11,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:54:11,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:54:11,739 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:54:11,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:54:11,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:54:11,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:54:11,740 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 08:54:11,740 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 08:54:11,740 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 08:54:11,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:54:11,740 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:54:11,740 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:54:11,741 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:54:11,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:54:11,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:54:11,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:54:11,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:54:11,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:54:11,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:54:11,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:54:11,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:54:11,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:54:11,742 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:54:11,743 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:54:11,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:54:11,743 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_01c289f6-9dcc-445b-811c-9beeb081d09e/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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-11-25 08:54:11,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:54:11,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:54:11,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:54:11,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:54:11,897 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:54:11,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-25 08:54:11,954 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/data/176c21963/502ed28ae40d42aca5d7999f9cb11239/FLAG09cb2ce85 [2019-11-25 08:54:12,461 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:54:12,462 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-25 08:54:12,474 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/data/176c21963/502ed28ae40d42aca5d7999f9cb11239/FLAG09cb2ce85 [2019-11-25 08:54:12,965 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/data/176c21963/502ed28ae40d42aca5d7999f9cb11239 [2019-11-25 08:54:12,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:54:12,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 08:54:12,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:12,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:54:12,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:54:12,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:12" (1/1) ... [2019-11-25 08:54:12,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7744e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:12, skipping insertion in model container [2019-11-25 08:54:12,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:12" (1/1) ... [2019-11-25 08:54:12,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:54:13,026 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:54:13,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:13,360 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:54:13,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:13,449 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:54:13,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13 WrapperNode [2019-11-25 08:54:13,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:13,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:54:13,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:54:13,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:54:13,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... [2019-11-25 08:54:13,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:54:13,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:54:13,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:54:13,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:54:13,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/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-25 08:54:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 08:54:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:54:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 08:54:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 08:54:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 08:54:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-25 08:54:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2019-11-25 08:54:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 08:54:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 08:54:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 08:54:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 08:54:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 08:54:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 08:54:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 08:54:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 08:54:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 08:54:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 08:54:13,607 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 08:54:13,608 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 08:54:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 08:54:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 08:54:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 08:54:13,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 08:54:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:54:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:54:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:54:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 08:54:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:54:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 08:54:14,003 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-25 08:54:14,313 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:54:14,313 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-25 08:54:14,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:14 BoogieIcfgContainer [2019-11-25 08:54:14,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:54:14,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:54:14,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:54:14,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:54:14,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:54:12" (1/3) ... [2019-11-25 08:54:14,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5097d16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:14, skipping insertion in model container [2019-11-25 08:54:14,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:13" (2/3) ... [2019-11-25 08:54:14,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5097d16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:14, skipping insertion in model container [2019-11-25 08:54:14,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:14" (3/3) ... [2019-11-25 08:54:14,321 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-11-25 08:54:14,333 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:54:14,342 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2019-11-25 08:54:14,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2019-11-25 08:54:14,379 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:54:14,379 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 08:54:14,379 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:54:14,379 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:54:14,380 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:54:14,380 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:54:14,380 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:54:14,380 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:54:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-25 08:54:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:54:14,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:14,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:14,414 INFO L410 AbstractCegarLoop]: === Iteration 1 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1776621815, now seen corresponding path program 1 times [2019-11-25 08:54:14,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:14,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [998522447] [2019-11-25 08:54:14,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/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-25 08:54:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:14,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:14,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:14,718 INFO L377 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-25 08:54:14,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:14,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:14,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:14,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:54:14,731 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-25 08:54:14,731 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:14,747 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-25 08:54:14,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [998522447] [2019-11-25 08:54:14,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:14,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:54:14,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901769413] [2019-11-25 08:54:14,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:14,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:14,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:14,769 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-25 08:54:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:14,927 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-11-25 08:54:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:14,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:54:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:14,936 INFO L225 Difference]: With dead ends: 68 [2019-11-25 08:54:14,936 INFO L226 Difference]: Without dead ends: 60 [2019-11-25 08:54:14,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-25 08:54:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-25 08:54:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 08:54:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-25 08:54:14,973 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 10 [2019-11-25 08:54:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:14,973 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-25 08:54:14,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-25 08:54:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:54:14,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:14,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:15,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:15,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1776621816, now seen corresponding path program 1 times [2019-11-25 08:54:15,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:15,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1210300386] [2019-11-25 08:54:15,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:15,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:54:15,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:15,363 INFO L377 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-25 08:54:15,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:15,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:15,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:15,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:54:15,390 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-25 08:54:15,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:15,443 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-25 08:54:15,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1210300386] [2019-11-25 08:54:15,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:15,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 08:54:15,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647910621] [2019-11-25 08:54:15,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:15,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:15,445 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 4 states. [2019-11-25 08:54:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:15,629 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-25 08:54:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:15,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 08:54:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:15,632 INFO L225 Difference]: With dead ends: 57 [2019-11-25 08:54:15,632 INFO L226 Difference]: Without dead ends: 57 [2019-11-25 08:54:15,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-25 08:54:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-25 08:54:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-25 08:54:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-25 08:54:15,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 10 [2019-11-25 08:54:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:15,640 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-25 08:54:15,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-25 08:54:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:54:15,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:15,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:15,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:15,844 INFO L410 AbstractCegarLoop]: === Iteration 3 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1685663133, now seen corresponding path program 1 times [2019-11-25 08:54:15,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:15,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [885406318] [2019-11-25 08:54:15,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:16,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:16,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:16,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:16,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-25 08:54:16,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:16,156 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-25 08:54:16,157 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-25 08:54:16,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-25 08:54:16,172 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-25 08:54:16,172 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:16,184 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-25 08:54:16,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [885406318] [2019-11-25 08:54:16,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:16,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-25 08:54:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810595062] [2019-11-25 08:54:16,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:16,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:16,186 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 4 states. [2019-11-25 08:54:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:16,386 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-25 08:54:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:16,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 08:54:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:16,389 INFO L225 Difference]: With dead ends: 63 [2019-11-25 08:54:16,390 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:54:16,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:54:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2019-11-25 08:54:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 08:54:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-25 08:54:16,397 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 15 [2019-11-25 08:54:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:16,398 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-25 08:54:16,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-25 08:54:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:54:16,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:16,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:16,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:16,610 INFO L410 AbstractCegarLoop]: === Iteration 4 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1685663132, now seen corresponding path program 1 times [2019-11-25 08:54:16,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:16,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [206513432] [2019-11-25 08:54:16,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:16,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:54:16,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:16,829 INFO L377 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-25 08:54:16,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:16,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:16,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:16,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:54:16,869 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-25 08:54:16,869 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:16,908 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-25 08:54:16,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206513432] [2019-11-25 08:54:16,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:16,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 08:54:16,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529818076] [2019-11-25 08:54:16,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:16,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:16,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:16,910 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2019-11-25 08:54:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:17,080 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-25 08:54:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:17,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-25 08:54:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:17,083 INFO L225 Difference]: With dead ends: 58 [2019-11-25 08:54:17,083 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:54:17,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:54:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2019-11-25 08:54:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:54:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-25 08:54:17,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 15 [2019-11-25 08:54:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:17,089 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-25 08:54:17,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-25 08:54:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:54:17,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:17,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:17,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:17,291 INFO L410 AbstractCegarLoop]: === Iteration 5 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1462049621, now seen corresponding path program 1 times [2019-11-25 08:54:17,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:17,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [108546012] [2019-11-25 08:54:17,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:17,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:17,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:17,510 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-25 08:54:17,510 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:17,570 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-25 08:54:17,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [108546012] [2019-11-25 08:54:17,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:17,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-25 08:54:17,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541657618] [2019-11-25 08:54:17,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:17,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:17,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:17,572 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 7 states. [2019-11-25 08:54:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:17,618 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-25 08:54:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:54:17,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-25 08:54:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:17,620 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:54:17,620 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:54:17,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:54:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-11-25 08:54:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 08:54:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-25 08:54:17,626 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 19 [2019-11-25 08:54:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:17,626 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-25 08:54:17,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-25 08:54:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:54:17,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:17,627 INFO L410 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] [2019-11-25 08:54:17,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:17,837 INFO L410 AbstractCegarLoop]: === Iteration 6 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:17,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2055862817, now seen corresponding path program 1 times [2019-11-25 08:54:17,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:17,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1071199327] [2019-11-25 08:54:17,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:18,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:54:18,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:18,088 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-25 08:54:18,088 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:18,250 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-25 08:54:18,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1071199327] [2019-11-25 08:54:18,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:18,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-25 08:54:18,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335325815] [2019-11-25 08:54:18,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:54:18,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:54:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:54:18,252 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 9 states. [2019-11-25 08:54:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:18,405 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-11-25 08:54:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:18,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-25 08:54:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:18,410 INFO L225 Difference]: With dead ends: 67 [2019-11-25 08:54:18,410 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:54:18,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:54:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:54:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-25 08:54:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 08:54:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-11-25 08:54:18,415 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 24 [2019-11-25 08:54:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:18,415 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-11-25 08:54:18,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:54:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-11-25 08:54:18,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:18,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:18,416 INFO L410 BasicCegarLoop]: trace histogram [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-25 08:54:18,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:18,617 INFO L410 AbstractCegarLoop]: === Iteration 7 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:18,618 INFO L82 PathProgramCache]: Analyzing trace with hash -94141141, now seen corresponding path program 2 times [2019-11-25 08:54:18,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:18,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [962325775] [2019-11-25 08:54:18,618 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:18,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:18,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:18,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:18,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:18,957 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:19,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [962325775] [2019-11-25 08:54:19,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:19,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-25 08:54:19,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904452875] [2019-11-25 08:54:19,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 08:54:19,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:19,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:54:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:54:19,148 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 11 states. [2019-11-25 08:54:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:19,387 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-11-25 08:54:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:54:19,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-11-25 08:54:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:19,395 INFO L225 Difference]: With dead ends: 72 [2019-11-25 08:54:19,395 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 08:54:19,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 08:54:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-25 08:54:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 08:54:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-25 08:54:19,401 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 29 [2019-11-25 08:54:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:19,402 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-25 08:54:19,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 08:54:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-25 08:54:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:54:19,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:19,403 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:19,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:19,606 INFO L410 AbstractCegarLoop]: === Iteration 8 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:19,606 INFO L82 PathProgramCache]: Analyzing trace with hash -893536929, now seen corresponding path program 3 times [2019-11-25 08:54:19,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:19,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1436028384] [2019-11-25 08:54:19,607 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:19,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-25 08:54:19,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:19,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:54:19,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:54:19,888 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:54:19,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1436028384] [2019-11-25 08:54:19,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:19,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-25 08:54:19,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8804146] [2019-11-25 08:54:19,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:19,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:19,962 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 7 states. [2019-11-25 08:54:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:20,415 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-25 08:54:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:20,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-25 08:54:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:20,416 INFO L225 Difference]: With dead ends: 62 [2019-11-25 08:54:20,416 INFO L226 Difference]: Without dead ends: 62 [2019-11-25 08:54:20,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:54:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-25 08:54:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-25 08:54:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:54:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-25 08:54:20,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2019-11-25 08:54:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:20,421 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-25 08:54:20,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-25 08:54:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:54:20,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:20,421 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:20,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:20,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash -893536928, now seen corresponding path program 1 times [2019-11-25 08:54:20,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:20,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [177137844] [2019-11-25 08:54:20,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:20,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:54:20,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:20,948 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:21,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177137844] [2019-11-25 08:54:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:21,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-25 08:54:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670016218] [2019-11-25 08:54:21,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:54:21,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:54:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:54:21,203 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 13 states. [2019-11-25 08:54:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:21,484 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-11-25 08:54:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:54:21,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-25 08:54:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:21,485 INFO L225 Difference]: With dead ends: 74 [2019-11-25 08:54:21,485 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 08:54:21,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:54:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 08:54:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-25 08:54:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:54:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-25 08:54:21,492 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 34 [2019-11-25 08:54:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:21,492 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-25 08:54:21,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:54:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-25 08:54:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:54:21,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:21,494 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:21,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:21,698 INFO L410 AbstractCegarLoop]: === Iteration 10 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:21,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1677559212, now seen corresponding path program 2 times [2019-11-25 08:54:21,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:21,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1556378887] [2019-11-25 08:54:21,699 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:21,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:21,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:21,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 08:54:21,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:21,974 INFO L377 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-25 08:54:21,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:21,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:21,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:21,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:54:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:54:22,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:54:22,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1556378887] [2019-11-25 08:54:22,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:22,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-25 08:54:22,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861183157] [2019-11-25 08:54:22,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:54:22,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:54:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:54:22,497 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 12 states. [2019-11-25 08:54:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:23,237 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-11-25 08:54:23,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:54:23,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-25 08:54:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:23,239 INFO L225 Difference]: With dead ends: 69 [2019-11-25 08:54:23,239 INFO L226 Difference]: Without dead ends: 69 [2019-11-25 08:54:23,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-25 08:54:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-25 08:54:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:54:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-25 08:54:23,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 39 [2019-11-25 08:54:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:23,243 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-25 08:54:23,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:54:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-25 08:54:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:54:23,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:23,245 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 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-25 08:54:23,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:23,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1114696837, now seen corresponding path program 1 times [2019-11-25 08:54:23,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:23,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [787312482] [2019-11-25 08:54:23,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:23,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-25 08:54:23,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:23,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-25 08:54:23,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:23,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-25 08:54:23,836 INFO L377 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-25 08:54:23,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:23,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:54:23,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:23,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-25 08:54:23,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,916 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-25 08:54:23,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:17 [2019-11-25 08:54:23,944 INFO L377 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-25 08:54:23,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:23,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:23,959 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-25 08:54:23,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-11-25 08:54:23,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:23,989 INFO L377 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 29 treesize of output 13 [2019-11-25 08:54:23,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:24,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:24,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:24,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-25 08:54:24,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:24,041 INFO L377 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 23 treesize of output 38 [2019-11-25 08:54:24,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,046 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-25 08:54:24,078 INFO L567 ElimStorePlain]: treesize reduction 12, result has 75.0 percent of original size [2019-11-25 08:54:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:24,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:36 [2019-11-25 08:54:24,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:24,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:24,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-25 08:54:24,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:24,311 INFO L567 ElimStorePlain]: treesize reduction 12, result has 69.2 percent of original size [2019-11-25 08:54:24,311 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-25 08:54:24,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:27 [2019-11-25 08:54:24,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:24,334 INFO L377 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 34 treesize of output 25 [2019-11-25 08:54:24,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,337 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-25 08:54:24,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:24,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:24,357 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-25 08:54:24,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-25 08:54:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:54:24,432 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:24,485 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-25 08:54:24,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:24,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:24,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-11-25 08:54:24,720 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-25 08:54:24,923 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-25 08:54:25,156 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-25 08:54:25,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:25,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:25,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2019-11-25 08:54:25,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:25,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:25,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:25,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:28 [2019-11-25 08:54:25,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:25,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:25,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:25,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:25,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-11-25 08:54:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:54:25,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [787312482] [2019-11-25 08:54:25,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:25,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-25 08:54:25,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247897994] [2019-11-25 08:54:25,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 08:54:25,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:54:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 08:54:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-25 08:54:25,553 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 23 states. [2019-11-25 08:54:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:27,296 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-25 08:54:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:54:27,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-25 08:54:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:27,298 INFO L225 Difference]: With dead ends: 75 [2019-11-25 08:54:27,298 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 08:54:27,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-11-25 08:54:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 08:54:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-25 08:54:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-25 08:54:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-25 08:54:27,304 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 45 [2019-11-25 08:54:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:27,304 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-25 08:54:27,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 08:54:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-25 08:54:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:54:27,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:27,306 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 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-25 08:54:27,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:27,510 INFO L410 AbstractCegarLoop]: === Iteration 12 === [sll_circular_createErr5REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr6REQUIRES_VIOLATION, sll_circular_createErr7REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr8REQUIRES_VIOLATION, sll_circular_createErr9REQUIRES_VIOLATION, sll_circular_createErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-25 08:54:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:27,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1114696836, now seen corresponding path program 1 times [2019-11-25 08:54:27,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:54:27,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [309439046] [2019-11-25 08:54:27,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_01c289f6-9dcc-445b-811c-9beeb081d09e/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:27,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-25 08:54:27,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:27,901 INFO L377 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-25 08:54:27,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:27,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:27,913 INFO L377 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-25 08:54:27,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:27,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:27,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:27,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-25 08:54:27,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:27,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-25 08:54:27,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:27,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:27,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:27,982 INFO L377 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 13 treesize of output 17 [2019-11-25 08:54:27,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:27,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:27,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:27,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:26 [2019-11-25 08:54:28,037 INFO L377 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-25 08:54:28,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,077 INFO L377 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-25 08:54:28,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,092 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-25 08:54:28,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:36 [2019-11-25 08:54:28,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:28,124 INFO L377 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 37 treesize of output 17 [2019-11-25 08:54:28,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:28,150 INFO L377 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-25 08:54:28,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:38 [2019-11-25 08:54:28,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 42 [2019-11-25 08:54:28,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:28,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:28,237 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-25 08:54:28,288 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.9 percent of original size [2019-11-25 08:54:28,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-25 08:54:28,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,355 INFO L567 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-11-25 08:54:28,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:28,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:28,357 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-25 08:54:28,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:28,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:28,536 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-11-25 08:54:28,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:28,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:28,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:28,794 INFO L377 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 93 treesize of output 80 [2019-11-25 08:54:28,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:28,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:28,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 88 [2019-11-25 08:54:28,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,059 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-25 08:54:29,059 INFO L567 ElimStorePlain]: treesize reduction 26, result has 83.8 percent of original size [2019-11-25 08:54:29,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:29,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-25 08:54:29,083 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:54:29,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:29,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 65 [2019-11-25 08:54:29,105 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,216 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-25 08:54:29,216 INFO L567 ElimStorePlain]: treesize reduction 16, result has 85.7 percent of original size [2019-11-25 08:54:29,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-25 08:54:29,217 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:176, output treesize:96 [2019-11-25 08:54:29,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:29,278 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 5=[v_prenex_1, v_prenex_2]} [2019-11-25 08:54:29,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 08:54:29,286 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-25 08:54:29,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:29,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:29,349 INFO L377 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 1 case distinctions, treesize of input 41 treesize of output 37 [2019-11-25 08:54:29,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,446 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.7 percent of original size [2019-11-25 08:54:29,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:29,456 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 55 [2019-11-25 08:54:29,457 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,532 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2019-11-25 08:54:29,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-11-25 08:54:29,537 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:29,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:29,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-25 08:54:29,571 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:116, output treesize:48 [2019-11-25 08:54:29,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:29,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:29,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:54:29,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:54:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:30,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:30,217 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-25 08:54:30,229 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,239 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:30,245 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,249 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-25 08:54:30,351 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-25 08:54:30,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:30,357 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,368 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,374 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,382 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,389 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,395 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:30,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:30,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-25 08:54:30,493 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:367, output treesize:207 [2019-11-25 08:54:31,344 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-25 08:54:31,579 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-25 08:54:31,795 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-25 08:54:32,028 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-25 08:54:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:32,877 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:32,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:32,894 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:32,913 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:32,927 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:32,940 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-25 08:54:33,556 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-25 08:54:33,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:33,570 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:33,583 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:33,600 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:33,613 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:33,638 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:33,658 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:54:34,453 WARN L192 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-25 08:54:34,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:54:34,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2019-11-25 08:54:34,454 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:495, output treesize:575 [2019-11-25 08:54:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:54:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:35,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:54:35,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:35,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:35,390 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:35,399 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:35,739 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-25 08:54:35,739 INFO L567 ElimStorePlain]: treesize reduction 84, result has 84.0 percent of original size [2019-11-25 08:54:35,748 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:35,757 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:54:35,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:54:35,958 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-25 08:54:35,961 INFO L168 Benchmark]: Toolchain (without parser) took 22993.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 944.7 MB in the beginning and 899.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,962 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-25 08:54:35,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,962 INFO L168 Benchmark]: Boogie Preprocessor took 93.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,962 INFO L168 Benchmark]: RCFGBuilder took 770.60 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,963 INFO L168 Benchmark]: TraceAbstraction took 21645.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 899.6 MB in the end (delta: 157.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,964 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 480.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 770.60 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21645.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 899.6 MB in the end (delta: 157.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...