./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:05:05,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:05:05,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:05:05,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:05:05,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:05:05,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:05:05,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:05:05,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:05:05,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:05:05,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:05:05,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:05:05,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:05:05,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:05:05,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:05:05,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:05:05,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:05:05,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:05:05,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:05:05,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:05:05,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:05:05,272 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:05:05,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:05:05,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:05:05,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:05:05,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:05:05,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:05:05,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:05:05,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:05:05,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:05:05,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:05:05,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:05:05,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:05:05,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:05:05,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:05:05,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:05:05,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:05:05,278 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 19:05:05,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:05:05,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:05:05,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:05:05,286 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:05:05,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:05:05,286 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:05:05,286 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:05:05,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 19:05:05,287 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 19:05:05,288 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 19:05:05,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:05:05,288 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:05:05,288 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:05:05,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:05:05,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:05:05,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:05:05,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:05:05,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:05:05,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:05:05,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:05:05,289 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:05:05,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:05:05,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2018-12-01 19:05:05,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:05:05,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:05:05,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:05:05,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:05:05,315 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:05:05,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 19:05:05,349 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/d793fe0dd/62d59491e53c4c04a3a16c9ebfc50135/FLAG48024ac68 [2018-12-01 19:05:05,756 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:05:05,757 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 19:05:05,763 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/d793fe0dd/62d59491e53c4c04a3a16c9ebfc50135/FLAG48024ac68 [2018-12-01 19:05:05,772 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/d793fe0dd/62d59491e53c4c04a3a16c9ebfc50135 [2018-12-01 19:05:05,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:05:05,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 19:05:05,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:05:05,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:05:05,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:05:05,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:05:05" (1/1) ... [2018-12-01 19:05:05,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:05, skipping insertion in model container [2018-12-01 19:05:05,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:05:05" (1/1) ... [2018-12-01 19:05:05,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:05:05,806 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:05:05,952 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:05:05,958 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:05:05,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:05:06,021 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:05:06,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06 WrapperNode [2018-12-01 19:05:06,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:05:06,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:05:06,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:05:06,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:05:06,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... [2018-12-01 19:05:06,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:05:06,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:05:06,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:05:06,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:05:06,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:06,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 19:05:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:05:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 19:05:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 19:05:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-12-01 19:05:06,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 19:05:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 19:05:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 19:05:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 19:05:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 19:05:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 19:05:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 19:05:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 19:05:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 19:05:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 19:05:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 19:05:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 19:05:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 19:05:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 19:05:06,127 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 19:05:06,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:05:06,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:05:06,333 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-01 19:05:06,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:05:06 BoogieIcfgContainer [2018-12-01 19:05:06,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:05:06,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:05:06,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:05:06,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:05:06,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:05:05" (1/3) ... [2018-12-01 19:05:06,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7857c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:05:06, skipping insertion in model container [2018-12-01 19:05:06,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:06" (2/3) ... [2018-12-01 19:05:06,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7857c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:05:06, skipping insertion in model container [2018-12-01 19:05:06,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:05:06" (3/3) ... [2018-12-01 19:05:06,339 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 19:05:06,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:05:06,349 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-01 19:05:06,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-01 19:05:06,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:05:06,374 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:05:06,374 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 19:05:06,374 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:05:06,374 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:05:06,374 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:05:06,375 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:05:06,375 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:05:06,375 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:05:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-01 19:05:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 19:05:06,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2018-12-01 19:05:06,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 19:05:06,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:05:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:05:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:06,507 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-01 19:05:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:06,537 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-01 19:05:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:05:06,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-01 19:05:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:06,543 INFO L225 Difference]: With dead ends: 36 [2018-12-01 19:05:06,544 INFO L226 Difference]: Without dead ends: 33 [2018-12-01 19:05:06,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-01 19:05:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-01 19:05:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 19:05:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-01 19:05:06,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-12-01 19:05:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:06,566 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-01 19:05:06,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:05:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-01 19:05:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 19:05:06,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2018-12-01 19:05:06,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:06,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:06,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:06,610 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-12-01 19:05:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:06,624 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-01 19:05:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:06,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-01 19:05:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:06,625 INFO L225 Difference]: With dead ends: 32 [2018-12-01 19:05:06,625 INFO L226 Difference]: Without dead ends: 32 [2018-12-01 19:05:06,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-01 19:05:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-01 19:05:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 19:05:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-01 19:05:06,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2018-12-01 19:05:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:06,628 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-01 19:05:06,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 19:05:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 19:05:06,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,629 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2018-12-01 19:05:06,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 19:05:06,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:05:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:05:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:06,648 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-12-01 19:05:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:06,660 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-01 19:05:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:05:06,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 19:05:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:06,661 INFO L225 Difference]: With dead ends: 31 [2018-12-01 19:05:06,661 INFO L226 Difference]: Without dead ends: 31 [2018-12-01 19:05:06,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-01 19:05:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-01 19:05:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 19:05:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-01 19:05:06,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-12-01 19:05:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:06,664 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-01 19:05:06,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:05:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 19:05:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 19:05:06,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,664 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2018-12-01 19:05:06,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:06,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:06,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:06,707 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-12-01 19:05:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:06,719 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-01 19:05:06,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:06,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 19:05:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:06,720 INFO L225 Difference]: With dead ends: 30 [2018-12-01 19:05:06,720 INFO L226 Difference]: Without dead ends: 30 [2018-12-01 19:05:06,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-01 19:05:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-01 19:05:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 19:05:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-01 19:05:06,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-12-01 19:05:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:06,724 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-01 19:05:06,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-01 19:05:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 19:05:06,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,725 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2018-12-01 19:05:06,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:05:06,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:05:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:05:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:05:06,767 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-12-01 19:05:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:06,813 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-01 19:05:06,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:05:06,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-01 19:05:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:06,814 INFO L225 Difference]: With dead ends: 29 [2018-12-01 19:05:06,814 INFO L226 Difference]: Without dead ends: 29 [2018-12-01 19:05:06,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-01 19:05:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-01 19:05:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-01 19:05:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-01 19:05:06,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-12-01 19:05:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:06,817 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-01 19:05:06,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:05:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-01 19:05:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 19:05:06,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2018-12-01 19:05:06,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:05:06,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:05:06,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:05:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:06,884 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-12-01 19:05:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:06,943 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-01 19:05:06,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:05:06,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-01 19:05:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:06,944 INFO L225 Difference]: With dead ends: 32 [2018-12-01 19:05:06,944 INFO L226 Difference]: Without dead ends: 32 [2018-12-01 19:05:06,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:05:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-01 19:05:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-01 19:05:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 19:05:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-01 19:05:06,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2018-12-01 19:05:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:06,947 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-01 19:05:06,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:05:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 19:05:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:05:06,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:06,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:06,948 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:06,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2018-12-01 19:05:06,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:06,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:06,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:06,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:06,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:05:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:05:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:05:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:05:06,978 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-12-01 19:05:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:07,033 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-01 19:05:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:05:07,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-01 19:05:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:07,034 INFO L225 Difference]: With dead ends: 31 [2018-12-01 19:05:07,034 INFO L226 Difference]: Without dead ends: 31 [2018-12-01 19:05:07,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-01 19:05:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-01 19:05:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-01 19:05:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 19:05:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-01 19:05:07,036 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-01 19:05:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:07,036 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-01 19:05:07,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:05:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-01 19:05:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:05:07,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:07,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:07,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:07,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2018-12-01 19:05:07,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:07,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:07,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 19:05:07,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 19:05:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 19:05:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:05:07,097 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2018-12-01 19:05:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:07,173 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-01 19:05:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:05:07,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-01 19:05:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:07,174 INFO L225 Difference]: With dead ends: 34 [2018-12-01 19:05:07,174 INFO L226 Difference]: Without dead ends: 34 [2018-12-01 19:05:07,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:05:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-01 19:05:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-01 19:05:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 19:05:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-01 19:05:07,176 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-12-01 19:05:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:07,176 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-01 19:05:07,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 19:05:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 19:05:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:07,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:07,177 INFO L402 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] [2018-12-01 19:05:07,177 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:07,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2018-12-01 19:05:07,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:07,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:07,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:07,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:07,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:07,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 19:05:07,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 19:05:07,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 19:05:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:05:07,287 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2018-12-01 19:05:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:07,396 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-01 19:05:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 19:05:07,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-01 19:05:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:07,397 INFO L225 Difference]: With dead ends: 56 [2018-12-01 19:05:07,397 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 19:05:07,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-01 19:05:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 19:05:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-01 19:05:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 19:05:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-01 19:05:07,400 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-12-01 19:05:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:07,400 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-01 19:05:07,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 19:05:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-01 19:05:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:07,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:07,401 INFO L402 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] [2018-12-01 19:05:07,401 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:07,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2018-12-01 19:05:07,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:07,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:07,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 19:05:07,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 19:05:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 19:05:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:05:07,492 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-12-01 19:05:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:07,632 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-01 19:05:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 19:05:07,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-01 19:05:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:07,634 INFO L225 Difference]: With dead ends: 94 [2018-12-01 19:05:07,634 INFO L226 Difference]: Without dead ends: 93 [2018-12-01 19:05:07,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-01 19:05:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-01 19:05:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-12-01 19:05:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-01 19:05:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-01 19:05:07,638 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-12-01 19:05:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:07,638 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-01 19:05:07,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 19:05:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-01 19:05:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:07,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:07,639 INFO L402 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] [2018-12-01 19:05:07,639 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:07,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2018-12-01 19:05:07,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:07,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:07,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:07,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:05:07,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:05:07,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:07,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:07,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-01 19:05:07,841 INFO L478 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 11 treesize of output 10 [2018-12-01 19:05:07,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:07,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:07,851 INFO L267 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. [2018-12-01 19:05:07,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-01 19:05:07,999 INFO L478 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 20 treesize of output 16 [2018-12-01 19:05:08,006 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 19:05:08,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:08,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:08,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:08,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-01 19:05:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:08,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:05:08,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-01 19:05:08,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 19:05:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 19:05:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-12-01 19:05:08,089 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 20 states. [2018-12-01 19:05:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:10,079 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-12-01 19:05:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 19:05:10,079 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-01 19:05:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:10,080 INFO L225 Difference]: With dead ends: 122 [2018-12-01 19:05:10,080 INFO L226 Difference]: Without dead ends: 122 [2018-12-01 19:05:10,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2018-12-01 19:05:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-01 19:05:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 91. [2018-12-01 19:05:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 19:05:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-01 19:05:10,085 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2018-12-01 19:05:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:10,085 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-01 19:05:10,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 19:05:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-01 19:05:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:10,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:10,086 INFO L402 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] [2018-12-01 19:05:10,086 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:10,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2018-12-01 19:05:10,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:10,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:10,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:05:10,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:05:10,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:10,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:10,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:05:10,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-01 19:05:10,317 INFO L478 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 14 treesize of output 11 [2018-12-01 19:05:10,319 INFO L478 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 11 treesize of output 10 [2018-12-01 19:05:10,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,325 INFO L267 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. [2018-12-01 19:05:10,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-01 19:05:10,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-01 19:05:10,347 INFO L478 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 11 treesize of output 10 [2018-12-01 19:05:10,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:10,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-01 19:05:10,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-01 19:05:10,472 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-01 19:05:10,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:10,480 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 19:05:10,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:10,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:10,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:10,492 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-01 19:05:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:10,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:05:10,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-12-01 19:05:10,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-01 19:05:10,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-01 19:05:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-01 19:05:10,584 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2018-12-01 19:05:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:11,564 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-12-01 19:05:11,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 19:05:11,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-12-01 19:05:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:11,565 INFO L225 Difference]: With dead ends: 121 [2018-12-01 19:05:11,565 INFO L226 Difference]: Without dead ends: 121 [2018-12-01 19:05:11,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2018-12-01 19:05:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-01 19:05:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-12-01 19:05:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-01 19:05:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-12-01 19:05:11,569 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2018-12-01 19:05:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-12-01 19:05:11,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-01 19:05:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-12-01 19:05:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 19:05:11,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:11,570 INFO L402 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] [2018-12-01 19:05:11,570 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:11,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2018-12-01 19:05:11,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:11,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:11,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:11,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:11,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:11,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:11,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:11,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:11,610 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 4 states. [2018-12-01 19:05:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:11,630 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-12-01 19:05:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:11,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-01 19:05:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:11,631 INFO L225 Difference]: With dead ends: 113 [2018-12-01 19:05:11,631 INFO L226 Difference]: Without dead ends: 91 [2018-12-01 19:05:11,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-01 19:05:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-01 19:05:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 19:05:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-12-01 19:05:11,633 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-12-01 19:05:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:11,633 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-12-01 19:05:11,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-12-01 19:05:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 19:05:11,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:11,634 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:11,634 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:11,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2018-12-01 19:05:11,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:11,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:11,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:05:11,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:05:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 19:05:11,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 19:05:11,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:05:11,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:11,833 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:11,839 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:11,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:11,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:11,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:11,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-01 19:05:11,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 19:05:11,871 INFO L478 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 13 treesize of output 12 [2018-12-01 19:05:11,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:11,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:11,875 INFO L267 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. [2018-12-01 19:05:11,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-01 19:05:12,023 INFO L478 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 22 treesize of output 18 [2018-12-01 19:05:12,028 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 19:05:12,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:12,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:12,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:12,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-01 19:05:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:12,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:05:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-01 19:05:12,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-01 19:05:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-01 19:05:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-12-01 19:05:12,120 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 24 states. [2018-12-01 19:05:12,626 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-12-01 19:05:12,960 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-01 19:05:13,270 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-12-01 19:05:13,496 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-12-01 19:05:13,796 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-01 19:05:14,145 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-12-01 19:05:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:14,367 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-12-01 19:05:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 19:05:14,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-01 19:05:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:14,368 INFO L225 Difference]: With dead ends: 102 [2018-12-01 19:05:14,368 INFO L226 Difference]: Without dead ends: 79 [2018-12-01 19:05:14,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 19:05:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-01 19:05:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2018-12-01 19:05:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-01 19:05:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-01 19:05:14,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 28 [2018-12-01 19:05:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:14,372 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-01 19:05:14,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-01 19:05:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-01 19:05:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 19:05:14,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:14,373 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:14,373 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-01 19:05:14,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2018-12-01 19:05:14,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:05:14,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:05:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:14,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:05:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:05:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:14,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:05:14,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:05:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 19:05:14,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 19:05:14,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:05:14,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:14,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:05:14,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,619 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:14,622 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:14,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,631 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-01 19:05:14,652 INFO L478 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 16 treesize of output 13 [2018-12-01 19:05:14,654 INFO L478 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 13 treesize of output 12 [2018-12-01 19:05:14,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,661 INFO L267 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. [2018-12-01 19:05:14,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-01 19:05:14,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-01 19:05:14,693 INFO L478 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 13 treesize of output 12 [2018-12-01 19:05:14,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:14,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-12-01 19:05:14,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-01 19:05:14,961 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-01 19:05:14,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:14,969 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-01 19:05:14,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:14,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:14,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:14,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-12-01 19:05:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:15,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:05:15,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-12-01 19:05:15,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-01 19:05:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-01 19:05:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-12-01 19:05:15,085 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 25 states. [2018-12-01 19:05:16,357 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-12-01 19:05:19,480 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-01 19:05:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:21,296 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-12-01 19:05:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-01 19:05:21,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-12-01 19:05:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:21,296 INFO L225 Difference]: With dead ends: 62 [2018-12-01 19:05:21,297 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 19:05:21,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=206, Invalid=1353, Unknown=1, NotChecked=0, Total=1560 [2018-12-01 19:05:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 19:05:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 19:05:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 19:05:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 19:05:21,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-01 19:05:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:21,297 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:05:21,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-01 19:05:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:05:21,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 19:05:21,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:05:21 BoogieIcfgContainer [2018-12-01 19:05:21,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:05:21,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:05:21,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:05:21,301 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:05:21,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:05:06" (3/4) ... [2018-12-01 19:05:21,303 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 19:05:21,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 19:05:21,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-12-01 19:05:21,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 19:05:21,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 19:05:21,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 19:05:21,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-01 19:05:21,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 19:05:21,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 19:05:21,331 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) 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) [2018-12-01 19:05:21,333 INFO L168 Benchmark]: Toolchain (without parser) took 15559.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-12-01 19:05:21,333 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:05:21,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 979.2 MB in the end (delta: -27.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-12-01 19:05:21,334 INFO L168 Benchmark]: Boogie Preprocessor took 62.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Free memory was 979.2 MB in the beginning and 1.0 GB in the end (delta: -51.7 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2018-12-01 19:05:21,334 INFO L168 Benchmark]: RCFGBuilder took 249.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.9 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-12-01 19:05:21,334 INFO L168 Benchmark]: TraceAbstraction took 14965.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 988.9 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:05:21,334 INFO L168 Benchmark]: Witness Printer took 31.84 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. [2018-12-01 19:05:21,335 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 979.2 MB in the end (delta: -27.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Free memory was 979.2 MB in the beginning and 1.0 GB in the end (delta: -51.7 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. * RCFGBuilder took 249.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.9 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14965.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 988.9 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Witness Printer took 31.84 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 14.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 642 SDslu, 1766 SDs, 0 SdLazy, 1771 SolverSat, 164 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 369 ConstructedInterpolants, 37 QuantifiedInterpolants, 98008 SizeOfPredicates, 57 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:05:22,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:05:22,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:05:22,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:05:22,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:05:22,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:05:22,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:05:22,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:05:22,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:05:22,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:05:22,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:05:22,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:05:22,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:05:22,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:05:22,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:05:22,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:05:22,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:05:22,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:05:22,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:05:22,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:05:22,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:05:22,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:05:22,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:05:22,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:05:22,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:05:22,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:05:22,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:05:22,592 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:05:22,593 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:05:22,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:05:22,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:05:22,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:05:22,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:05:22,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:05:22,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:05:22,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:05:22,595 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-01 19:05:22,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:05:22,603 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:05:22,604 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:05:22,604 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:05:22,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:05:22,605 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:05:22,605 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:05:22,605 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:05:22,605 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 19:05:22,606 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 19:05:22,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:05:22,607 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 19:05:22,607 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 19:05:22,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:05:22,607 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:05:22,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:05:22,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:05:22,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:05:22,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:05:22,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:05:22,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:05:22,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:05:22,608 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-01 19:05:22,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:05:22,609 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 19:05:22,609 INFO L133 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/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2018-12-01 19:05:22,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:05:22,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:05:22,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:05:22,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:05:22,642 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:05:22,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 19:05:22,677 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/338bf6c7c/88155dd32be54f079946547e9edcdfba/FLAGe959763fc [2018-12-01 19:05:23,091 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:05:23,091 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 19:05:23,097 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/338bf6c7c/88155dd32be54f079946547e9edcdfba/FLAGe959763fc [2018-12-01 19:05:23,106 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/uautomizer/data/338bf6c7c/88155dd32be54f079946547e9edcdfba [2018-12-01 19:05:23,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:05:23,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 19:05:23,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:05:23,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:05:23,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:05:23,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9983a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23, skipping insertion in model container [2018-12-01 19:05:23,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:05:23,135 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:05:23,285 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:05:23,295 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:05:23,354 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:05:23,376 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:05:23,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23 WrapperNode [2018-12-01 19:05:23,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:05:23,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:05:23,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:05:23,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:05:23,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... [2018-12-01 19:05:23,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:05:23,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:05:23,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:05:23,408 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:05:23,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 19:05:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:05:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 19:05:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 19:05:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-12-01 19:05:23,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 19:05:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 19:05:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 19:05:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 19:05:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 19:05:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 19:05:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 19:05:23,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 19:05:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 19:05:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 19:05:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 19:05:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:05:23,686 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:05:23,687 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-01 19:05:23,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:05:23 BoogieIcfgContainer [2018-12-01 19:05:23,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:05:23,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:05:23,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:05:23,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:05:23,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:05:23" (1/3) ... [2018-12-01 19:05:23,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:05:23, skipping insertion in model container [2018-12-01 19:05:23,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:05:23" (2/3) ... [2018-12-01 19:05:23,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c4ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:05:23, skipping insertion in model container [2018-12-01 19:05:23,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:05:23" (3/3) ... [2018-12-01 19:05:23,693 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 19:05:23,698 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:05:23,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-01 19:05:23,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-01 19:05:23,730 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:05:23,730 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:05:23,730 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 19:05:23,730 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:05:23,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:05:23,731 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:05:23,731 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:05:23,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:05:23,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:05:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-01 19:05:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 19:05:23,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:23,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:23,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:23,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2018-12-01 19:05:23,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:23,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:23,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:23,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:05:23,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-01 19:05:23,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-01 19:05:23,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:23,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:23,869 INFO L267 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. [2018-12-01 19:05:23,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-01 19:05:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:23,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:23,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:23,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 19:05:23,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:05:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:05:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:23,896 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-01 19:05:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:23,945 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-01 19:05:23,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:05:23,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-01 19:05:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:23,952 INFO L225 Difference]: With dead ends: 36 [2018-12-01 19:05:23,952 INFO L226 Difference]: Without dead ends: 33 [2018-12-01 19:05:23,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-01 19:05:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-01 19:05:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 19:05:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-01 19:05:23,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-12-01 19:05:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:23,974 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-01 19:05:23,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:05:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-01 19:05:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 19:05:23,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:23,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:23,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:23,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2018-12-01 19:05:23,975 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:23,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:05:24,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,064 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:24,071 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:24,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,090 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-12-01 19:05:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:24,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,101 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-12-01 19:05:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:24,137 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-01 19:05:24,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:24,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-01 19:05:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:24,139 INFO L225 Difference]: With dead ends: 43 [2018-12-01 19:05:24,140 INFO L226 Difference]: Without dead ends: 43 [2018-12-01 19:05:24,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-01 19:05:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-12-01 19:05:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-01 19:05:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-01 19:05:24,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2018-12-01 19:05:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:24,146 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-01 19:05:24,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-01 19:05:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 19:05:24,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:24,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:24,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:24,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1757911265, now seen corresponding path program 1 times [2018-12-01 19:05:24,147 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:24,147 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:24,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,225 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:24,231 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:24,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:05:24,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,281 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2018-12-01 19:05:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:24,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:24,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,298 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-12-01 19:05:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:24,325 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-01 19:05:24,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:24,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-01 19:05:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:24,326 INFO L225 Difference]: With dead ends: 35 [2018-12-01 19:05:24,326 INFO L226 Difference]: Without dead ends: 35 [2018-12-01 19:05:24,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-01 19:05:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-01 19:05:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 19:05:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-01 19:05:24,328 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2018-12-01 19:05:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:24,329 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-01 19:05:24,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 19:05:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 19:05:24,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:24,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:24,329 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:24,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2018-12-01 19:05:24,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:24,330 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:24,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,372 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:24,375 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 19:05:24,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,389 INFO L267 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. [2018-12-01 19:05:24,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-01 19:05:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,399 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 19:05:24,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:05:24,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:05:24,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:24,401 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-12-01 19:05:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:24,431 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-01 19:05:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:05:24,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 19:05:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:24,432 INFO L225 Difference]: With dead ends: 31 [2018-12-01 19:05:24,432 INFO L226 Difference]: Without dead ends: 31 [2018-12-01 19:05:24,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:05:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-01 19:05:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-01 19:05:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 19:05:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-01 19:05:24,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-12-01 19:05:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:24,435 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-01 19:05:24,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:05:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 19:05:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 19:05:24,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:24,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:24,435 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:24,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2018-12-01 19:05:24,436 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:24,436 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:24,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,480 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:24,494 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:24,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:24,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:24,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2018-12-01 19:05:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,531 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:24,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:24,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:24,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,532 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-12-01 19:05:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:24,561 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-01 19:05:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:24,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 19:05:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:24,562 INFO L225 Difference]: With dead ends: 38 [2018-12-01 19:05:24,562 INFO L226 Difference]: Without dead ends: 38 [2018-12-01 19:05:24,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-01 19:05:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-01 19:05:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-01 19:05:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-12-01 19:05:24,565 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2018-12-01 19:05:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:24,565 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-12-01 19:05:24,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-12-01 19:05:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 19:05:24,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:24,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:24,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:24,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1341113132, now seen corresponding path program 1 times [2018-12-01 19:05:24,566 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:24,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,616 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:24,630 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:24,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:24,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:24,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:24,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-12-01 19:05:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:05:24,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:05:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:05:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,674 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-12-01 19:05:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:24,713 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-01 19:05:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:05:24,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 19:05:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:24,714 INFO L225 Difference]: With dead ends: 33 [2018-12-01 19:05:24,714 INFO L226 Difference]: Without dead ends: 33 [2018-12-01 19:05:24,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:05:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-01 19:05:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-01 19:05:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 19:05:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-01 19:05:24,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-12-01 19:05:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:24,716 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-01 19:05:24,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:05:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-01 19:05:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 19:05:24,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:24,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:24,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:24,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2018-12-01 19:05:24,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:24,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,788 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:05:24,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:05:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:05:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:05:24,790 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-12-01 19:05:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:24,869 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-01 19:05:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:05:24,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-01 19:05:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:24,870 INFO L225 Difference]: With dead ends: 29 [2018-12-01 19:05:24,870 INFO L226 Difference]: Without dead ends: 29 [2018-12-01 19:05:24,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-01 19:05:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-01 19:05:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-01 19:05:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-01 19:05:24,872 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-12-01 19:05:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:24,872 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-01 19:05:24,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:05:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-01 19:05:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 19:05:24,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:24,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:24,872 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:24,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2018-12-01 19:05:24,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:24,873 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:24,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:24,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:24,987 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:24,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:24,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:05:24,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:05:24,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:05:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:24,989 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-12-01 19:05:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:25,205 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-12-01 19:05:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:05:25,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-01 19:05:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:25,206 INFO L225 Difference]: With dead ends: 54 [2018-12-01 19:05:25,206 INFO L226 Difference]: Without dead ends: 54 [2018-12-01 19:05:25,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:05:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-01 19:05:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-12-01 19:05:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-01 19:05:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-12-01 19:05:25,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2018-12-01 19:05:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:25,210 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-12-01 19:05:25,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:05:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-12-01 19:05:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 19:05:25,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:25,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:25,210 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:25,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -636961778, now seen corresponding path program 1 times [2018-12-01 19:05:25,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:25,211 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:25,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:25,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:25,376 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:25,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:25,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:05:25,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:05:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:05:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:25,378 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2018-12-01 19:05:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:25,681 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-12-01 19:05:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:05:25,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-01 19:05:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:25,684 INFO L225 Difference]: With dead ends: 51 [2018-12-01 19:05:25,684 INFO L226 Difference]: Without dead ends: 51 [2018-12-01 19:05:25,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:05:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-01 19:05:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-12-01 19:05:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 19:05:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-01 19:05:25,687 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2018-12-01 19:05:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:25,687 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-01 19:05:25,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:05:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 19:05:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:05:25,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:25,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:25,688 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:25,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2018-12-01 19:05:25,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:25,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:25,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:25,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:25,752 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:25,757 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 19:05:25,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:25,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:25,766 INFO L267 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. [2018-12-01 19:05:25,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-01 19:05:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:25,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:25,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:25,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:05:25,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:05:25,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:05:25,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:05:25,798 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2018-12-01 19:05:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:25,916 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-01 19:05:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:05:25,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-01 19:05:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:25,916 INFO L225 Difference]: With dead ends: 31 [2018-12-01 19:05:25,916 INFO L226 Difference]: Without dead ends: 31 [2018-12-01 19:05:25,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-01 19:05:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-01 19:05:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-01 19:05:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 19:05:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-01 19:05:25,918 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2018-12-01 19:05:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:25,918 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-01 19:05:25,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:05:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-01 19:05:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:05:25,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:25,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:25,919 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:25,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2018-12-01 19:05:25,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:25,919 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:25,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:25,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:25,980 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:25,992 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:25,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:26,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:26,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-01 19:05:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:26,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:26,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:26,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:05:26,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:05:26,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:05:26,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:26,060 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-12-01 19:05:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:26,240 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-01 19:05:26,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:05:26,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-01 19:05:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:26,242 INFO L225 Difference]: With dead ends: 56 [2018-12-01 19:05:26,242 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 19:05:26,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:05:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 19:05:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-12-01 19:05:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 19:05:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-01 19:05:26,245 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2018-12-01 19:05:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:26,245 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-01 19:05:26,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:05:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-01 19:05:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 19:05:26,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:26,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:05:26,246 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:26,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash -119935261, now seen corresponding path program 1 times [2018-12-01 19:05:26,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:26,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:26,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:26,313 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:26,325 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:26,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:26,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:26,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2018-12-01 19:05:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:26,420 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:26,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:26,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:05:26,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 19:05:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 19:05:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:05:26,422 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 8 states. [2018-12-01 19:05:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:26,633 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-12-01 19:05:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:05:26,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-01 19:05:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:26,635 INFO L225 Difference]: With dead ends: 55 [2018-12-01 19:05:26,635 INFO L226 Difference]: Without dead ends: 55 [2018-12-01 19:05:26,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:05:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-01 19:05:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-12-01 19:05:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 19:05:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-01 19:05:26,637 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2018-12-01 19:05:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:26,637 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-01 19:05:26,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 19:05:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 19:05:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:26,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:26,638 INFO L402 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] [2018-12-01 19:05:26,638 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:26,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2018-12-01 19:05:26,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:26,639 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:26,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:26,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:26,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:05:26,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-01 19:05:26,750 INFO L478 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 12 treesize of output 9 [2018-12-01 19:05:26,751 INFO L478 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 9 treesize of output 8 [2018-12-01 19:05:26,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-01 19:05:26,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-01 19:05:26,782 INFO L478 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 12 treesize of output 11 [2018-12-01 19:05:26,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:26,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2018-12-01 19:05:26,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-01 19:05:26,922 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-01 19:05:26,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,927 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 19:05:26,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:26,931 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-12-01 19:05:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:26,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:26,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:26,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 19:05:26,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 19:05:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 19:05:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:05:26,979 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2018-12-01 19:05:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:27,709 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-01 19:05:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 19:05:27,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-01 19:05:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:27,710 INFO L225 Difference]: With dead ends: 56 [2018-12-01 19:05:27,710 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 19:05:27,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-12-01 19:05:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 19:05:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-01 19:05:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-01 19:05:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-01 19:05:27,715 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-12-01 19:05:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:27,716 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-01 19:05:27,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 19:05:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-01 19:05:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:27,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:27,717 INFO L402 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] [2018-12-01 19:05:27,717 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:27,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2018-12-01 19:05:27,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:27,718 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:27,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:27,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:27,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-01 19:05:27,819 INFO L478 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 9 treesize of output 8 [2018-12-01 19:05:27,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:27,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:27,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:27,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-01 19:05:27,872 INFO L478 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 13 [2018-12-01 19:05:27,874 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 19:05:27,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:27,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:27,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:27,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-01 19:05:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:27,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:27,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:27,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 19:05:27,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 19:05:27,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 19:05:27,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:05:27,896 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-12-01 19:05:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:28,238 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-01 19:05:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 19:05:28,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-01 19:05:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:28,239 INFO L225 Difference]: With dead ends: 94 [2018-12-01 19:05:28,239 INFO L226 Difference]: Without dead ends: 93 [2018-12-01 19:05:28,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-01 19:05:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-01 19:05:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-12-01 19:05:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-01 19:05:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-12-01 19:05:28,244 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-12-01 19:05:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:28,244 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-12-01 19:05:28,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 19:05:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-12-01 19:05:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:28,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:28,244 INFO L402 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] [2018-12-01 19:05:28,245 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:28,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2018-12-01 19:05:28,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:28,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:28,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:28,324 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:05:28,339 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:05:28,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:05:28,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:28,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:28,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-12-01 19:05:28,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 19:05:28,384 INFO L478 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 14 treesize of output 13 [2018-12-01 19:05:28,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:28,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:28,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:28,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2018-12-01 19:05:28,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-01 19:05:28,600 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-12-01 19:05:28,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:28,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:28,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:28,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:38 [2018-12-01 19:05:28,803 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-01 19:05:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:28,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:05:29,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-12-01 19:05:29,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-01 19:05:29,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:29,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:29,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-12-01 19:05:30,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-01 19:05:30,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:30,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:30,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-01 19:05:30,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-01 19:05:30,090 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:30,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:30,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:05:30,176 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:77 [2018-12-01 19:05:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:05:30,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-12-01 19:05:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-01 19:05:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-01 19:05:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-01 19:05:30,416 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 23 states. [2018-12-01 19:05:30,698 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-01 19:05:31,324 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-01 19:05:31,566 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-01 19:05:31,851 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-01 19:05:32,148 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-01 19:05:37,276 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 19:05:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:37,317 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-12-01 19:05:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 19:05:37,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-01 19:05:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:37,319 INFO L225 Difference]: With dead ends: 108 [2018-12-01 19:05:37,319 INFO L226 Difference]: Without dead ends: 108 [2018-12-01 19:05:37,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2018-12-01 19:05:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-01 19:05:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2018-12-01 19:05:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 19:05:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-01 19:05:37,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2018-12-01 19:05:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:37,325 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-01 19:05:37,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-01 19:05:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-01 19:05:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 19:05:37,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:37,326 INFO L402 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] [2018-12-01 19:05:37,326 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:37,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2018-12-01 19:05:37,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:37,327 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:37,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:37,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:05:37,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:37,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:37,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-01 19:05:37,459 INFO L478 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 15 treesize of output 12 [2018-12-01 19:05:37,462 INFO L478 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 12 treesize of output 11 [2018-12-01 19:05:37,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:37,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:37,488 INFO L267 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. [2018-12-01 19:05:37,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2018-12-01 19:05:37,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-01 19:05:37,529 INFO L478 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 9 treesize of output 8 [2018-12-01 19:05:37,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:37,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:37,559 INFO L267 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. [2018-12-01 19:05:37,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-12-01 19:05:37,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-12-01 19:05:37,739 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-12-01 19:05:37,740 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:37,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:37,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:37,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-12-01 19:05:38,013 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-01 19:05:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:38,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:05:40,078 INFO L478 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 82 treesize of output 78 [2018-12-01 19:05:40,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:40,311 INFO L478 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 82 treesize of output 76 [2018-12-01 19:05:40,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:40,574 INFO L478 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 80 treesize of output 76 [2018-12-01 19:05:40,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:40,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-12-01 19:05:40,959 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-01 19:05:40,964 INFO L478 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 13 treesize of output 12 [2018-12-01 19:05:40,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:41,022 INFO L478 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 23 treesize of output 19 [2018-12-01 19:05:41,027 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:05:41,027 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:05:41,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-01 19:05:41,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:41,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:41,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:41,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-12-01 19:05:41,500 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-12-01 19:05:41,510 INFO L478 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 13 treesize of output 12 [2018-12-01 19:05:41,510 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:41,568 INFO L478 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 23 treesize of output 19 [2018-12-01 19:05:41,583 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:05:41,584 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:05:41,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-01 19:05:41,585 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:41,600 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:41,653 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:42,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-12-01 19:05:42,230 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-01 19:05:42,240 INFO L478 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 13 treesize of output 12 [2018-12-01 19:05:42,240 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:42,310 INFO L478 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 23 treesize of output 19 [2018-12-01 19:05:44,319 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= main_~nondetString1~0.offset (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2018-12-01 19:05:44,321 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:05:44,322 INFO L303 Elim1Store]: Index analysis took 2011 ms [2018-12-01 19:05:44,323 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-01 19:05:44,323 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:44,340 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:05:44,400 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:44,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-01 19:05:44,769 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:245, output treesize:206 [2018-12-01 19:05:45,516 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2018-12-01 19:05:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:05:45,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2018-12-01 19:05:45,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-01 19:05:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 19:05:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-01 19:05:45,678 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 27 states. [2018-12-01 19:05:46,061 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-01 19:05:47,020 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-01 19:05:47,816 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-12-01 19:05:48,369 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-12-01 19:05:48,971 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-01 19:05:49,322 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-12-01 19:05:50,172 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-12-01 19:05:50,721 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-01 19:05:51,355 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-01 19:05:51,689 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-12-01 19:05:52,906 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-01 19:05:53,479 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-01 19:05:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:05:53,910 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-12-01 19:05:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-01 19:05:53,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-01 19:05:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:05:53,912 INFO L225 Difference]: With dead ends: 124 [2018-12-01 19:05:53,912 INFO L226 Difference]: Without dead ends: 124 [2018-12-01 19:05:53,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-12-01 19:05:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-01 19:05:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-12-01 19:05:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-01 19:05:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2018-12-01 19:05:53,915 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2018-12-01 19:05:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:05:53,915 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-12-01 19:05:53,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-01 19:05:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2018-12-01 19:05:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 19:05:53,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:05:53,916 INFO L402 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] [2018-12-01 19:05:53,916 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:05:53,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:05:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2018-12-01 19:05:53,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:05:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:05:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:05:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:05:53,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:05:54,000 INFO L478 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 [2018-12-01 19:05:54,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:54,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:05:54,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 19:05:54,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:05:54,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2018-12-01 19:05:54,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:05:54,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:05:54,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-12-01 19:05:54,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:54,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 19:05:54,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-12-01 19:05:54,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:05:54,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:05:54,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 19:05:54,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:38 [2018-12-01 19:05:59,653 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-01 19:05:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:05:59,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 19:05:59,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:05:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:05:59,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:05:59,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:05:59,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2018-12-01 19:05:59,657 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 7 states. [2018-12-01 19:06:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:06:21,914 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-12-01 19:06:21,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:06:21,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-01 19:06:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:06:21,915 INFO L225 Difference]: With dead ends: 113 [2018-12-01 19:06:21,915 INFO L226 Difference]: Without dead ends: 91 [2018-12-01 19:06:21,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2018-12-01 19:06:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-01 19:06:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-01 19:06:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 19:06:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-12-01 19:06:21,918 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-12-01 19:06:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:06:21,918 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-12-01 19:06:21,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:06:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-12-01 19:06:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 19:06:21,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:06:21,919 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:06:21,920 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:06:21,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:06:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2018-12-01 19:06:21,920 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:06:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:06:21,932 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-01 19:06:22,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 19:06:22,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:06:22,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:06:22,050 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:06:22,054 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:06:22,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:06:22,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-01 19:06:22,124 INFO L478 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 17 treesize of output 14 [2018-12-01 19:06:22,126 INFO L478 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 14 treesize of output 13 [2018-12-01 19:06:22,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-01 19:06:22,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-01 19:06:22,190 INFO L478 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 14 treesize of output 13 [2018-12-01 19:06:22,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:50 [2018-12-01 19:06:22,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-12-01 19:06:22,748 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-01 19:06:22,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:22,773 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-12-01 19:06:22,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:06:22,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:06:22,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 19:06:22,799 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-12-01 19:06:23,030 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-01 19:06:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:06:23,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:06:24,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-12-01 19:06:24,984 INFO L478 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 13 treesize of output 12 [2018-12-01 19:06:24,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:25,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-12-01 19:06:25,148 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-01 19:06:25,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:25,186 INFO L478 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 13 treesize of output 9 [2018-12-01 19:06:25,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:27,223 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32)) (bvadd main_~nondetString2~0.offset (_ bv1 32))) [2018-12-01 19:06:27,230 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:06:27,231 INFO L303 Elim1Store]: Index analysis took 2017 ms [2018-12-01 19:06:27,231 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-01 19:06:27,233 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:27,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:06:27,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:06:27,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-12-01 19:06:27,304 INFO L478 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 13 treesize of output 12 [2018-12-01 19:06:27,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:27,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-12-01 19:06:27,456 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-01 19:06:27,456 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:27,513 INFO L478 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 18 treesize of output 14 [2018-12-01 19:06:27,514 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:29,563 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32)) (bvadd main_~nondetString2~0.offset (_ bv1 32))) [2018-12-01 19:06:29,570 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:06:29,571 INFO L303 Elim1Store]: Index analysis took 2015 ms [2018-12-01 19:06:29,572 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-01 19:06:29,573 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:29,605 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:06:29,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:06:29,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-12-01 19:06:29,694 INFO L478 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 13 treesize of output 12 [2018-12-01 19:06:29,694 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:29,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-12-01 19:06:29,869 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-01 19:06:29,870 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:29,942 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:06:29,943 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:06:29,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-01 19:06:29,945 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:29,998 INFO L478 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 18 treesize of output 14 [2018-12-01 19:06:29,999 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:30,034 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:06:30,112 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:06:30,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-01 19:06:30,342 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:185, output treesize:242 [2018-12-01 19:06:30,831 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-01 19:06:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:06:30,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:06:30,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2018-12-01 19:06:30,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-01 19:06:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-01 19:06:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-12-01 19:06:30,845 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 30 states. [2018-12-01 19:06:31,375 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-01 19:06:32,205 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-01 19:06:33,917 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-01 19:06:34,523 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-12-01 19:06:35,038 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-01 19:06:35,748 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-12-01 19:06:36,346 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-01 19:06:37,017 WARN L180 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2018-12-01 19:06:37,509 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-12-01 19:06:38,064 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-01 19:06:38,589 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-01 19:06:39,070 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-01 19:06:39,628 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-01 19:06:40,110 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-12-01 19:06:41,028 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-12-01 19:06:41,624 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-01 19:06:42,599 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-12-01 19:06:43,218 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2018-12-01 19:06:43,655 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-01 19:06:44,124 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-12-01 19:06:44,653 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-01 19:06:45,470 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-12-01 19:06:46,011 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-01 19:06:46,753 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2018-12-01 19:06:47,504 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-12-01 19:06:47,975 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-01 19:06:48,430 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-01 19:06:49,120 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-01 19:06:49,717 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-12-01 19:06:50,442 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2018-12-01 19:06:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:06:51,557 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-12-01 19:06:51,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-01 19:06:51,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-12-01 19:06:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:06:51,559 INFO L225 Difference]: With dead ends: 123 [2018-12-01 19:06:51,560 INFO L226 Difference]: Without dead ends: 123 [2018-12-01 19:06:51,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=704, Invalid=4126, Unknown=0, NotChecked=0, Total=4830 [2018-12-01 19:06:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-01 19:06:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-12-01 19:06:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-01 19:06:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-12-01 19:06:51,562 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 28 [2018-12-01 19:06:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:06:51,562 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-12-01 19:06:51,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-01 19:06:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-12-01 19:06:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 19:06:51,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:06:51,563 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:06:51,563 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:06:51,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:06:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2018-12-01 19:06:51,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:06:51,564 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:06:51,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 19:06:51,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 19:06:51,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:06:51,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:06:51,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:06:51,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,708 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:06:51,713 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:06:51,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-12-01 19:06:51,762 INFO L478 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 17 treesize of output 14 [2018-12-01 19:06:51,768 INFO L478 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 14 treesize of output 13 [2018-12-01 19:06:51,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-12-01 19:06:51,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-01 19:06:51,865 INFO L478 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 14 treesize of output 13 [2018-12-01 19:06:51,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:06:51,914 INFO L267 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. [2018-12-01 19:06:51,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-12-01 19:06:52,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-01 19:06:52,343 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-12-01 19:06:52,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:06:52,372 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 19:06:52,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:52,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:06:52,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:06:52,402 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2018-12-01 19:06:52,624 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-01 19:06:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:06:52,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:06:55,172 INFO L478 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 64 treesize of output 62 [2018-12-01 19:06:55,302 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-01 19:06:55,314 INFO L478 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 6 [2018-12-01 19:06:55,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:06:55,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:06:55,504 INFO L478 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 54 treesize of output 52 [2018-12-01 19:06:55,587 INFO L478 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 6 [2018-12-01 19:06:55,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:06:55,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:06:55,782 INFO L478 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 64 treesize of output 62 [2018-12-01 19:06:55,903 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-12-01 19:06:55,908 INFO L478 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 6 [2018-12-01 19:06:55,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:06:55,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:06:56,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:06:56,106 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:109 [2018-12-01 19:06:56,441 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 19:06:56,446 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-01 19:06:56,446 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:60, output treesize:1 [2018-12-01 19:06:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:06:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:06:56,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2018-12-01 19:06:56,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-01 19:06:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-01 19:06:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-01 19:06:56,455 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 26 states. [2018-12-01 19:06:57,369 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-12-01 19:06:59,153 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2018-12-01 19:06:59,901 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2018-12-01 19:07:01,227 WARN L180 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-12-01 19:07:01,897 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-01 19:07:02,290 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-01 19:07:03,725 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-01 19:07:04,201 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-12-01 19:07:04,930 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-12-01 19:07:05,700 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-12-01 19:07:06,114 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2018-12-01 19:07:07,143 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-12-01 19:07:08,321 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2018-12-01 19:07:08,940 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-01 19:07:09,588 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-12-01 19:07:10,049 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-01 19:07:11,047 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-12-01 19:07:11,892 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-12-01 19:07:12,255 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-01 19:07:12,755 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-01 19:07:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:07:13,716 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2018-12-01 19:07:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-01 19:07:13,718 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2018-12-01 19:07:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:07:13,719 INFO L225 Difference]: With dead ends: 204 [2018-12-01 19:07:13,719 INFO L226 Difference]: Without dead ends: 204 [2018-12-01 19:07:13,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=372, Invalid=2178, Unknown=0, NotChecked=0, Total=2550 [2018-12-01 19:07:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-01 19:07:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2018-12-01 19:07:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-01 19:07:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2018-12-01 19:07:13,722 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 31 [2018-12-01 19:07:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:07:13,722 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2018-12-01 19:07:13,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-01 19:07:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2018-12-01 19:07:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 19:07:13,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:07:13,723 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:07:13,723 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:07:13,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:07:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2004369190, now seen corresponding path program 1 times [2018-12-01 19:07:13,723 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:07:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:07:13,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:07:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:07:13,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:07:13,812 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:07:13,825 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:07:13,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 19:07:13,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:07:13,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:13,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2018-12-01 19:07:13,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-01 19:07:13,873 INFO L478 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 14 treesize of output 13 [2018-12-01 19:07:13,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:13,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:13,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:13,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2018-12-01 19:07:14,224 INFO L478 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 23 treesize of output 19 [2018-12-01 19:07:14,234 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-12-01 19:07:14,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:07:14,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:07:14,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:07:14,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-12-01 19:07:14,446 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-12-01 19:07:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:07:14,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:07:16,366 INFO L478 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 58 treesize of output 56 [2018-12-01 19:07:16,492 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-12-01 19:07:16,496 INFO L478 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 9 treesize of output 5 [2018-12-01 19:07:16,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:16,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:16,534 INFO L478 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 56 treesize of output 54 [2018-12-01 19:07:16,638 INFO L478 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 9 treesize of output 5 [2018-12-01 19:07:16,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:16,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:16,692 INFO L478 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 58 treesize of output 56 [2018-12-01 19:07:16,836 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-12-01 19:07:16,840 INFO L478 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 9 treesize of output 5 [2018-12-01 19:07:16,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:16,892 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:17,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 19:07:17,012 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:173, output treesize:121 [2018-12-01 19:07:17,407 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-01 19:07:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:07:17,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:07:17,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-12-01 19:07:17,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-01 19:07:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-01 19:07:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-12-01 19:07:17,421 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 29 states. [2018-12-01 19:07:18,227 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-01 19:07:18,781 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-01 19:07:19,179 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-01 19:07:19,639 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2018-12-01 19:07:19,895 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-01 19:07:20,375 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-01 19:07:21,197 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-12-01 19:07:21,901 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-01 19:07:22,191 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-01 19:07:22,401 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-01 19:07:22,681 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-01 19:07:23,950 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-01 19:07:24,295 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-12-01 19:07:24,838 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-12-01 19:07:25,206 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-12-01 19:07:25,794 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-12-01 19:07:26,405 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-12-01 19:07:27,104 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-12-01 19:07:27,530 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-01 19:07:28,246 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-12-01 19:07:28,905 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-12-01 19:07:29,497 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-01 19:07:30,043 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-12-01 19:07:30,351 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-01 19:07:30,686 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-01 19:07:31,320 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-12-01 19:07:32,011 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-12-01 19:07:32,491 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-01 19:07:33,396 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 19:07:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:07:33,674 INFO L93 Difference]: Finished difference Result 385 states and 428 transitions. [2018-12-01 19:07:33,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-01 19:07:33,676 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-12-01 19:07:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:07:33,678 INFO L225 Difference]: With dead ends: 385 [2018-12-01 19:07:33,678 INFO L226 Difference]: Without dead ends: 385 [2018-12-01 19:07:33,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=697, Invalid=3209, Unknown=0, NotChecked=0, Total=3906 [2018-12-01 19:07:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-01 19:07:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 310. [2018-12-01 19:07:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-01 19:07:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 353 transitions. [2018-12-01 19:07:33,684 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 353 transitions. Word has length 33 [2018-12-01 19:07:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:07:33,684 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 353 transitions. [2018-12-01 19:07:33,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-01 19:07:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 353 transitions. [2018-12-01 19:07:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-01 19:07:33,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:07:33,686 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:07:33,686 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:07:33,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:07:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -847293160, now seen corresponding path program 3 times [2018-12-01 19:07:33,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:07:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:07:33,700 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-01 19:07:33,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-01 19:07:33,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:07:33,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:07:33,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:07:33,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:33,998 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:07:34,002 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:07:34,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-01 19:07:34,052 INFO L478 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 17 treesize of output 14 [2018-12-01 19:07:34,054 INFO L478 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 14 treesize of output 13 [2018-12-01 19:07:34,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-01 19:07:34,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-01 19:07:34,126 INFO L478 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 13 treesize of output 12 [2018-12-01 19:07:34,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:46 [2018-12-01 19:07:34,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-01 19:07:34,597 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-01 19:07:34,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:07:34,623 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-12-01 19:07:34,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:07:34,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:07:34,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 19:07:34,672 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:70 [2018-12-01 19:07:35,024 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-01 19:07:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-01 19:07:35,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:08:20,761 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-01 19:08:20,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-12-01 19:08:20,784 INFO L478 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 13 treesize of output 12 [2018-12-01 19:08:20,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:20,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-12-01 19:08:20,998 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-01 19:08:20,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,057 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_40 (_ bv4294967295 32)) (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2018-12-01 19:08:23,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:08:23,062 INFO L303 Elim1Store]: Index analysis took 2019 ms [2018-12-01 19:08:23,062 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-01 19:08:23,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,109 INFO L478 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 18 treesize of output 14 [2018-12-01 19:08:23,111 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:08:23,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:08:23,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-12-01 19:08:23,518 INFO L478 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 13 treesize of output 12 [2018-12-01 19:08:23,519 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-12-01 19:08:23,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:08:23,711 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:08:23,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-01 19:08:23,713 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,785 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-01 19:08:23,785 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,835 INFO L478 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 18 treesize of output 14 [2018-12-01 19:08:23,836 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 19:08:23,873 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:08:23,944 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 19:08:24,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-01 19:08:24,209 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:143, output treesize:183 [2018-12-01 19:08:25,359 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-01 19:08:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-01 19:08:25,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:08:25,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2018-12-01 19:08:25,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-01 19:08:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-01 19:08:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=671, Unknown=9, NotChecked=0, Total=756 [2018-12-01 19:08:25,511 INFO L87 Difference]: Start difference. First operand 310 states and 353 transitions. Second operand 28 states. [2018-12-01 19:08:31,080 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-01 19:08:38,083 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2018-12-01 19:08:39,498 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-01 19:08:43,896 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-12-01 19:08:52,649 WARN L180 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2018-12-01 19:09:01,709 WARN L180 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-12-01 19:09:15,142 WARN L180 SmtUtils]: Spent 12.64 s on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2018-12-01 19:09:29,499 WARN L180 SmtUtils]: Spent 13.10 s on a formula simplification. DAG size of input: 148 DAG size of output: 100 [2018-12-01 19:09:30,418 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-01 19:09:45,111 WARN L180 SmtUtils]: Spent 13.66 s on a formula simplification. DAG size of input: 171 DAG size of output: 109 [2018-12-01 19:09:47,170 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-12-01 19:10:01,986 WARN L180 SmtUtils]: Spent 14.01 s on a formula simplification. DAG size of input: 175 DAG size of output: 116 [2018-12-01 19:10:03,673 WARN L180 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2018-12-01 19:10:18,596 WARN L180 SmtUtils]: Spent 13.61 s on a formula simplification. DAG size of input: 146 DAG size of output: 103 [2018-12-01 19:10:19,418 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-01 19:10:33,484 WARN L180 SmtUtils]: Spent 13.21 s on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-12-01 19:10:34,422 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-01 19:10:49,151 WARN L180 SmtUtils]: Spent 13.87 s on a formula simplification. DAG size of input: 156 DAG size of output: 100 [2018-12-01 19:10:50,928 WARN L180 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-12-01 19:11:05,655 WARN L180 SmtUtils]: Spent 13.89 s on a formula simplification. DAG size of input: 179 DAG size of output: 108 [2018-12-01 19:11:21,005 WARN L180 SmtUtils]: Spent 14.25 s on a formula simplification. DAG size of input: 183 DAG size of output: 111 [2018-12-01 19:11:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:11:21,915 INFO L93 Difference]: Finished difference Result 309 states and 347 transitions. [2018-12-01 19:11:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-01 19:11:21,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-12-01 19:11:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:11:21,918 INFO L225 Difference]: With dead ends: 309 [2018-12-01 19:11:21,918 INFO L226 Difference]: Without dead ends: 263 [2018-12-01 19:11:21,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 217.9s TimeCoverageRelationStatistics Valid=391, Invalid=2249, Unknown=12, NotChecked=0, Total=2652 [2018-12-01 19:11:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-01 19:11:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 103. [2018-12-01 19:11:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-01 19:11:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-12-01 19:11:21,920 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 53 [2018-12-01 19:11:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:11:21,921 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-12-01 19:11:21,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-01 19:11:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-12-01 19:11:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 19:11:21,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:11:21,921 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:11:21,921 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-01 19:11:21,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:11:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash -196194070, now seen corresponding path program 3 times [2018-12-01 19:11:21,922 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 19:11:21,922 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e03ecd7-313f-4caa-91b3-139e23e16f5b/bin-2019/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 [2018-12-01 19:11:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 19:11:22,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-01 19:11:22,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 19:11:22,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:11:22,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-12-01 19:11:22,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,206 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 19:11:22,210 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 19:11:22,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-01 19:11:22,265 INFO L478 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 16 treesize of output 13 [2018-12-01 19:11:22,268 INFO L478 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 13 treesize of output 12 [2018-12-01 19:11:22,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2018-12-01 19:11:22,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-01 19:11:22,343 INFO L478 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 14 treesize of output 13 [2018-12-01 19:11:22,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-12-01 19:11:22,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-01 19:11:22,655 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-12-01 19:11:22,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:11:22,680 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-01 19:11:22,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 19:11:22,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:11:22,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 19:11:22,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:80, output treesize:80 [2018-12-01 19:11:23,074 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-01 19:11:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-01 19:11:23,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 19:11:27,588 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-01 19:11:59,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 92 [2018-12-01 19:11:59,515 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-01 19:11:59,526 INFO L478 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 13 treesize of output 12 [2018-12-01 19:11:59,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 19:11:59,624 INFO L478 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 21 [2018-12-01 19:12:01,637 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd v_prenex_56 (_ bv4294967295 32)) (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2018-12-01 19:12:01,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:12:01,642 INFO L303 Elim1Store]: Index analysis took 2017 ms [2018-12-01 19:12:01,643 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-01 19:12:01,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:12:01,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:12:01,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 19:12:02,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2018-12-01 19:12:02,317 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-12-01 19:12:02,329 INFO L478 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 13 treesize of output 12 [2018-12-01 19:12:02,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 19:12:02,413 INFO L478 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 21 [2018-12-01 19:12:02,429 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:12:02,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 19:12:02,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-01 19:12:02,431 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:12:02,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 19:12:02,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 19:12:02,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-01 19:12:02,911 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:181 [2018-12-01 19:12:03,954 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-01 19:12:04,057 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-01 19:12:04,058 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 20 variables, input treesize:221, output treesize:1 [2018-12-01 19:12:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-01 19:12:04,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:12:04,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2018-12-01 19:12:04,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-01 19:12:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 19:12:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=620, Unknown=8, NotChecked=0, Total=702 [2018-12-01 19:12:04,083 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 27 states. [2018-12-01 19:12:04,959 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-01 19:12:09,301 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-12-01 19:12:10,570 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-01 19:12:15,067 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2018-12-01 19:12:16,213 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-01 19:12:20,605 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-12-01 19:12:29,218 WARN L180 SmtUtils]: Spent 8.25 s on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-12-01 19:12:54,352 WARN L180 SmtUtils]: Spent 24.47 s on a formula simplification. DAG size of input: 141 DAG size of output: 95 [2018-12-01 19:12:55,304 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-01 19:13:16,670 WARN L180 SmtUtils]: Spent 20.84 s on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2018-12-01 19:13:18,606 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2018-12-01 19:13:27,752 WARN L180 SmtUtils]: Spent 8.60 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2018-12-01 19:13:28,395 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-01 19:13:37,820 WARN L180 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-12-01 19:13:47,820 WARN L180 SmtUtils]: Spent 8.68 s on a formula simplification. DAG size of input: 136 DAG size of output: 92 [2018-12-01 19:13:48,612 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-01 19:13:57,761 WARN L180 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2018-12-01 19:13:58,303 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-01 19:14:19,972 WARN L180 SmtUtils]: Spent 20.69 s on a formula simplification. DAG size of input: 152 DAG size of output: 94 [2018-12-01 19:14:21,323 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-12-01 19:14:43,003 WARN L180 SmtUtils]: Spent 20.99 s on a formula simplification. DAG size of input: 165 DAG size of output: 101 [2018-12-01 19:14:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:14:43,397 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-12-01 19:14:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-01 19:14:43,397 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-12-01 19:14:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:14:43,398 INFO L225 Difference]: With dead ends: 117 [2018-12-01 19:14:43,398 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 19:14:43,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 193.6s TimeCoverageRelationStatistics Valid=319, Invalid=2025, Unknown=8, NotChecked=0, Total=2352 [2018-12-01 19:14:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 19:14:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 19:14:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 19:14:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 19:14:43,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-12-01 19:14:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:14:43,398 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:14:43,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-01 19:14:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:14:43,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 19:14:43,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:14:43 BoogieIcfgContainer [2018-12-01 19:14:43,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:14:43,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:14:43,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:14:43,402 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:14:43,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:05:23" (3/4) ... [2018-12-01 19:14:43,404 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 19:14:43,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 19:14:43,408 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-12-01 19:14:43,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 19:14:43,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 19:14:43,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 19:14:43,411 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-01 19:14:43,411 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 19:14:43,411 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 19:14:43,430 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) 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) [2018-12-01 19:14:43,432 INFO L168 Benchmark]: Toolchain (without parser) took 560324.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-12-01 19:14:43,432 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:14:43,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:14:43,433 INFO L168 Benchmark]: Boogie Preprocessor took 30.97 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. [2018-12-01 19:14:43,433 INFO L168 Benchmark]: RCFGBuilder took 278.71 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:14:43,433 INFO L168 Benchmark]: TraceAbstraction took 559714.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.4 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:14:43,434 INFO L168 Benchmark]: Witness Printer took 29.77 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: 80.5 kB). Peak memory consumption was 80.5 kB. Max. memory is 11.5 GB. [2018-12-01 19:14:43,435 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.97 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 278.71 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 559714.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.4 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Witness Printer took 29.77 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: 80.5 kB). Peak memory consumption was 80.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 559.6s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 429.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 500 SDtfs, 1169 SDslu, 2749 SDs, 0 SdLazy, 3724 SolverSat, 351 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 45.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 431 SyntacticMatches, 28 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3757 ImplicationChecksByTransitivity, 488.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 366 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 127.9s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 695 ConstructedInterpolants, 215 QuantifiedInterpolants, 865388 SizeOfPredicates, 258 NumberOfNonLiveVariables, 1803 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 280/514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...