./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 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_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 07:36:13,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:36:13,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:36:13,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:36:13,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:36:13,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:36:13,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:36:13,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:36:13,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:36:13,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:36:13,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:36:13,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:36:13,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:36:13,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:36:13,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:36:13,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:36:13,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:36:13,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:36:13,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:36:13,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:36:13,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:36:13,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:36:13,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:36:13,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:36:13,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:36:13,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:36:13,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:36:13,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:36:13,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:36:13,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:36:13,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:36:13,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:36:13,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:36:13,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:36:13,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:36:13,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:36:13,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:36:13,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:36:13,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:36:13,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:36:13,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:36:13,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 07:36:13,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:36:13,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:36:13,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:36:13,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:36:13,630 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:36:13,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:36:13,630 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:36:13,630 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 07:36:13,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 07:36:13,631 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 07:36:13,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:36:13,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:36:13,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:36:13,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:36:13,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:36:13,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:36:13,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:36:13,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:36:13,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:36:13,633 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 07:36:13,633 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 07:36:13,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 07:36:13,633 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_af2c885d-3c8b-47ca-8b80-45dd4da77104/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-11-20 07:36:13,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:36:13,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:36:13,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:36:13,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:36:13,818 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:36:13,819 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-20 07:36:13,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/data/0263d638f/0e2ee81c760f4742ad3481facc71d16d/FLAG7261e30ad [2019-11-20 07:36:14,341 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:36:14,341 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-20 07:36:14,356 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/data/0263d638f/0e2ee81c760f4742ad3481facc71d16d/FLAG7261e30ad [2019-11-20 07:36:14,837 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/data/0263d638f/0e2ee81c760f4742ad3481facc71d16d [2019-11-20 07:36:14,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:36:14,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 07:36:14,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:36:14,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:36:14,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:36:14,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:36:14" (1/1) ... [2019-11-20 07:36:14,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f20ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:14, skipping insertion in model container [2019-11-20 07:36:14,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:36:14" (1/1) ... [2019-11-20 07:36:14,855 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:36:14,896 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:36:15,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:36:15,306 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:36:15,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:36:15,414 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:36:15,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15 WrapperNode [2019-11-20 07:36:15,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:36:15,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:36:15,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:36:15,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:36:15,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... [2019-11-20 07:36:15,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:36:15,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:36:15,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:36:15,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:36:15,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 07:36:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:36:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 07:36:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 07:36:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 07:36:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 07:36:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 07:36:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 07:36:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 07:36:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 07:36:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 07:36:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 07:36:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 07:36:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 07:36:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 07:36:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 07:36:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 07:36:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 07:36:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 07:36:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 07:36:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 07:36:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 07:36:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 07:36:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 07:36:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 07:36:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 07:36:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 07:36:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 07:36:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 07:36:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 07:36:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 07:36:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 07:36:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 07:36:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 07:36:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 07:36:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 07:36:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 07:36:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 07:36:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 07:36:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 07:36:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 07:36:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 07:36:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 07:36:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 07:36:15,547 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 07:36:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 07:36:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 07:36:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 07:36:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 07:36:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 07:36:15,548 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 07:36:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 07:36:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 07:36:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 07:36:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 07:36:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 07:36:15,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 07:36:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 07:36:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 07:36:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 07:36:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 07:36:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 07:36:15,550 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 07:36:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 07:36:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 07:36:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 07:36:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 07:36:15,551 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 07:36:15,552 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 07:36:15,552 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 07:36:15,552 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 07:36:15,552 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 07:36:15,552 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 07:36:15,552 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 07:36:15,553 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 07:36:15,553 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 07:36:15,553 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 07:36:15,553 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 07:36:15,553 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 07:36:15,553 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 07:36:15,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 07:36:15,554 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 07:36:15,554 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 07:36:15,554 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 07:36:15,554 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 07:36:15,554 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 07:36:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 07:36:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 07:36:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 07:36:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 07:36:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 07:36:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 07:36:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 07:36:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 07:36:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 07:36:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 07:36:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 07:36:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 07:36:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 07:36:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 07:36:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 07:36:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 07:36:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 07:36:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 07:36:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 07:36:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 07:36:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 07:36:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 07:36:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:36:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 07:36:15,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:36:16,508 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:36:16,509 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 07:36:16,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:36:16 BoogieIcfgContainer [2019-11-20 07:36:16,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:36:16,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:36:16,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:36:16,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:36:16,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:36:14" (1/3) ... [2019-11-20 07:36:16,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e32480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:36:16, skipping insertion in model container [2019-11-20 07:36:16,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:36:15" (2/3) ... [2019-11-20 07:36:16,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e32480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:36:16, skipping insertion in model container [2019-11-20 07:36:16,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:36:16" (3/3) ... [2019-11-20 07:36:16,523 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-11-20 07:36:16,533 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:36:16,544 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 70 error locations. [2019-11-20 07:36:16,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2019-11-20 07:36:16,572 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:36:16,572 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 07:36:16,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:36:16,573 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:36:16,573 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:36:16,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:36:16,574 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:36:16,574 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:36:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-20 07:36:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 07:36:16,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:16,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:16,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 543179012, now seen corresponding path program 1 times [2019-11-20 07:36:16,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:16,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [201170112] [2019-11-20 07:36:16,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:16,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:36:16,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:16,941 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-20 07:36:16,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:16,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:16,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:16,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 07:36:16,963 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-20 07:36:16,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:16,975 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-20 07:36:16,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [201170112] [2019-11-20 07:36:16,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:16,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 07:36:16,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331261466] [2019-11-20 07:36:16,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:36:16,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:36:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:36:16,997 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 3 states. [2019-11-20 07:36:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:17,452 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2019-11-20 07:36:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:36:17,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-20 07:36:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:17,468 INFO L225 Difference]: With dead ends: 179 [2019-11-20 07:36:17,468 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 07:36:17,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-20 07:36:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 07:36:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 147. [2019-11-20 07:36:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-20 07:36:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2019-11-20 07:36:17,543 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 7 [2019-11-20 07:36:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:17,543 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2019-11-20 07:36:17,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:36:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2019-11-20 07:36:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 07:36:17,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:17,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:17,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:17,752 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:17,752 INFO L82 PathProgramCache]: Analyzing trace with hash 543179013, now seen corresponding path program 1 times [2019-11-20 07:36:17,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:17,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1827653475] [2019-11-20 07:36:17,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:17,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:36:17,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:17,940 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-20 07:36:17,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:17,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:17,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:17,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 07:36:17,956 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-20 07:36:17,957 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:17,990 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-20 07:36:17,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1827653475] [2019-11-20 07:36:17,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:17,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 07:36:17,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082865607] [2019-11-20 07:36:17,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:36:17,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:36:17,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:36:17,993 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand 4 states. [2019-11-20 07:36:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:18,391 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-11-20 07:36:18,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:36:18,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 07:36:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:18,394 INFO L225 Difference]: With dead ends: 144 [2019-11-20 07:36:18,394 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 07:36:18,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-20 07:36:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 07:36:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-20 07:36:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-20 07:36:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2019-11-20 07:36:18,405 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 7 [2019-11-20 07:36:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:18,406 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2019-11-20 07:36:18,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:36:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2019-11-20 07:36:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 07:36:18,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:18,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:18,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:18,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2071665400, now seen corresponding path program 1 times [2019-11-20 07:36:18,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:18,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1844790003] [2019-11-20 07:36:18,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:18,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:36:18,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:18,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:18,881 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-20 07:36:18,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:18,911 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 07:36:18,912 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-20 07:36:18,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 07:36:18,926 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-20 07:36:18,927 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:18,937 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-20 07:36:18,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1844790003] [2019-11-20 07:36:18,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:18,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 3 [2019-11-20 07:36:18,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670430025] [2019-11-20 07:36:18,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:36:18,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:36:18,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:36:18,939 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 4 states. [2019-11-20 07:36:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:19,307 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2019-11-20 07:36:19,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:36:19,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 07:36:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:19,309 INFO L225 Difference]: With dead ends: 143 [2019-11-20 07:36:19,309 INFO L226 Difference]: Without dead ends: 143 [2019-11-20 07:36:19,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-20 07:36:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-20 07:36:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-11-20 07:36:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-20 07:36:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2019-11-20 07:36:19,320 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2019-11-20 07:36:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:19,320 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2019-11-20 07:36:19,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:36:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2019-11-20 07:36:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 07:36:19,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:19,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:19,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:19,525 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2071665399, now seen corresponding path program 1 times [2019-11-20 07:36:19,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:19,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [166130002] [2019-11-20 07:36:19,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:19,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:36:19,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:19,744 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-20 07:36:19,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:19,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:19,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:19,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 07:36:19,761 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-20 07:36:19,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:19,792 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-20 07:36:19,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [166130002] [2019-11-20 07:36:19,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:19,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 07:36:19,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084019349] [2019-11-20 07:36:19,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:36:19,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:19,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:36:19,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:36:19,794 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2019-11-20 07:36:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:20,289 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2019-11-20 07:36:20,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:36:20,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 07:36:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:20,291 INFO L225 Difference]: With dead ends: 156 [2019-11-20 07:36:20,291 INFO L226 Difference]: Without dead ends: 156 [2019-11-20 07:36:20,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-20 07:36:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-20 07:36:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-20 07:36:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 07:36:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2019-11-20 07:36:20,302 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 11 [2019-11-20 07:36:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:20,302 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2019-11-20 07:36:20,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:36:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2019-11-20 07:36:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 07:36:20,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:20,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:20,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:20,506 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2137089810, now seen corresponding path program 1 times [2019-11-20 07:36:20,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:20,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1850519553] [2019-11-20 07:36:20,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:20,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:36:20,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:20,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:20,755 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-20 07:36:20,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:20,777 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 07:36:20,778 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-20 07:36:20,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 07:36:20,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:20,837 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 12 treesize of output 28 [2019-11-20 07:36:20,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:20,856 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 07:36:20,857 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-20 07:36:20,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 07:36:20,866 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-20 07:36:20,866 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:20,902 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-20 07:36:20,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1850519553] [2019-11-20 07:36:20,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:20,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 4 [2019-11-20 07:36:20,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117182312] [2019-11-20 07:36:20,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:36:20,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:20,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:36:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:36:20,904 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 5 states. [2019-11-20 07:36:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:21,472 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-20 07:36:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:36:21,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-20 07:36:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:21,474 INFO L225 Difference]: With dead ends: 144 [2019-11-20 07:36:21,474 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 07:36:21,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:36:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 07:36:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2019-11-20 07:36:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 07:36:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2019-11-20 07:36:21,486 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 16 [2019-11-20 07:36:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:21,486 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2019-11-20 07:36:21,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:36:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2019-11-20 07:36:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 07:36:21,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:21,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:21,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:21,696 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:21,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2137089809, now seen corresponding path program 1 times [2019-11-20 07:36:21,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:21,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [78312786] [2019-11-20 07:36:21,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:21,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 07:36:21,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:21,930 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-20 07:36:21,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:21,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:21,942 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-20 07:36:21,942 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:21,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:21,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:21,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 07:36:21,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:21,998 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-20 07:36:21,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:22,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:22,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:22,041 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 11 treesize of output 15 [2019-11-20 07:36:22,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:22,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:22,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:36:22,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-20 07:36:22,091 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-20 07:36:22,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:22,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:36:22,441 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-20 07:36:22,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [78312786] [2019-11-20 07:36:22,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:22,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 07:36:22,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563114482] [2019-11-20 07:36:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:36:22,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:36:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:36:22,443 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 8 states. [2019-11-20 07:36:23,911 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-20 07:36:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:24,984 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2019-11-20 07:36:24,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 07:36:24,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-20 07:36:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:24,986 INFO L225 Difference]: With dead ends: 174 [2019-11-20 07:36:24,986 INFO L226 Difference]: Without dead ends: 174 [2019-11-20 07:36:24,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-11-20 07:36:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-20 07:36:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 125. [2019-11-20 07:36:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 07:36:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2019-11-20 07:36:24,998 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 16 [2019-11-20 07:36:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:24,998 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2019-11-20 07:36:24,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:36:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2019-11-20 07:36:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:36:24,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:24,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:25,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:25,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -748939759, now seen corresponding path program 1 times [2019-11-20 07:36:25,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:25,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [567372865] [2019-11-20 07:36:25,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:25,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:36:25,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:25,428 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-20 07:36:25,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:25,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:25,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:25,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 07:36:25,443 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-20 07:36:25,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:25,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:25,451 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-20 07:36:25,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-20 07:36:25,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 07:36:25,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:25,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:25,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:25,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-20 07:36:25,488 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-20 07:36:25,488 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:25,502 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-20 07:36:25,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [567372865] [2019-11-20 07:36:25,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:25,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 07:36:25,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164906664] [2019-11-20 07:36:25,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:36:25,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:36:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:36:25,504 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 5 states. [2019-11-20 07:36:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:26,194 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2019-11-20 07:36:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:36:26,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 07:36:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:26,196 INFO L225 Difference]: With dead ends: 172 [2019-11-20 07:36:26,196 INFO L226 Difference]: Without dead ends: 172 [2019-11-20 07:36:26,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:36:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-20 07:36:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2019-11-20 07:36:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-20 07:36:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2019-11-20 07:36:26,201 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 18 [2019-11-20 07:36:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:26,202 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2019-11-20 07:36:26,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:36:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2019-11-20 07:36:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:36:26,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:26,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:26,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:26,406 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash -748939758, now seen corresponding path program 1 times [2019-11-20 07:36:26,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:26,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1533882247] [2019-11-20 07:36:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:26,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 07:36:26,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:26,662 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-20 07:36:26,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:26,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 07:36:26,691 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-20 07:36:26,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:26,713 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-20 07:36:26,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:26,727 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-20 07:36:26,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2019-11-20 07:36:26,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 07:36:26,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:26,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 07:36:26,764 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:26,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:26,770 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2019-11-20 07:36:26,786 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-20 07:36:26,786 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:26,959 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-20 07:36:26,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1533882247] [2019-11-20 07:36:26,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:26,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 07:36:26,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10248959] [2019-11-20 07:36:26,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:36:26,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:36:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:36:26,961 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 8 states. [2019-11-20 07:36:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:28,788 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2019-11-20 07:36:28,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:36:28,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-20 07:36:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:28,790 INFO L225 Difference]: With dead ends: 195 [2019-11-20 07:36:28,790 INFO L226 Difference]: Without dead ends: 195 [2019-11-20 07:36:28,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:36:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-20 07:36:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 123. [2019-11-20 07:36:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-20 07:36:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-11-20 07:36:28,796 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 18 [2019-11-20 07:36:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:28,796 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-11-20 07:36:28,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:36:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-11-20 07:36:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 07:36:28,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:28,798 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] [2019-11-20 07:36:29,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:29,001 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -61483884, now seen corresponding path program 1 times [2019-11-20 07:36:29,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:29,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [966392521] [2019-11-20 07:36:29,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:29,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 07:36:29,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:29,271 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-20 07:36:29,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 07:36:29,289 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_86|], 1=[|v_#valid_128|]} [2019-11-20 07:36:29,293 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-20 07:36:29,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,326 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 11 treesize of output 15 [2019-11-20 07:36:29,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-20 07:36:29,384 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-20 07:36:29,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,420 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-20 07:36:29,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,434 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-20 07:36:29,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:27 [2019-11-20 07:36:29,499 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 24 [2019-11-20 07:36:29,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,593 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 68 [2019-11-20 07:36:29,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:29,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:36:29,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:51 [2019-11-20 07:36:29,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,690 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 51 treesize of output 42 [2019-11-20 07:36:29,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,712 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 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 07:36:29,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:29,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:29,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:11 [2019-11-20 07:36:29,761 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-20 07:36:29,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:32,805 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 07:36:36,060 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 07:36:36,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:36,426 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 07:36:36,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:36,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:36,828 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 07:36:36,828 INFO L567 ElimStorePlain]: treesize reduction 59, result has 68.9 percent of original size [2019-11-20 07:36:36,840 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:36,987 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 07:36:36,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:36,996 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:37,171 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 07:36:37,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:37,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:36:37,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:36:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:36:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2019-11-20 07:36:37,190 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:166, output treesize:75 [2019-11-20 07:36:37,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:36:37,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:37,384 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-20 07:36:37,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [966392521] [2019-11-20 07:36:37,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:37,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-20 07:36:37,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901680530] [2019-11-20 07:36:37,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 07:36:37,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 07:36:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-20 07:36:37,387 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 16 states. [2019-11-20 07:36:40,053 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-11-20 07:36:40,489 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-20 07:36:42,607 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-11-20 07:36:43,971 WARN L191 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-11-20 07:36:47,145 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-11-20 07:36:47,441 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-20 07:36:48,434 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-20 07:36:48,770 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2019-11-20 07:36:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:49,155 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-11-20 07:36:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 07:36:49,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-20 07:36:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:49,158 INFO L225 Difference]: With dead ends: 166 [2019-11-20 07:36:49,158 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 07:36:49,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 07:36:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 07:36:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 121. [2019-11-20 07:36:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-20 07:36:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2019-11-20 07:36:49,165 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 22 [2019-11-20 07:36:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:49,165 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2019-11-20 07:36:49,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 07:36:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2019-11-20 07:36:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 07:36:49,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:49,166 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] [2019-11-20 07:36:49,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:49,370 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash -61483885, now seen corresponding path program 1 times [2019-11-20 07:36:49,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:49,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1396431292] [2019-11-20 07:36:49,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:49,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 07:36:49,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:49,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:49,655 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-20 07:36:49,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:49,674 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 07:36:49,675 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-20 07:36:49,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 07:36:49,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:49,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 07:36:49,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:49,732 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 07:36:49,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:49,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-20 07:36:49,759 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-20 07:36:49,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:49,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:49,778 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-20 07:36:49,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-20 07:36:49,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:49,964 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-11-20 07:36:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:49,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:49,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:49,988 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-20 07:36:49,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-20 07:36:50,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:50,042 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 40 treesize of output 35 [2019-11-20 07:36:50,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:50,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:50,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:36:50,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-11-20 07:36:50,100 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-20 07:36:50,100 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:50,217 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-20 07:36:50,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1396431292] [2019-11-20 07:36:50,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:50,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 14 [2019-11-20 07:36:50,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821236301] [2019-11-20 07:36:50,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 07:36:50,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 07:36:50,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-20 07:36:50,219 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 15 states. [2019-11-20 07:36:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:52,239 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2019-11-20 07:36:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 07:36:52,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 07:36:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:52,241 INFO L225 Difference]: With dead ends: 222 [2019-11-20 07:36:52,241 INFO L226 Difference]: Without dead ends: 222 [2019-11-20 07:36:52,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2019-11-20 07:36:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-20 07:36:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 120. [2019-11-20 07:36:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 07:36:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2019-11-20 07:36:52,246 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2019-11-20 07:36:52,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:52,247 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2019-11-20 07:36:52,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 07:36:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2019-11-20 07:36:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 07:36:52,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:52,248 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, 1] [2019-11-20 07:36:52,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:52,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1034885372, now seen corresponding path program 1 times [2019-11-20 07:36:52,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:52,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [233466507] [2019-11-20 07:36:52,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:52,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:36:52,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:52,608 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-20 07:36:52,608 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:52,613 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-20 07:36:52,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233466507] [2019-11-20 07:36:52,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:52,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 07:36:52,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556814644] [2019-11-20 07:36:52,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 07:36:52,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 07:36:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 07:36:52,615 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 3 states. [2019-11-20 07:36:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:52,865 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2019-11-20 07:36:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:36:52,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 07:36:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:52,867 INFO L225 Difference]: With dead ends: 128 [2019-11-20 07:36:52,867 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 07:36:52,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-20 07:36:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 07:36:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2019-11-20 07:36:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 07:36:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-11-20 07:36:52,872 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 25 [2019-11-20 07:36:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:52,872 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-11-20 07:36:52,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 07:36:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-11-20 07:36:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 07:36:52,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:52,874 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:36:53,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:53,074 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash -964998752, now seen corresponding path program 1 times [2019-11-20 07:36:53,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:53,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [740360598] [2019-11-20 07:36:53,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/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-20 07:36:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:53,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 07:36:53,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:53,376 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-20 07:36:53,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,396 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-20 07:36:53,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-20 07:36:53,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,432 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 21 treesize of output 20 [2019-11-20 07:36:53,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,461 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 21 treesize of output 20 [2019-11-20 07:36:53,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-11-20 07:36:53,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-20 07:36:53,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 07:36:53,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-20 07:36:53,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-11-20 07:36:53,629 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 07:36:53,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,652 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 22 treesize of output 10 [2019-11-20 07:36:53,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,662 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-20 07:36:53,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2019-11-20 07:36:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:36:53,716 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:53,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:36:53,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,829 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-20 07:36:53,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,863 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-20 07:36:53,866 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:53,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:53,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 07:36:53,874 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2019-11-20 07:36:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:36:53,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [740360598] [2019-11-20 07:36:53,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:36:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-20 07:36:53,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583096326] [2019-11-20 07:36:53,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 07:36:53,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 07:36:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:36:53,925 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 13 states. [2019-11-20 07:36:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:55,302 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2019-11-20 07:36:55,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 07:36:55,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-20 07:36:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:55,304 INFO L225 Difference]: With dead ends: 179 [2019-11-20 07:36:55,304 INFO L226 Difference]: Without dead ends: 179 [2019-11-20 07:36:55,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-11-20 07:36:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-20 07:36:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2019-11-20 07:36:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-20 07:36:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2019-11-20 07:36:55,309 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2019-11-20 07:36:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:55,310 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2019-11-20 07:36:55,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 07:36:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2019-11-20 07:36:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 07:36:55,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:55,311 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, 1, 1, 1, 1] [2019-11-20 07:36:55,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:55,515 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -540839720, now seen corresponding path program 1 times [2019-11-20 07:36:55,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:55,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [705850756] [2019-11-20 07:36:55,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:55,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:36:55,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:55,771 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-20 07:36:55,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:55,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:55,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:55,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 07:36:55,786 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-20 07:36:55,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:55,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:55,796 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-20 07:36:55,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-20 07:36:55,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 07:36:55,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:55,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:55,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:55,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-20 07:36:55,828 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-20 07:36:55,828 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:55,835 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-20 07:36:55,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [705850756] [2019-11-20 07:36:55,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:55,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 07:36:55,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514516370] [2019-11-20 07:36:55,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:36:55,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:55,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:36:55,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:36:55,836 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 5 states. [2019-11-20 07:36:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:56,566 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2019-11-20 07:36:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:36:56,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-20 07:36:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:56,569 INFO L225 Difference]: With dead ends: 199 [2019-11-20 07:36:56,569 INFO L226 Difference]: Without dead ends: 199 [2019-11-20 07:36:56,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:36:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-20 07:36:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 132. [2019-11-20 07:36:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 07:36:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2019-11-20 07:36:56,574 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 28 [2019-11-20 07:36:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:56,574 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2019-11-20 07:36:56,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:36:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2019-11-20 07:36:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 07:36:56,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:56,576 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, 1, 1, 1, 1] [2019-11-20 07:36:56,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:56,780 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash -540839719, now seen corresponding path program 1 times [2019-11-20 07:36:56,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:56,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [67995325] [2019-11-20 07:36:56,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:57,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 07:36:57,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:57,042 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-20 07:36:57,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:57,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 07:36:57,063 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-20 07:36:57,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:57,078 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-20 07:36:57,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:57,088 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-20 07:36:57,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2019-11-20 07:36:57,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 07:36:57,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:57,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 07:36:57,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:57,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:57,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-11-20 07:36:57,179 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-20 07:36:57,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:57,341 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-20 07:36:57,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67995325] [2019-11-20 07:36:57,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:57,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-20 07:36:57,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023957511] [2019-11-20 07:36:57,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:36:57,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:36:57,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:36:57,342 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 8 states. [2019-11-20 07:36:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:59,065 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2019-11-20 07:36:59,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:36:59,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-20 07:36:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:59,067 INFO L225 Difference]: With dead ends: 222 [2019-11-20 07:36:59,068 INFO L226 Difference]: Without dead ends: 222 [2019-11-20 07:36:59,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:36:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-20 07:36:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 131. [2019-11-20 07:36:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-20 07:36:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2019-11-20 07:36:59,073 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 28 [2019-11-20 07:36:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:59,073 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2019-11-20 07:36:59,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:36:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2019-11-20 07:36:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 07:36:59,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:59,075 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, 1, 1, 1, 1, 1] [2019-11-20 07:36:59,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:59,279 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:36:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:36:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1034423946, now seen corresponding path program 1 times [2019-11-20 07:36:59,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:36:59,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [764800833] [2019-11-20 07:36:59,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:36:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:36:59,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 07:36:59,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:36:59,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 07:36:59,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:59,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:36:59,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:59,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 07:36:59,474 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-20 07:36:59,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:36:59,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-20 07:36:59,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:36:59,525 INFO L567 ElimStorePlain]: treesize reduction 3, result has 25.0 percent of original size [2019-11-20 07:36:59,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:36:59,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:1 [2019-11-20 07:36:59,530 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-20 07:36:59,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [764800833] [2019-11-20 07:36:59,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:36:59,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 07:36:59,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312000672] [2019-11-20 07:36:59,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:36:59,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:36:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:36:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:36:59,532 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 8 states. [2019-11-20 07:36:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:36:59,918 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-11-20 07:36:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:36:59,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-20 07:36:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:36:59,920 INFO L225 Difference]: With dead ends: 134 [2019-11-20 07:36:59,920 INFO L226 Difference]: Without dead ends: 134 [2019-11-20 07:36:59,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:36:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-20 07:36:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-11-20 07:36:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 07:36:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-20 07:36:59,925 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-11-20 07:36:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:36:59,925 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-20 07:36:59,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:36:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-20 07:36:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 07:36:59,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:36:59,926 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, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:00,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:00,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 349140478, now seen corresponding path program 1 times [2019-11-20 07:37:00,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:00,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [359285007] [2019-11-20 07:37:00,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:37:00,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:37:00,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:37:00,342 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-20 07:37:00,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:00,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 07:37:00,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:00,357 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-20 07:37:00,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:00,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2019-11-20 07:37:00,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-20 07:37:00,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:00,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2019-11-20 07:37:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:37:00,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:37:00,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-20 07:37:00,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:00,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:00,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:4 [2019-11-20 07:37:00,405 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-20 07:37:00,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [359285007] [2019-11-20 07:37:00,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 07:37:00,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2019-11-20 07:37:00,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981869785] [2019-11-20 07:37:00,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:37:00,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:37:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:37:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:37:00,407 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 4 states. [2019-11-20 07:37:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:37:00,700 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2019-11-20 07:37:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:37:00,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-20 07:37:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:37:00,703 INFO L225 Difference]: With dead ends: 169 [2019-11-20 07:37:00,704 INFO L226 Difference]: Without dead ends: 169 [2019-11-20 07:37:00,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:37:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-20 07:37:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 130. [2019-11-20 07:37:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 07:37:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2019-11-20 07:37:00,709 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 30 [2019-11-20 07:37:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:37:00,710 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2019-11-20 07:37:00,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:37:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2019-11-20 07:37:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 07:37:00,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:37:00,711 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:00,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:00,914 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2088899354, now seen corresponding path program 1 times [2019-11-20 07:37:00,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:00,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1134983967] [2019-11-20 07:37:00,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:37:01,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 07:37:01,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:37:01,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,274 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-20 07:37:01,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,290 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 07:37:01,290 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-20 07:37:01,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-20 07:37:01,324 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 07:37:01,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,342 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 07:37:01,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-20 07:37:01,364 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-20 07:37:01,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,385 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-20 07:37:01,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-20 07:37:01,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,460 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-11-20 07:37:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:37:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:01,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 07:37:01,508 INFO L567 ElimStorePlain]: treesize reduction 40, result has 50.6 percent of original size [2019-11-20 07:37:01,509 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-20 07:37:01,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-20 07:37:01,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,562 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 40 treesize of output 35 [2019-11-20 07:37:01,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:37:01,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-11-20 07:37:01,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 73 [2019-11-20 07:37:01,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,706 INFO L567 ElimStorePlain]: treesize reduction 28, result has 50.0 percent of original size [2019-11-20 07:37:01,707 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-20 07:37:01,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-11-20 07:37:01,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 07:37:01,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:01,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:37:01,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:46 [2019-11-20 07:37:01,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:01,975 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 63 [2019-11-20 07:37:01,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:01,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:02,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:02,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 07:37:02,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2019-11-20 07:37:02,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:02,083 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2019-11-20 07:37:02,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:02,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:02,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 07:37:02,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:34 [2019-11-20 07:37:02,253 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-20 07:37:02,254 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:37:02,433 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-20 07:37:02,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1134983967] [2019-11-20 07:37:02,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:37:02,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 6] imperfect sequences [] total 20 [2019-11-20 07:37:02,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332450385] [2019-11-20 07:37:02,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 07:37:02,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:37:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 07:37:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-11-20 07:37:02,435 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 21 states. [2019-11-20 07:37:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:37:07,827 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2019-11-20 07:37:07,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-20 07:37:07,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2019-11-20 07:37:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:37:07,828 INFO L225 Difference]: With dead ends: 225 [2019-11-20 07:37:07,828 INFO L226 Difference]: Without dead ends: 225 [2019-11-20 07:37:07,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=661, Invalid=1889, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 07:37:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-20 07:37:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 129. [2019-11-20 07:37:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 07:37:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2019-11-20 07:37:07,833 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 32 [2019-11-20 07:37:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:37:07,833 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2019-11-20 07:37:07,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 07:37:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2019-11-20 07:37:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 07:37:07,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:37:07,834 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:08,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:08,038 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2088899355, now seen corresponding path program 1 times [2019-11-20 07:37:08,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:08,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [991464121] [2019-11-20 07:37:08,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:37:08,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 07:37:08,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:37:08,495 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-20 07:37:08,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 07:37:08,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 07:37:08,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,542 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-20 07:37:08,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-20 07:37:08,558 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-20 07:37:08,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,569 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-20 07:37:08,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-20 07:37:08,634 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,635 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 59 [2019-11-20 07:37:08,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:08,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,664 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-20 07:37:08,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-20 07:37:08,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,751 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 40 treesize of output 35 [2019-11-20 07:37:08,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:37:08,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-11-20 07:37:08,864 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_96|], 3=[|v_#valid_174|]} [2019-11-20 07:37:08,869 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-20 07:37:08,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-20 07:37:08,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:08,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:08,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-11-20 07:37:08,986 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-20 07:37:08,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:09,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,013 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-20 07:37:09,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:09,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,037 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-20 07:37:09,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:27 [2019-11-20 07:37:09,153 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 24 [2019-11-20 07:37:09,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:09,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,232 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,232 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 68 [2019-11-20 07:37:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:37:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:09,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 07:37:09,294 INFO L567 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size [2019-11-20 07:37:09,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 07:37:09,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:51 [2019-11-20 07:37:09,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,361 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 51 treesize of output 42 [2019-11-20 07:37:09,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:09,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,383 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 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-20 07:37:09,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:09,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:09,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:09,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:11 [2019-11-20 07:37:09,451 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-20 07:37:09,451 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:37:14,179 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 07:37:18,165 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 07:37:18,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:18,523 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 07:37:18,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:18,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:18,808 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 07:37:18,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:18,816 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:19,182 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 07:37:19,182 INFO L567 ElimStorePlain]: treesize reduction 58, result has 69.1 percent of original size [2019-11-20 07:37:19,190 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:19,389 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 07:37:19,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:19,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:37:19,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:19,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:19,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 07:37:19,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:19,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:19,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:37:19,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 7 xjuncts. [2019-11-20 07:37:19,398 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:166, output treesize:62 [2019-11-20 07:37:19,837 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-20 07:37:19,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991464121] [2019-11-20 07:37:19,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:37:19,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 25 [2019-11-20 07:37:19,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199231210] [2019-11-20 07:37:19,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 07:37:19,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:37:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 07:37:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-11-20 07:37:19,840 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 26 states. [2019-11-20 07:37:21,690 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-20 07:37:25,462 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-11-20 07:37:26,025 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-11-20 07:37:33,948 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-11-20 07:37:38,648 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-11-20 07:37:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:37:42,663 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2019-11-20 07:37:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-20 07:37:42,664 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-11-20 07:37:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:37:42,665 INFO L225 Difference]: With dead ends: 181 [2019-11-20 07:37:42,665 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 07:37:42,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=663, Invalid=2417, Unknown=0, NotChecked=0, Total=3080 [2019-11-20 07:37:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 07:37:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 125. [2019-11-20 07:37:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 07:37:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-20 07:37:42,671 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 32 [2019-11-20 07:37:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:37:42,671 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-20 07:37:42,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 07:37:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-20 07:37:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:37:42,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:37:42,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:42,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:42,877 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1267224473, now seen corresponding path program 1 times [2019-11-20 07:37:42,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:42,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1559382334] [2019-11-20 07:37:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:37:43,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:37:43,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:37:43,098 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 13 treesize of output 9 [2019-11-20 07:37:43,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:43,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:43,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:43,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 07:37:43,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 07:37:43,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:43,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:43,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:43,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 07:37:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:37:43,121 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:37:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:37:43,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1559382334] [2019-11-20 07:37:43,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:37:43,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:37:43,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128760491] [2019-11-20 07:37:43,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:37:43,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:37:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:37:43,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:37:43,156 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 6 states. [2019-11-20 07:37:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:37:43,624 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2019-11-20 07:37:43,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:37:43,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-20 07:37:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:37:43,626 INFO L225 Difference]: With dead ends: 135 [2019-11-20 07:37:43,627 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 07:37:43,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:37:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 07:37:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2019-11-20 07:37:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-20 07:37:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2019-11-20 07:37:43,631 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 34 [2019-11-20 07:37:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:37:43,631 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2019-11-20 07:37:43,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:37:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2019-11-20 07:37:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 07:37:43,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:37:43,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:43,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:43,841 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1246229763, now seen corresponding path program 1 times [2019-11-20 07:37:43,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:43,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [293285632] [2019-11-20 07:37:43,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:37:44,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:37:44,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:37:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:37:44,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:37:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:37:44,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [293285632] [2019-11-20 07:37:44,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:37:44,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 2] imperfect sequences [] total 4 [2019-11-20 07:37:44,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862807256] [2019-11-20 07:37:44,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 07:37:44,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:37:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 07:37:44,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:37:44,122 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 5 states. [2019-11-20 07:37:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:37:44,280 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2019-11-20 07:37:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:37:44,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-20 07:37:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:37:44,282 INFO L225 Difference]: With dead ends: 130 [2019-11-20 07:37:44,282 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 07:37:44,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:37:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 07:37:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-20 07:37:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-20 07:37:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2019-11-20 07:37:44,286 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 34 [2019-11-20 07:37:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:37:44,287 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2019-11-20 07:37:44,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 07:37:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2019-11-20 07:37:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 07:37:44,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:37:44,288 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:44,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:44,491 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:44,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:44,491 INFO L82 PathProgramCache]: Analyzing trace with hash -733258278, now seen corresponding path program 1 times [2019-11-20 07:37:44,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:44,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [248697128] [2019-11-20 07:37:44,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:37:44,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 07:37:44,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:37:44,828 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 19 treesize of output 1 [2019-11-20 07:37:44,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:44,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:44,857 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 19 treesize of output 1 [2019-11-20 07:37:44,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:44,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:44,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 07:37:44,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2019-11-20 07:37:44,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 07:37:44,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:45,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:45,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 07:37:45,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 07:37:45,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 07:37:45,027 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-20 07:37:45,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-20 07:37:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:37:45,103 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:37:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:37:45,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [248697128] [2019-11-20 07:37:45,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:37:45,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-11-20 07:37:45,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670341009] [2019-11-20 07:37:45,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 07:37:45,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:37:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 07:37:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-20 07:37:45,294 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand 14 states. [2019-11-20 07:37:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:37:47,175 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2019-11-20 07:37:47,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 07:37:47,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-20 07:37:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:37:47,177 INFO L225 Difference]: With dead ends: 183 [2019-11-20 07:37:47,177 INFO L226 Difference]: Without dead ends: 183 [2019-11-20 07:37:47,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-11-20 07:37:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-20 07:37:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 141. [2019-11-20 07:37:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 07:37:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2019-11-20 07:37:47,182 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 37 [2019-11-20 07:37:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:37:47,182 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2019-11-20 07:37:47,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 07:37:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2019-11-20 07:37:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 07:37:47,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:37:47,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:37:47,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:47,384 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr69ENSURES_VIOLATIONMEMORY_LEAK, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION]=== [2019-11-20 07:37:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:37:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1256170504, now seen corresponding path program 1 times [2019-11-20 07:37:47,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:37:47,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [444462661] [2019-11-20 07:37:47,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af2c885d-3c8b-47ca-8b80-45dd4da77104/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:37:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:37:47,816 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 07:37:47,816 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:37:48,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 07:37:48,046 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-20 07:37:48,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:37:48 BoogieIcfgContainer [2019-11-20 07:37:48,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:37:48,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:37:48,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:37:48,081 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:37:48,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:36:16" (3/4) ... [2019-11-20 07:37:48,085 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 07:37:48,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:37:48,087 INFO L168 Benchmark]: Toolchain (without parser) took 93246.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 944.7 MB in the beginning and 879.5 MB in the end (delta: 65.2 MB). Peak memory consumption was 455.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:37:48,088 INFO L168 Benchmark]: CDTParser took 0.70 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-20 07:37:48,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:37:48,088 INFO L168 Benchmark]: Boogie Preprocessor took 69.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:37:48,089 INFO L168 Benchmark]: RCFGBuilder took 1025.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:37:48,090 INFO L168 Benchmark]: TraceAbstraction took 91568.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.0 GB in the beginning and 879.5 MB in the end (delta: 154.4 MB). Peak memory consumption was 411.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:37:48,090 INFO L168 Benchmark]: Witness Printer took 5.18 ms. Allocated memory is still 1.4 GB. Free memory is still 879.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:37:48,091 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.70 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 572.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1025.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91568.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.0 GB in the beginning and 879.5 MB in the end (delta: 154.4 MB). Peak memory consumption was 411.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.18 ms. Allocated memory is still 1.4 GB. Free memory is still 879.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 153 locations, 70 error locations. Result: UNSAFE, OverallTime: 91.5s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 56.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1837 SDtfs, 3885 SDslu, 4769 SDs, 0 SdLazy, 7668 SolverSat, 382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1081 GetRequests, 794 SyntacticMatches, 17 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 48.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 831 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 928 ConstructedInterpolants, 47 QuantifiedInterpolants, 169535 SizeOfPredicates, 182 NumberOfNonLiveVariables, 2362 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 42 InterpolantComputations, 37 PerfectInterpolantSequences, 9/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...