./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd9175bc78e257bbf4cf5a6f64f3805ac593d6c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:15:04,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:15:04,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:15:04,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:15:04,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:15:04,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:15:04,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:15:04,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:15:04,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:15:04,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:15:04,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:15:04,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:15:04,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:15:04,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:15:04,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:15:04,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:15:04,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:15:04,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:15:04,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:15:04,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:15:04,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:15:04,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:15:04,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:15:04,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:15:04,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:15:04,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:15:04,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:15:04,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:15:04,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:15:04,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:15:04,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:15:04,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:15:04,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:15:04,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:15:04,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:15:04,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:15:04,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:15:04,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:15:04,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:15:04,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:15:04,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:15:04,480 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 01:15:04,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:15:04,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:15:04,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:15:04,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:15:04,505 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:15:04,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:15:04,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:15:04,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:15:04,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:15:04,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:15:04,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:15:04,506 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 01:15:04,506 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 01:15:04,506 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 01:15:04,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:15:04,507 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:15:04,507 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:15:04,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:15:04,507 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:15:04,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:15:04,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:15:04,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:15:04,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:15:04,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:15:04,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:15:04,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:15:04,509 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:15:04,509 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:15:04,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:15:04,509 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_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccd9175bc78e257bbf4cf5a6f64f3805ac593d6c [2019-11-20 01:15:04,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:15:04,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:15:04,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:15:04,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:15:04,695 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:15:04,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2019-11-20 01:15:04,750 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/data/e28ef5b92/5cab8e9f8ae1407994973a4aec420b51/FLAG2efa10881 [2019-11-20 01:15:05,133 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:15:05,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2019-11-20 01:15:05,152 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/data/e28ef5b92/5cab8e9f8ae1407994973a4aec420b51/FLAG2efa10881 [2019-11-20 01:15:05,471 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/data/e28ef5b92/5cab8e9f8ae1407994973a4aec420b51 [2019-11-20 01:15:05,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:15:05,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 01:15:05,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:15:05,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:15:05,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:15:05,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:15:05" (1/1) ... [2019-11-20 01:15:05,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3c601e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:05, skipping insertion in model container [2019-11-20 01:15:05,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:15:05" (1/1) ... [2019-11-20 01:15:05,488 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:15:05,520 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:15:05,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:15:05,894 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:15:05,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:15:06,010 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:15:06,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06 WrapperNode [2019-11-20 01:15:06,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:15:06,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:15:06,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:15:06,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:15:06,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... [2019-11-20 01:15:06,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:15:06,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:15:06,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:15:06,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:15:06,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:15:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 01:15:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:15:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 01:15:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 01:15:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 01:15:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 01:15:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 01:15:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2019-11-20 01:15:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 01:15:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 01:15:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 01:15:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 01:15:06,152 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 01:15:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 01:15:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 01:15:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 01:15:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 01:15:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 01:15:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 01:15:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 01:15:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 01:15:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 01:15:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 01:15:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 01:15:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 01:15:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 01:15:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 01:15:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 01:15:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 01:15:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 01:15:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 01:15:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 01:15:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 01:15:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 01:15:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 01:15:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 01:15:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 01:15:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 01:15:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 01:15:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 01:15:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 01:15:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 01:15:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 01:15:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 01:15:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 01:15:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 01:15:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 01:15:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 01:15:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 01:15:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 01:15:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 01:15:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 01:15:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 01:15:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 01:15:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 01:15:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 01:15:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 01:15:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 01:15:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 01:15:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 01:15:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 01:15:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 01:15:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 01:15:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 01:15:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 01:15:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 01:15:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 01:15:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 01:15:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:15:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 01:15:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 01:15:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:15:06,974 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:15:06,975 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 01:15:06,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:15:06 BoogieIcfgContainer [2019-11-20 01:15:06,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:15:06,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:15:06,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:15:06,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:15:06,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:15:05" (1/3) ... [2019-11-20 01:15:06,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a874b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:15:06, skipping insertion in model container [2019-11-20 01:15:06,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:15:06" (2/3) ... [2019-11-20 01:15:06,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a874b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:15:06, skipping insertion in model container [2019-11-20 01:15:06,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:15:06" (3/3) ... [2019-11-20 01:15:06,982 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2019-11-20 01:15:07,001 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:15:07,008 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-20 01:15:07,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-20 01:15:07,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:15:07,052 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 01:15:07,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:15:07,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:15:07,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:15:07,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:15:07,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:15:07,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:15:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-11-20 01:15:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:15:07,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:07,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:07,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1403134826, now seen corresponding path program 1 times [2019-11-20 01:15:07,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:07,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [574509868] [2019-11-20 01:15:07,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:07,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 01:15:07,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:07,316 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:07,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [574509868] [2019-11-20 01:15:07,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:07,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:15:07,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5632100] [2019-11-20 01:15:07,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:15:07,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:15:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:15:07,355 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2019-11-20 01:15:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:07,372 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-11-20 01:15:07,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:15:07,374 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-20 01:15:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:07,382 INFO L225 Difference]: With dead ends: 67 [2019-11-20 01:15:07,383 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 01:15:07,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:15:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 01:15:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-20 01:15:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 01:15:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-20 01:15:07,419 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 11 [2019-11-20 01:15:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:07,419 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-20 01:15:07,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:15:07,419 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-20 01:15:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:15:07,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:07,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:07,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:07,622 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1403134516, now seen corresponding path program 1 times [2019-11-20 01:15:07,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:07,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1350312091] [2019-11-20 01:15:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:07,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:15:07,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:07,884 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:15:07,885 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:07,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:07,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:07,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:07,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 01:15:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:07,917 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:07,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1350312091] [2019-11-20 01:15:07,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:07,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:15:07,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859258745] [2019-11-20 01:15:07,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:15:07,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:15:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:15:07,928 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2019-11-20 01:15:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:08,100 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-20 01:15:08,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:15:08,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 01:15:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:08,102 INFO L225 Difference]: With dead ends: 62 [2019-11-20 01:15:08,103 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 01:15:08,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:15:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 01:15:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-20 01:15:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 01:15:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-20 01:15:08,116 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 11 [2019-11-20 01:15:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-20 01:15:08,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:15:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-20 01:15:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:15:08,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:08,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:08,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:08,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1403134517, now seen corresponding path program 1 times [2019-11-20 01:15:08,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:08,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1314628769] [2019-11-20 01:15:08,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:08,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:15:08,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:08,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:08,585 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:15:08,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:08,635 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-20 01:15:08,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:08,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-11-20 01:15:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:08,659 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:08,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1314628769] [2019-11-20 01:15:08,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:08,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 01:15:08,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685034056] [2019-11-20 01:15:08,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:08,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:08,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:08,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:08,799 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2019-11-20 01:15:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:09,369 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-20 01:15:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:09,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 01:15:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:09,373 INFO L225 Difference]: With dead ends: 73 [2019-11-20 01:15:09,373 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 01:15:09,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:15:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 01:15:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2019-11-20 01:15:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 01:15:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-11-20 01:15:09,389 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 11 [2019-11-20 01:15:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:09,390 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-11-20 01:15:09,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-11-20 01:15:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:15:09,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:09,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:09,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:09,593 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:09,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:09,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1403134570, now seen corresponding path program 1 times [2019-11-20 01:15:09,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:09,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [342208012] [2019-11-20 01:15:09,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:09,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:15:09,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:09,819 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:09,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [342208012] [2019-11-20 01:15:09,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:09,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 01:15:09,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907919822] [2019-11-20 01:15:09,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:09,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:09,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:09,855 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2019-11-20 01:15:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:09,938 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2019-11-20 01:15:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:15:09,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 01:15:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:09,940 INFO L225 Difference]: With dead ends: 69 [2019-11-20 01:15:09,940 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 01:15:09,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-20 01:15:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 01:15:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-11-20 01:15:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-20 01:15:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-11-20 01:15:09,947 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 11 [2019-11-20 01:15:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:09,947 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-11-20 01:15:09,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-11-20 01:15:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:15:09,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:09,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:10,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:10,153 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1404981612, now seen corresponding path program 1 times [2019-11-20 01:15:10,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:10,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1943180355] [2019-11-20 01:15:10,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:10,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:15:10,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:10,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:10,359 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:15:10,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:10,414 INFO L567 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2019-11-20 01:15:10,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:10,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:13 [2019-11-20 01:15:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:10,436 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:10,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1943180355] [2019-11-20 01:15:10,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:10,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:15:10,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554500303] [2019-11-20 01:15:10,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:15:10,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:10,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:15:10,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:15:10,533 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 5 states. [2019-11-20 01:15:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:10,977 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-20 01:15:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:15:10,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-20 01:15:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:10,981 INFO L225 Difference]: With dead ends: 70 [2019-11-20 01:15:10,981 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 01:15:10,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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-20 01:15:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 01:15:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-20 01:15:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 01:15:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-11-20 01:15:10,987 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 11 [2019-11-20 01:15:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:10,988 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-11-20 01:15:10,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:15:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-11-20 01:15:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:15:10,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:10,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:11,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:11,190 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2136234004, now seen corresponding path program 1 times [2019-11-20 01:15:11,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:11,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1885434682] [2019-11-20 01:15:11,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:11,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:15:11,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:11,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 01:15:11,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:11,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:11,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:11,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:15:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:11,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:11,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885434682] [2019-11-20 01:15:11,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:11,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:15:11,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086294095] [2019-11-20 01:15:11,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:15:11,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:15:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:15:11,380 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 3 states. [2019-11-20 01:15:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:11,491 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-11-20 01:15:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:15:11,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 01:15:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:11,492 INFO L225 Difference]: With dead ends: 60 [2019-11-20 01:15:11,492 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 01:15:11,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:15:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 01:15:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-20 01:15:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 01:15:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-11-20 01:15:11,498 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 14 [2019-11-20 01:15:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:11,498 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-11-20 01:15:11,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:15:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-11-20 01:15:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:15:11,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:11,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:11,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:11,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2136234003, now seen corresponding path program 1 times [2019-11-20 01:15:11,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:11,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1605753646] [2019-11-20 01:15:11,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:11,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:15:11,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:11,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 01:15:11,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:11,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:11,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:11,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 01:15:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:11,884 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:11,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1605753646] [2019-11-20 01:15:11,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:11,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 01:15:11,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966174155] [2019-11-20 01:15:11,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:15:11,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:11,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:15:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:15:11,913 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 4 states. [2019-11-20 01:15:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:12,039 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-20 01:15:12,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:15:12,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 01:15:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:12,041 INFO L225 Difference]: With dead ends: 54 [2019-11-20 01:15:12,041 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 01:15:12,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:15:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 01:15:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-20 01:15:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 01:15:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-11-20 01:15:12,045 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 14 [2019-11-20 01:15:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:12,045 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-11-20 01:15:12,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:15:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-11-20 01:15:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 01:15:12,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:12,046 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:12,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:12,249 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1072491601, now seen corresponding path program 1 times [2019-11-20 01:15:12,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:12,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1407209040] [2019-11-20 01:15:12,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:12,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:15:12,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:12,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:12,451 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:15:12,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:12,492 INFO L567 ElimStorePlain]: treesize reduction 10, result has 71.4 percent of original size [2019-11-20 01:15:12,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:12,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:16 [2019-11-20 01:15:12,578 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-20 01:15:12,578 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:13,017 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-20 01:15:13,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1407209040] [2019-11-20 01:15:13,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:15:13,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 01:15:13,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538759728] [2019-11-20 01:15:13,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:15:13,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:13,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:15:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:15:13,019 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 10 states. [2019-11-20 01:15:13,877 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-20 01:15:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:14,388 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2019-11-20 01:15:14,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:15:14,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-20 01:15:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:14,391 INFO L225 Difference]: With dead ends: 68 [2019-11-20 01:15:14,391 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 01:15:14,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:15:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 01:15:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-11-20 01:15:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 01:15:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-11-20 01:15:14,397 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2019-11-20 01:15:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:14,397 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-20 01:15:14,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:15:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-11-20 01:15:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:15:14,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:14,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:14,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:14,601 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1713525782, now seen corresponding path program 1 times [2019-11-20 01:15:14,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:14,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [525282810] [2019-11-20 01:15:14,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:14,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:15:14,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:14,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:14,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525282810] [2019-11-20 01:15:14,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:14,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 01:15:14,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561293120] [2019-11-20 01:15:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:15:14,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:15:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:15:14,807 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2019-11-20 01:15:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:14,884 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-11-20 01:15:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:14,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-20 01:15:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:14,886 INFO L225 Difference]: With dead ends: 100 [2019-11-20 01:15:14,886 INFO L226 Difference]: Without dead ends: 96 [2019-11-20 01:15:14,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-20 01:15:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2019-11-20 01:15:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 01:15:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-11-20 01:15:14,899 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 22 [2019-11-20 01:15:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:14,899 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-11-20 01:15:14,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:15:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-11-20 01:15:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:15:14,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:14,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:15,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:15,107 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:15,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1007274638, now seen corresponding path program 1 times [2019-11-20 01:15:15,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:15,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1411907042] [2019-11-20 01:15:15,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:15,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:15:15,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:15,301 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:15:15,302 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:15,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:15,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:15,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:15,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-20 01:15:15,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:15,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 01:15:15,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:15,351 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 01:15:15,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:15,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 01:15:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:15,382 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1411907042] [2019-11-20 01:15:15,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-20 01:15:15,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971743045] [2019-11-20 01:15:15,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:15:15,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:15:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:15:15,403 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 7 states. [2019-11-20 01:15:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:15,667 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-20 01:15:15,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:15:15,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-20 01:15:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:15,668 INFO L225 Difference]: With dead ends: 61 [2019-11-20 01:15:15,668 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 01:15:15,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:15:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 01:15:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-20 01:15:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 01:15:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-11-20 01:15:15,673 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2019-11-20 01:15:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:15,673 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-11-20 01:15:15,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:15:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-11-20 01:15:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:15:15,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:15,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:15,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:15,877 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:15,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1007274639, now seen corresponding path program 1 times [2019-11-20 01:15:15,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:15,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2090467653] [2019-11-20 01:15:15,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:16,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 01:15:16,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:16,095 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:15:16,095 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:16,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:16,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:16,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:16,126 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:15:16,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:16,166 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.7 percent of original size [2019-11-20 01:15:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:16,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:16,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:22, output treesize:27 [2019-11-20 01:15:16,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:16,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-20 01:15:16,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:16,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:16,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:16,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 01:15:16,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:16,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:16,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:16,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-20 01:15:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:16,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:16,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:15:17,023 INFO L392 ElimStorePlain]: Different costs {2=[|#valid|], 3=[|#length|]} [2019-11-20 01:15:17,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:15:17,048 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 10 treesize of output 8 [2019-11-20 01:15:17,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:17,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:17,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:17,077 INFO L567 ElimStorePlain]: treesize reduction 5, result has 66.7 percent of original size [2019-11-20 01:15:17,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:17,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:27, output treesize:3 [2019-11-20 01:15:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:17,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2090467653] [2019-11-20 01:15:17,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:17,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-20 01:15:17,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787506774] [2019-11-20 01:15:17,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 01:15:17,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:15:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:15:17,134 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 16 states. [2019-11-20 01:15:18,230 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-20 01:15:18,879 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-11-20 01:15:19,510 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-11-20 01:15:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:22,860 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-11-20 01:15:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 01:15:22,861 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 01:15:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:22,861 INFO L225 Difference]: With dead ends: 103 [2019-11-20 01:15:22,862 INFO L226 Difference]: Without dead ends: 103 [2019-11-20 01:15:22,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:15:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-20 01:15:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2019-11-20 01:15:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 01:15:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-11-20 01:15:22,866 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 23 [2019-11-20 01:15:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:22,866 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-11-20 01:15:22,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 01:15:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-11-20 01:15:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 01:15:22,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:22,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:23,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:23,070 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1160742748, now seen corresponding path program 1 times [2019-11-20 01:15:23,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:23,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [487010990] [2019-11-20 01:15:23,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:23,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 01:15:23,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:23,271 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:15:23,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:23,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:23,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:11 [2019-11-20 01:15:23,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:23,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 60 [2019-11-20 01:15:23,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,363 INFO L567 ElimStorePlain]: treesize reduction 28, result has 36.4 percent of original size [2019-11-20 01:15:23,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:16 [2019-11-20 01:15:23,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 01:15:23,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:23,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-20 01:15:23,423 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 17 treesize of output 9 [2019-11-20 01:15:23,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:23,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:23,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:23,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-11-20 01:15:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:23,527 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:23,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [487010990] [2019-11-20 01:15:23,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:23,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 19 [2019-11-20 01:15:23,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414330968] [2019-11-20 01:15:23,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 01:15:23,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 01:15:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:15:23,775 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 20 states. [2019-11-20 01:15:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:24,528 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-11-20 01:15:24,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:15:24,528 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-11-20 01:15:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:24,529 INFO L225 Difference]: With dead ends: 69 [2019-11-20 01:15:24,529 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 01:15:24,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-11-20 01:15:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 01:15:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2019-11-20 01:15:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 01:15:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-11-20 01:15:24,533 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 24 [2019-11-20 01:15:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:24,533 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-11-20 01:15:24,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 01:15:24,533 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-11-20 01:15:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 01:15:24,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:24,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:24,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:24,737 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1160742749, now seen corresponding path program 1 times [2019-11-20 01:15:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:24,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1295874405] [2019-11-20 01:15:24,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:24,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 01:15:24,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:24,963 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_107|]} [2019-11-20 01:15:24,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:24,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:24,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:24,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:24,984 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 10 treesize of output 8 [2019-11-20 01:15:24,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:24,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:24,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:24,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-11-20 01:15:25,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:25,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 01:15:25,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,047 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-20 01:15:25,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:18 [2019-11-20 01:15:25,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:25,083 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 30 treesize of output 26 [2019-11-20 01:15:25,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,092 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 37 treesize of output 33 [2019-11-20 01:15:25,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:25,142 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 33 treesize of output 29 [2019-11-20 01:15:25,142 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,155 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 26 treesize of output 22 [2019-11-20 01:15:25,156 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:25,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:15:25,197 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:47 [2019-11-20 01:15:25,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:25,264 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 30 [2019-11-20 01:15:25,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,270 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 36 treesize of output 28 [2019-11-20 01:15:25,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:25,301 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 25 treesize of output 17 [2019-11-20 01:15:25,302 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,305 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 29 treesize of output 21 [2019-11-20 01:15:25,306 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:25,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:25,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 01:15:25,322 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:28 [2019-11-20 01:15:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:25,424 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:26,077 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 3=[|#length|]} [2019-11-20 01:15:26,089 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 10 treesize of output 8 [2019-11-20 01:15:26,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:26,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:26,110 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:15:26,111 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:26,148 INFO L567 ElimStorePlain]: treesize reduction 5, result has 66.7 percent of original size [2019-11-20 01:15:26,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:26,148 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:24, output treesize:3 [2019-11-20 01:15:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:26,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1295874405] [2019-11-20 01:15:26,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:26,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-20 01:15:26,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064310048] [2019-11-20 01:15:26,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:15:26,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:26,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:15:26,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:15:26,229 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 18 states. [2019-11-20 01:15:27,255 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-20 01:15:27,952 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 01:15:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:29,419 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2019-11-20 01:15:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 01:15:29,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-20 01:15:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:29,421 INFO L225 Difference]: With dead ends: 116 [2019-11-20 01:15:29,421 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 01:15:29,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2019-11-20 01:15:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 01:15:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 63. [2019-11-20 01:15:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 01:15:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-11-20 01:15:29,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 24 [2019-11-20 01:15:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:29,425 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-11-20 01:15:29,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:15:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-11-20 01:15:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:15:29,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:29,427 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:29,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:29,630 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash 373476277, now seen corresponding path program 2 times [2019-11-20 01:15:29,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:29,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1584313536] [2019-11-20 01:15:29,631 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:29,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:15:29,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:15:29,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:15:29,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:29,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:29,856 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:15:29,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:29,887 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 01:15:29,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:29,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-11-20 01:15:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:15:30,053 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:30,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:15:32,257 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-11-20 01:15:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:15:37,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1584313536] [2019-11-20 01:15:37,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:15:37,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-20 01:15:37,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906219181] [2019-11-20 01:15:37,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:15:37,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:15:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:15:37,477 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 12 states. [2019-11-20 01:15:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:39,369 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-11-20 01:15:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:15:39,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 01:15:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:39,371 INFO L225 Difference]: With dead ends: 66 [2019-11-20 01:15:39,371 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 01:15:39,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:15:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 01:15:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2019-11-20 01:15:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 01:15:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-20 01:15:39,373 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-11-20 01:15:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:39,374 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-20 01:15:39,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:15:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-20 01:15:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:15:39,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:39,375 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:39,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:39,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1621594032, now seen corresponding path program 1 times [2019-11-20 01:15:39,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:39,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1369337427] [2019-11-20 01:15:39,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:39,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:15:39,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:39,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:39,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369337427] [2019-11-20 01:15:39,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:39,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-20 01:15:39,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231870905] [2019-11-20 01:15:39,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:39,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:39,780 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-20 01:15:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:39,886 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-11-20 01:15:39,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:39,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-20 01:15:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:39,888 INFO L225 Difference]: With dead ends: 91 [2019-11-20 01:15:39,888 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 01:15:39,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 01:15:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2019-11-20 01:15:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 01:15:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-11-20 01:15:39,892 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 29 [2019-11-20 01:15:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:39,892 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-11-20 01:15:39,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-11-20 01:15:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:15:39,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:39,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:40,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:40,094 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1642616165, now seen corresponding path program 1 times [2019-11-20 01:15:40,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:40,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [214456388] [2019-11-20 01:15:40,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:40,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:15:40,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:40,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:40,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [214456388] [2019-11-20 01:15:40,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:40,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-20 01:15:40,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738012440] [2019-11-20 01:15:40,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:15:40,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:15:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:15:40,258 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 6 states. [2019-11-20 01:15:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:40,327 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-11-20 01:15:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:40,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-20 01:15:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:40,328 INFO L225 Difference]: With dead ends: 86 [2019-11-20 01:15:40,329 INFO L226 Difference]: Without dead ends: 86 [2019-11-20 01:15:40,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:15:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-20 01:15:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-11-20 01:15:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 01:15:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-11-20 01:15:40,332 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 29 [2019-11-20 01:15:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:40,333 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-11-20 01:15:40,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:15:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2019-11-20 01:15:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:15:40,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:40,334 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:40,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:40,536 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1402739314, now seen corresponding path program 1 times [2019-11-20 01:15:40,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:40,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [391130086] [2019-11-20 01:15:40,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:40,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 01:15:40,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:40,803 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:15:40,803 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:40,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:40,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:40,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-20 01:15:40,853 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-20 01:15:40,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:40,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-20 01:15:40,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:40,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-20 01:15:40,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:40,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-11-20 01:15:40,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 01:15:40,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:40,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:40,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2019-11-20 01:15:41,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 01:15:41,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:41,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:41,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:41,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2019-11-20 01:15:41,067 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 17 treesize of output 9 [2019-11-20 01:15:41,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:41,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:41,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:41,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 01:15:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:41,087 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:41,151 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-20 01:15:41,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:41,155 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-20 01:15:41,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2019-11-20 01:15:41,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:41,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:41,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:41,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:18 [2019-11-20 01:15:44,119 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 160 treesize of output 152 [2019-11-20 01:15:44,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:15:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:44,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:44,224 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-20 01:15:44,224 INFO L567 ElimStorePlain]: treesize reduction 125, result has 22.4 percent of original size [2019-11-20 01:15:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:15:44,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 01:15:44,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:31 [2019-11-20 01:15:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:44,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [391130086] [2019-11-20 01:15:44,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:44,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 13] imperfect sequences [] total 21 [2019-11-20 01:15:44,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677678036] [2019-11-20 01:15:44,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 01:15:44,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 01:15:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=366, Unknown=1, NotChecked=0, Total=420 [2019-11-20 01:15:44,918 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 21 states. [2019-11-20 01:15:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:45,838 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-11-20 01:15:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:15:45,838 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-20 01:15:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:45,839 INFO L225 Difference]: With dead ends: 134 [2019-11-20 01:15:45,839 INFO L226 Difference]: Without dead ends: 134 [2019-11-20 01:15:45,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=120, Invalid=581, Unknown=1, NotChecked=0, Total=702 [2019-11-20 01:15:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-20 01:15:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2019-11-20 01:15:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 01:15:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2019-11-20 01:15:45,845 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2019-11-20 01:15:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:45,845 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2019-11-20 01:15:45,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 01:15:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2019-11-20 01:15:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:15:45,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:45,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:46,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,047 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1423761447, now seen corresponding path program 1 times [2019-11-20 01:15:46,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:46,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1342149070] [2019-11-20 01:15:46,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:46,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:15:46,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:46,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-20 01:15:46,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:46,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:46,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:46,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2019-11-20 01:15:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:46,275 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:46,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:46,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-11-20 01:15:46,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:46,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:46,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:46,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:46,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-11-20 01:15:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:46,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1342149070] [2019-11-20 01:15:46,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:46,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 01:15:46,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960782578] [2019-11-20 01:15:46,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:15:46,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:46,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:15:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:15:46,299 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 5 states. [2019-11-20 01:15:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:46,570 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-20 01:15:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:15:46,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-20 01:15:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:46,572 INFO L225 Difference]: With dead ends: 128 [2019-11-20 01:15:46,572 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 01:15:46,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:15:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 01:15:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-11-20 01:15:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-20 01:15:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-11-20 01:15:46,577 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 29 [2019-11-20 01:15:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:46,577 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-11-20 01:15:46,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:15:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-11-20 01:15:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:15:46,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:46,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:46,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,779 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1423761446, now seen corresponding path program 1 times [2019-11-20 01:15:46,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:46,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1019013654] [2019-11-20 01:15:46,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:46,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 01:15:46,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:47,008 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_67|], 1=[|v_#valid_137|]} [2019-11-20 01:15:47,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:47,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:47,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,037 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 10 treesize of output 8 [2019-11-20 01:15:47,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2019-11-20 01:15:47,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 32 [2019-11-20 01:15:47,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,136 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-20 01:15:47,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:22 [2019-11-20 01:15:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:47,188 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 34 treesize of output 30 [2019-11-20 01:15:47,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,196 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 39 treesize of output 35 [2019-11-20 01:15:47,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,239 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 30 treesize of output 26 [2019-11-20 01:15:47,240 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,246 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 35 treesize of output 31 [2019-11-20 01:15:47,246 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:15:47,293 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:55 [2019-11-20 01:15:47,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:47,393 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 32 [2019-11-20 01:15:47,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,398 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 42 treesize of output 34 [2019-11-20 01:15:47,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,437 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 29 treesize of output 21 [2019-11-20 01:15:47,437 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,441 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 31 treesize of output 23 [2019-11-20 01:15:47,442 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:47,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:47,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 01:15:47,467 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:34 [2019-11-20 01:15:47,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:47,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:47,946 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:49,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:50,131 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2019-11-20 01:15:50,368 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 3=[|#length|]} [2019-11-20 01:15:50,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:50,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:50,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:50,373 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 01:15:50,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:50,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:1 [2019-11-20 01:15:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:50,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1019013654] [2019-11-20 01:15:50,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:15:50,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 24 [2019-11-20 01:15:50,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262961030] [2019-11-20 01:15:50,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 01:15:50,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:15:50,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 01:15:50,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:15:50,383 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 25 states. [2019-11-20 01:15:51,470 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-20 01:15:52,017 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 01:15:52,302 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 01:15:52,804 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-20 01:15:53,643 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-11-20 01:15:54,353 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-20 01:15:54,646 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-20 01:15:55,496 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 01:15:56,664 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 01:15:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:15:56,849 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2019-11-20 01:15:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 01:15:56,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-11-20 01:15:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:15:56,852 INFO L225 Difference]: With dead ends: 162 [2019-11-20 01:15:56,852 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 01:15:56,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=248, Invalid=1558, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 01:15:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 01:15:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2019-11-20 01:15:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 01:15:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2019-11-20 01:15:56,861 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 29 [2019-11-20 01:15:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:15:56,861 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2019-11-20 01:15:56,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 01:15:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2019-11-20 01:15:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:15:56,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:15:56,863 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:15:57,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:57,066 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:15:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:15:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1086789648, now seen corresponding path program 1 times [2019-11-20 01:15:57,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:15:57,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1732711276] [2019-11-20 01:15:57,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:15:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:15:57,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 01:15:57,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:15:57,328 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,328 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:15:57,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,371 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2019-11-20 01:15:57,384 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:15:57,384 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:15:57,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:15:57,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:57,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:34 [2019-11-20 01:15:57,477 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-20 01:15:57,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,527 INFO L567 ElimStorePlain]: treesize reduction 18, result has 69.0 percent of original size [2019-11-20 01:15:57,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:40 [2019-11-20 01:15:57,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:57,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-11-20 01:15:57,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:57,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 01:15:57,626 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,644 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:39 [2019-11-20 01:15:57,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:57,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 01:15:57,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2019-11-20 01:15:57,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:15:57,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 01:15:57,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:57,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:57,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:57,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:38 [2019-11-20 01:15:58,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:15:58,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-20 01:15:58,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:58,091 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.6 percent of original size [2019-11-20 01:15:58,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:58,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:31 [2019-11-20 01:15:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:15:58,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:15:58,795 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-20 01:15:58,801 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:58,811 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:15:58,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:58,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 01:15:58,898 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:122, output treesize:98 [2019-11-20 01:15:59,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:15:59,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:59,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:59,686 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:15:59,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:15:59,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 01:15:59,770 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:146, output treesize:98 [2019-11-20 01:15:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:16:02,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:16:02,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:16:02,420 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 48 treesize of output 44 [2019-11-20 01:16:02,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:02,830 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-20 01:16:02,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:02,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:16:02,882 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 71 treesize of output 67 [2019-11-20 01:16:02,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:03,285 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-20 01:16:03,285 INFO L567 ElimStorePlain]: treesize reduction 7, result has 96.1 percent of original size [2019-11-20 01:16:03,316 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 211 treesize of output 203 [2019-11-20 01:16:03,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:16:03,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:03,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:03,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:03,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:03,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:03,324 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:03,798 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-11-20 01:16:03,798 INFO L567 ElimStorePlain]: treesize reduction 403, result has 25.4 percent of original size [2019-11-20 01:16:03,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 01:16:03,799 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:248, output treesize:137 [2019-11-20 01:16:04,244 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 01:16:04,750 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 01:16:04,754 INFO L392 ElimStorePlain]: Different costs {2=[|#valid|], 3=[|#length|]} [2019-11-20 01:16:04,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:16:04,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:16:04,761 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-20 01:16:04,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:04,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:04,762 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-20 01:16:04,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:04,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:62, output treesize:1 [2019-11-20 01:16:04,771 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-20 01:16:04,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1732711276] [2019-11-20 01:16:04,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:16:04,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2019-11-20 01:16:04,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342650902] [2019-11-20 01:16:04,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:16:04,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:16:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:16:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=520, Unknown=1, NotChecked=0, Total=600 [2019-11-20 01:16:04,772 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand 13 states. [2019-11-20 01:16:06,173 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-11-20 01:16:06,452 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-20 01:16:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:07,015 INFO L93 Difference]: Finished difference Result 214 states and 238 transitions. [2019-11-20 01:16:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:16:07,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-11-20 01:16:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:07,017 INFO L225 Difference]: With dead ends: 214 [2019-11-20 01:16:07,018 INFO L226 Difference]: Without dead ends: 214 [2019-11-20 01:16:07,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=161, Invalid=830, Unknown=1, NotChecked=0, Total=992 [2019-11-20 01:16:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-20 01:16:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 153. [2019-11-20 01:16:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-20 01:16:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2019-11-20 01:16:07,041 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 29 [2019-11-20 01:16:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:07,041 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2019-11-20 01:16:07,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:16:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2019-11-20 01:16:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 01:16:07,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:07,043 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:07,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:07,246 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:16:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:07,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1469177709, now seen corresponding path program 1 times [2019-11-20 01:16:07,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:16:07,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1386906606] [2019-11-20 01:16:07,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:07,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 01:16:07,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:07,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:07,504 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 01:16:07,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:07,554 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-20 01:16:07,568 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 01:16:07,568 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 01:16:07,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:07,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:16:07,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:16:07,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-11-20 01:16:07,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:16:07,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2019-11-20 01:16:07,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:07,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:07,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:16:07,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 01:16:07,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:07,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:07,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:16:07,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2019-11-20 01:16:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:08,091 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:16:08,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:16:10,359 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 01:16:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:10,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1386906606] [2019-11-20 01:16:10,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:16:10,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-20 01:16:10,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933693437] [2019-11-20 01:16:10,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 01:16:10,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:16:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 01:16:10,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-20 01:16:10,374 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand 24 states. [2019-11-20 01:16:13,168 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-11-20 01:16:14,087 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-11-20 01:16:15,661 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-20 01:16:17,373 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-11-20 01:16:18,662 WARN L191 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-11-20 01:16:20,181 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-20 01:16:31,098 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-20 01:16:31,577 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 01:16:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:16:34,296 INFO L93 Difference]: Finished difference Result 297 states and 336 transitions. [2019-11-20 01:16:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-20 01:16:34,297 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-11-20 01:16:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:16:34,298 INFO L225 Difference]: With dead ends: 297 [2019-11-20 01:16:34,298 INFO L226 Difference]: Without dead ends: 297 [2019-11-20 01:16:34,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=442, Invalid=1910, Unknown=0, NotChecked=0, Total=2352 [2019-11-20 01:16:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-20 01:16:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 212. [2019-11-20 01:16:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-20 01:16:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2019-11-20 01:16:34,307 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 33 [2019-11-20 01:16:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:16:34,307 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2019-11-20 01:16:34,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 01:16:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2019-11-20 01:16:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:16:34,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:16:34,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:16:34,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:34,512 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION]=== [2019-11-20 01:16:34,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:16:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2034549005, now seen corresponding path program 1 times [2019-11-20 01:16:34,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:16:34,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [114409974] [2019-11-20 01:16:34,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f7b4aade-a6ef-48f2-b640-6362e0d3d489/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:16:34,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-20 01:16:34,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:16:34,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 01:16:34,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:34,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:34,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:34,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 01:16:34,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 01:16:34,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:34,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:34,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:34,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-20 01:16:34,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 01:16:34,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:16:34,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:16:34,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:16:34,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2019-11-20 01:16:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:16:43,078 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:16:47,694 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 01:16:47,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:16:47,902 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:16:47,905 INFO L168 Benchmark]: Toolchain (without parser) took 102430.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.8 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -334.7 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:47,905 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:16:47,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:47,905 INFO L168 Benchmark]: Boogie Preprocessor took 61.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:16:47,906 INFO L168 Benchmark]: RCFGBuilder took 903.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:47,906 INFO L168 Benchmark]: TraceAbstraction took 100927.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -217.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-11-20 01:16:47,907 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.54 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.20 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 903.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100927.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -217.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...