./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i -s /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efc45e5708d4a9b560055cd5abf7b168f9024833 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:45:28,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:45:28,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:45:28,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:45:28,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:45:28,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:45:28,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:45:28,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:45:28,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:45:28,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:45:28,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:45:28,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:45:28,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:45:28,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:45:28,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:45:28,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:45:28,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:45:28,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:45:28,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:45:28,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:45:28,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:45:28,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:45:28,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:45:28,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:45:28,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:45:28,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:45:28,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:45:28,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:45:28,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:45:28,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:45:28,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:45:28,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:45:28,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:45:28,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:45:28,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:45:28,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:45:28,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:45:28,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:45:28,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:45:28,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:45:28,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:45:28,563 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:45:28,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:45:28,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:45:28,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:45:28,596 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:45:28,596 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:45:28,596 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:45:28,596 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:45:28,596 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:45:28,597 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:45:28,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:45:28,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:45:28,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:45:28,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:45:28,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:45:28,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:45:28,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:45:28,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:45:28,599 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:45:28,599 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:45:28,599 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:45:28,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:45:28,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:45:28,599 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:45:28,600 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:45:28,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:45:28,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:45:28,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:45:28,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:45:28,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:45:28,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:45:28,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:45:28,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:45:28,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:45:28,602 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:45:28,602 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:45:28,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:45:28,602 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_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan 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 -> Taipan 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 -> efc45e5708d4a9b560055cd5abf7b168f9024833 [2019-11-26 02:45:28,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:45:28,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:45:28,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:45:28,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:45:28,765 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:45:28,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2019-11-26 02:45:28,811 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/data/ebe6bbc08/70488f7f07b547c7b8b7e603ed0e152d/FLAG2f1a1f526 [2019-11-26 02:45:29,217 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:45:29,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2019-11-26 02:45:29,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/data/ebe6bbc08/70488f7f07b547c7b8b7e603ed0e152d/FLAG2f1a1f526 [2019-11-26 02:45:29,237 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/data/ebe6bbc08/70488f7f07b547c7b8b7e603ed0e152d [2019-11-26 02:45:29,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:45:29,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:45:29,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:45:29,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:45:29,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:45:29,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6857332f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29, skipping insertion in model container [2019-11-26 02:45:29,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:45:29,290 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:45:29,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:45:29,699 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:45:29,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:45:29,793 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:45:29,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29 WrapperNode [2019-11-26 02:45:29,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:45:29,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:45:29,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:45:29,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:45:29,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:45:29,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:45:29,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:45:29,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:45:29,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... [2019-11-26 02:45:29,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:45:29,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:45:29,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:45:29,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:45:29,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-26 02:45:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:45:29,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-26 02:45:29,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:45:29,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:45:29,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:45:30,323 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:45:30,323 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-26 02:45:30,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:45:30 BoogieIcfgContainer [2019-11-26 02:45:30,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:45:30,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:45:30,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:45:30,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:45:30,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:45:29" (1/3) ... [2019-11-26 02:45:30,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376e51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:45:30, skipping insertion in model container [2019-11-26 02:45:30,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:45:29" (2/3) ... [2019-11-26 02:45:30,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376e51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:45:30, skipping insertion in model container [2019-11-26 02:45:30,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:45:30" (3/3) ... [2019-11-26 02:45:30,331 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe.i [2019-11-26 02:45:30,340 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:45:30,349 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-26 02:45:30,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-26 02:45:30,381 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:45:30,381 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:45:30,381 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:45:30,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:45:30,382 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:45:30,382 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:45:30,382 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:45:30,382 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:45:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-26 02:45:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:45:30,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:30,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:45:30,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2019-11-26 02:45:30,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:30,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1884824747] [2019-11-26 02:45:30,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:30,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:45:30,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:30,621 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-26 02:45:30,621 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:30,667 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-26 02:45:30,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1884824747] [2019-11-26 02:45:30,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:30,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:45:30,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147628136] [2019-11-26 02:45:30,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:45:30,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:30,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:45:30,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:45:30,688 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 6 states. [2019-11-26 02:45:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:30,814 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-26 02:45:30,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:45:30,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-11-26 02:45:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:30,825 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:45:30,825 INFO L226 Difference]: Without dead ends: 78 [2019-11-26 02:45:30,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:45:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-26 02:45:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2019-11-26 02:45:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 02:45:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-26 02:45:30,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 6 [2019-11-26 02:45:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:30,865 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-26 02:45:30,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:45:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-26 02:45:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:45:30,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:30,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:45:31,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:31,067 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash 889508820, now seen corresponding path program 1 times [2019-11-26 02:45:31,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:31,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1207920882] [2019-11-26 02:45:31,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:31,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:45:31,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:31,166 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-26 02:45:31,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:31,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:31,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:31,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:45:31,180 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-26 02:45:31,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:31,183 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-26 02:45:31,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1207920882] [2019-11-26 02:45:31,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:31,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:45:31,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181655784] [2019-11-26 02:45:31,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:45:31,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:45:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:45:31,186 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-11-26 02:45:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:31,271 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-26 02:45:31,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:45:31,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-26 02:45:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:31,272 INFO L225 Difference]: With dead ends: 43 [2019-11-26 02:45:31,272 INFO L226 Difference]: Without dead ends: 43 [2019-11-26 02:45:31,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-26 02:45:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-26 02:45:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-26 02:45:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:45:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-26 02:45:31,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 6 [2019-11-26 02:45:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:31,278 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-26 02:45:31,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:45:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-26 02:45:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:45:31,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:31,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:45:31,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:31,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 889508821, now seen corresponding path program 1 times [2019-11-26 02:45:31,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:31,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [26532245] [2019-11-26 02:45:31,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:31,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:45:31,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:31,583 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-26 02:45:31,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:31,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:31,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:31,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-26 02:45:31,614 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-26 02:45:31,614 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:31,711 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-26 02:45:31,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26532245] [2019-11-26 02:45:31,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:31,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:45:31,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580505450] [2019-11-26 02:45:31,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:45:31,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:45:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:45:31,713 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-11-26 02:45:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:32,039 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-11-26 02:45:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:45:32,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-11-26 02:45:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:32,042 INFO L225 Difference]: With dead ends: 73 [2019-11-26 02:45:32,042 INFO L226 Difference]: Without dead ends: 73 [2019-11-26 02:45:32,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:45:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-26 02:45:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2019-11-26 02:45:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-26 02:45:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-26 02:45:32,049 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 6 [2019-11-26 02:45:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:32,049 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-26 02:45:32,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:45:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-26 02:45:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:45:32,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:32,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:45:32,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:32,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:32,257 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2019-11-26 02:45:32,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:32,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1818669566] [2019-11-26 02:45:32,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:32,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:45:32,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:32,380 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-26 02:45:32,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:32,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:32,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:32,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2019-11-26 02:45:32,420 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-26 02:45:32,420 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:32,515 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-26 02:45:32,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1818669566] [2019-11-26 02:45:32,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:32,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 02:45:32,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623939981] [2019-11-26 02:45:32,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:45:32,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:32,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:45:32,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:45:32,517 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-26 02:45:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:32,929 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-11-26 02:45:32,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:45:32,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-26 02:45:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:32,931 INFO L225 Difference]: With dead ends: 77 [2019-11-26 02:45:32,931 INFO L226 Difference]: Without dead ends: 77 [2019-11-26 02:45:32,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:45:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-26 02:45:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2019-11-26 02:45:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-26 02:45:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-11-26 02:45:32,937 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 6 [2019-11-26 02:45:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:32,937 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-11-26 02:45:32,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:45:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-11-26 02:45:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:45:32,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:32,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:33,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:33,141 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash -590959631, now seen corresponding path program 1 times [2019-11-26 02:45:33,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:33,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [415296342] [2019-11-26 02:45:33,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:33,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:45:33,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:33,256 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-26 02:45:33,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:33,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:33,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:33,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:45:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:33,278 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:33,282 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-26 02:45:33,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [415296342] [2019-11-26 02:45:33,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:33,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:45:33,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52504277] [2019-11-26 02:45:33,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:45:33,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:33,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:45:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:45:33,284 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2019-11-26 02:45:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:33,434 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-11-26 02:45:33,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:45:33,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-26 02:45:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:33,436 INFO L225 Difference]: With dead ends: 41 [2019-11-26 02:45:33,436 INFO L226 Difference]: Without dead ends: 41 [2019-11-26 02:45:33,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-26 02:45:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-26 02:45:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-26 02:45:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-26 02:45:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-26 02:45:33,440 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 9 [2019-11-26 02:45:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:33,441 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-26 02:45:33,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:45:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-26 02:45:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:45:33,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:33,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:33,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:33,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash -590959630, now seen corresponding path program 1 times [2019-11-26 02:45:33,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:33,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [43742482] [2019-11-26 02:45:33,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:33,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:45:33,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:33,751 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-26 02:45:33,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:33,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:33,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:33,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:45:33,798 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-26 02:45:33,798 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:33,984 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-26 02:45:33,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [43742482] [2019-11-26 02:45:33,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:33,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 02:45:33,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754463897] [2019-11-26 02:45:33,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:45:33,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:45:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:45:33,986 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 10 states. [2019-11-26 02:45:34,482 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-26 02:45:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:34,758 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-11-26 02:45:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:45:34,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-11-26 02:45:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:34,760 INFO L225 Difference]: With dead ends: 88 [2019-11-26 02:45:34,760 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 02:45:34,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:45:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 02:45:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 40. [2019-11-26 02:45:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-26 02:45:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-26 02:45:34,765 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 9 [2019-11-26 02:45:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:34,765 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-26 02:45:34,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:45:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-26 02:45:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:45:34,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:34,766 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:34,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:34,968 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2019-11-26 02:45:34,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:34,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [306426611] [2019-11-26 02:45:34,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:35,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:45:35,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:35,054 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-26 02:45:35,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:35,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:35,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:35,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-11-26 02:45:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:35,175 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:35,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [306426611] [2019-11-26 02:45:35,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98633001] [2019-11-26 02:45:35,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:45:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:35,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:45:35,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:35,699 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-26 02:45:35,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:35,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:35,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:35,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-11-26 02:45:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:35,808 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:36,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:45:36,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 14 [2019-11-26 02:45:36,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893373322] [2019-11-26 02:45:36,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:45:36,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:45:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:45:36,360 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 15 states. [2019-11-26 02:45:37,208 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-11-26 02:45:37,420 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-11-26 02:45:37,937 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-26 02:45:38,448 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-26 02:45:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:38,713 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2019-11-26 02:45:38,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:45:38,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-11-26 02:45:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:38,725 INFO L225 Difference]: With dead ends: 160 [2019-11-26 02:45:38,725 INFO L226 Difference]: Without dead ends: 160 [2019-11-26 02:45:38,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:45:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-26 02:45:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 52. [2019-11-26 02:45:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-26 02:45:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-26 02:45:38,731 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 10 [2019-11-26 02:45:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:38,732 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-26 02:45:38,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:45:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-26 02:45:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:45:38,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:38,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:39,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:39,135 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2134761079, now seen corresponding path program 1 times [2019-11-26 02:45:39,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:39,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [614419121] [2019-11-26 02:45:39,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:39,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:45:39,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:39,232 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:39,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [614419121] [2019-11-26 02:45:39,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:39,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:45:39,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496996688] [2019-11-26 02:45:39,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:45:39,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:45:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:45:39,238 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 3 states. [2019-11-26 02:45:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:39,250 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-11-26 02:45:39,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:45:39,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-26 02:45:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:39,253 INFO L225 Difference]: With dead ends: 53 [2019-11-26 02:45:39,253 INFO L226 Difference]: Without dead ends: 53 [2019-11-26 02:45:39,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-26 02:45:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-26 02:45:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-26 02:45:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 02:45:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-26 02:45:39,261 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 13 [2019-11-26 02:45:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:39,261 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-26 02:45:39,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:45:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-26 02:45:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:45:39,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:39,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:39,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:39,465 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1483111174, now seen corresponding path program 1 times [2019-11-26 02:45:39,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:39,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1700487803] [2019-11-26 02:45:39,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:39,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 02:45:39,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:39,564 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 12 treesize of output 8 [2019-11-26 02:45:39,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:39,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:39,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:39,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-26 02:45:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:39,655 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:39,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:39,770 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 16 treesize of output 14 [2019-11-26 02:45:39,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-26 02:45:39,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:39,789 INFO L567 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-11-26 02:45:39,789 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:39,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:39,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:39,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:6 [2019-11-26 02:45:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:39,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1700487803] [2019-11-26 02:45:39,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:39,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 14 [2019-11-26 02:45:39,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570350521] [2019-11-26 02:45:39,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:45:39,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:39,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:45:39,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:45:39,800 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 14 states. [2019-11-26 02:45:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:40,114 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-11-26 02:45:40,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:45:40,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-11-26 02:45:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:40,115 INFO L225 Difference]: With dead ends: 76 [2019-11-26 02:45:40,116 INFO L226 Difference]: Without dead ends: 76 [2019-11-26 02:45:40,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:45:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-26 02:45:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-11-26 02:45:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-26 02:45:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-11-26 02:45:40,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 15 [2019-11-26 02:45:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:40,120 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-11-26 02:45:40,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:45:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-11-26 02:45:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:45:40,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:40,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:40,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:40,322 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 896305160, now seen corresponding path program 1 times [2019-11-26 02:45:40,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:40,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [482779618] [2019-11-26 02:45:40,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:40,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 02:45:40,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:40,411 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-26 02:45:40,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:40,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:40,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:40,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-11-26 02:45:40,444 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 17 treesize of output 13 [2019-11-26 02:45:40,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:40,478 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-11-26 02:45:40,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:40,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-11-26 02:45:40,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:40,721 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-26 02:45:40,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:40,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:40,742 INFO L567 ElimStorePlain]: treesize reduction 8, result has 69.2 percent of original size [2019-11-26 02:45:40,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:40,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-11-26 02:45:40,808 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-26 02:45:40,809 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:41,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:41,482 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 38 treesize of output 36 [2019-11-26 02:45:41,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:45:41,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:45:41,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-11-26 02:45:41,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:41,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:41,529 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:41,543 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 40 treesize of output 38 [2019-11-26 02:45:41,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-26 02:45:41,568 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:41,632 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-26 02:45:41,633 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:41,650 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 40 treesize of output 38 [2019-11-26 02:45:41,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-26 02:45:41,683 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:41,749 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-26 02:45:41,749 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:41,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:41,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-26 02:45:41,829 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:83 [2019-11-26 02:45:42,047 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-26 02:45:42,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482779618] [2019-11-26 02:45:42,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108480891] [2019-11-26 02:45:42,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:45:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:42,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-26 02:45:42,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:42,106 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-26 02:45:42,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:42,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:42,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:42,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-11-26 02:45:42,128 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 17 treesize of output 13 [2019-11-26 02:45:42,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:42,167 INFO L567 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2019-11-26 02:45:42,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:42,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2019-11-26 02:45:42,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:42,193 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-26 02:45:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:45:42,245 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2019-11-26 02:45:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:45:42,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-26 02:45:42,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:42,955 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-26 02:45:42,955 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:45:43,372 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 33 treesize of output 31 [2019-11-26 02:45:43,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-26 02:45:43,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:43,423 INFO L567 ElimStorePlain]: treesize reduction 7, result has 76.7 percent of original size [2019-11-26 02:45:43,423 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:43,432 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 35 treesize of output 33 [2019-11-26 02:45:43,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-26 02:45:43,454 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:43,490 INFO L567 ElimStorePlain]: treesize reduction 7, result has 78.1 percent of original size [2019-11-26 02:45:43,491 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:43,504 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 35 treesize of output 33 [2019-11-26 02:45:43,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-26 02:45:43,527 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-26 02:45:43,573 INFO L567 ElimStorePlain]: treesize reduction 11, result has 65.6 percent of original size [2019-11-26 02:45:43,573 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:43,680 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-26 02:45:43,681 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2019-11-26 02:45:43,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-26 02:45:43,681 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:104, output treesize:70 [2019-11-26 02:45:43,953 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-26 02:45:43,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:45:43,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10, 10] total 26 [2019-11-26 02:45:43,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970960050] [2019-11-26 02:45:43,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-26 02:45:43,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-26 02:45:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2019-11-26 02:45:43,956 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 27 states. [2019-11-26 02:45:44,295 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-11-26 02:45:44,908 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-26 02:45:45,092 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-26 02:45:45,335 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-26 02:45:45,516 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-26 02:45:45,721 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-26 02:45:46,141 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-26 02:45:46,357 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-26 02:45:46,613 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-26 02:45:46,894 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-26 02:45:47,104 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-11-26 02:45:47,376 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-26 02:45:47,703 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-26 02:45:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:47,866 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-11-26 02:45:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 02:45:47,867 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 15 [2019-11-26 02:45:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:47,868 INFO L225 Difference]: With dead ends: 137 [2019-11-26 02:45:47,868 INFO L226 Difference]: Without dead ends: 137 [2019-11-26 02:45:47,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=447, Invalid=1275, Unknown=0, NotChecked=0, Total=1722 [2019-11-26 02:45:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-26 02:45:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 71. [2019-11-26 02:45:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 02:45:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2019-11-26 02:45:47,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 15 [2019-11-26 02:45:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:47,873 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2019-11-26 02:45:47,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-26 02:45:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2019-11-26 02:45:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:45:47,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:47,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:48,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:45:48,275 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:48,275 INFO L82 PathProgramCache]: Analyzing trace with hash 639793573, now seen corresponding path program 1 times [2019-11-26 02:45:48,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:48,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1455772913] [2019-11-26 02:45:48,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:48,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:45:48,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:48,372 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-26 02:45:48,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:48,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:48,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:48,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:45:48,434 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-26 02:45:48,434 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:48,437 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-26 02:45:48,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455772913] [2019-11-26 02:45:48,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:48,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-26 02:45:48,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696622258] [2019-11-26 02:45:48,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:45:48,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:48,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:45:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:45:48,439 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 8 states. [2019-11-26 02:45:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:48,719 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-11-26 02:45:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:45:48,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-26 02:45:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:48,721 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:45:48,721 INFO L226 Difference]: Without dead ends: 82 [2019-11-26 02:45:48,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:45:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-26 02:45:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2019-11-26 02:45:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:45:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-26 02:45:48,725 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 17 [2019-11-26 02:45:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:48,726 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-26 02:45:48,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:45:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-26 02:45:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:45:48,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:48,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:48,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:48,931 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash 639793574, now seen corresponding path program 1 times [2019-11-26 02:45:48,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:48,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [440506305] [2019-11-26 02:45:48,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:45:49,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-26 02:45:49,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:45:49,019 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-26 02:45:49,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:45:49,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:45:49,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:45:49,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:45:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:45:49,146 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:45:49,552 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-26 02:45:49,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [440506305] [2019-11-26 02:45:49,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:45:49,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-26 02:45:49,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756053944] [2019-11-26 02:45:49,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 02:45:49,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:45:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 02:45:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:45:49,553 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 16 states. [2019-11-26 02:45:50,677 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-26 02:45:51,087 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-26 02:45:51,569 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-26 02:45:52,023 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-26 02:45:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:45:52,083 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-26 02:45:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 02:45:52,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-11-26 02:45:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:45:52,085 INFO L225 Difference]: With dead ends: 112 [2019-11-26 02:45:52,085 INFO L226 Difference]: Without dead ends: 112 [2019-11-26 02:45:52,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-11-26 02:45:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-26 02:45:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2019-11-26 02:45:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:45:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-26 02:45:52,089 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 17 [2019-11-26 02:45:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:45:52,090 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-26 02:45:52,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 02:45:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-26 02:45:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:45:52,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:45:52,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:45:52,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:52,295 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-26 02:45:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:45:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash 639853155, now seen corresponding path program 1 times [2019-11-26 02:45:52,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:45:52,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1495408917] [2019-11-26 02:45:52,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/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-26 02:45:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:45:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:45:52,442 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-11-26 02:45:52,442 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:45:52,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:45:52,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:45:52 BoogieIcfgContainer [2019-11-26 02:45:52,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:45:52,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:45:52,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:45:52,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:45:52,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:45:30" (3/4) ... [2019-11-26 02:45:52,674 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:45:52,715 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_46f049b1-a3a9-4c0a-95a2-ddb76309a373/bin/utaipan/witness.graphml [2019-11-26 02:45:52,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:45:52,716 INFO L168 Benchmark]: Toolchain (without parser) took 23476.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 946.1 MB in the beginning and 923.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 350.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:52,717 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:45:52,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:52,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:52,718 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 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-26 02:45:52,718 INFO L168 Benchmark]: RCFGBuilder took 433.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:52,718 INFO L168 Benchmark]: TraceAbstraction took 22345.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 926.5 MB in the end (delta: 183.5 MB). Peak memory consumption was 345.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:52,719 INFO L168 Benchmark]: Witness Printer took 44.32 ms. Allocated memory is still 1.4 GB. Free memory was 926.5 MB in the beginning and 923.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:45:52,721 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.55 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 433.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22345.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 926.5 MB in the end (delta: 183.5 MB). Peak memory consumption was 345.5 MB. Max. memory is 11.5 GB. * Witness Printer took 44.32 ms. Allocated memory is still 1.4 GB. Free memory was 926.5 MB in the beginning and 923.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 537]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; [L521] COND FALSE !(i < length - 1) [L526] nondetString[length-1] = '\0' [L527] return nondetString; [L536] char* s = build_nondet_String(); [L531] EXPR \read(*s) [L531] *s != '\0' && *s != (char)c [L531] COND FALSE !(*s != '\0' && *s != (char)c) [L533] EXPR \read(*s) [L533] EXPR (*s == c) ? (char *) s : 0 [L533] return ( (*s == c) ? (char *) s : 0 ); - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 16 error locations. Result: UNSAFE, OverallTime: 22.2s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 392 SDtfs, 3067 SDslu, 1393 SDs, 0 SdLazy, 1176 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 177 SyntacticMatches, 9 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 382 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 280 ConstructedInterpolants, 1 QuantifiedInterpolants, 36255 SizeOfPredicates, 106 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 4/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 proved your program to be incorrect! Received shutdown request...