./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-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_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/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 0b29929f70f48b1f1b1180a065dc51df3698b29b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:36:34,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:36:34,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:36:34,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:36:34,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:36:34,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:36:34,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:36:34,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:36:34,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:36:34,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:36:34,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:36:34,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:36:34,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:36:34,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:36:34,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:36:34,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:36:34,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:36:34,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:36:34,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:36:34,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:36:34,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:36:34,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:36:34,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:36:34,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:36:34,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:36:34,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:36:34,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:36:34,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:36:34,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:36:34,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:36:34,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:36:34,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:36:34,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:36:34,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:36:34,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:36:34,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:36:34,581 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 07:36:34,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:36:34,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:36:34,589 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:36:34,589 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:36:34,590 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:36:34,590 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:36:34,590 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:36:34,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:36:34,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:36:34,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 07:36:34,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:36:34,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:36:34,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:36:34,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:36:34,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:36:34,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:36:34,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:36:34,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:36:34,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:36:34,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:36:34,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:36:34,592 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_9a555eae-079f-4965-8cd7-5400e11414ed/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 -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-12-02 07:36:34,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:36:34,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:36:34,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:36:34,623 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:36:34,623 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:36:34,624 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 07:36:34,664 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/data/ce452fe99/f1318d3afa78475cb40ccda90034bfb5/FLAG2aa01f1d9 [2018-12-02 07:36:35,031 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:36:35,031 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 07:36:35,037 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/data/ce452fe99/f1318d3afa78475cb40ccda90034bfb5/FLAG2aa01f1d9 [2018-12-02 07:36:35,401 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/data/ce452fe99/f1318d3afa78475cb40ccda90034bfb5 [2018-12-02 07:36:35,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:36:35,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 07:36:35,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:36:35,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:36:35,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:36:35,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35, skipping insertion in model container [2018-12-02 07:36:35,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:36:35,453 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:36:35,607 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:36:35,613 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:36:35,674 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:36:35,699 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:36:35,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35 WrapperNode [2018-12-02 07:36:35,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:36:35,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:36:35,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:36:35,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:36:35,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... [2018-12-02 07:36:35,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:36:35,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:36:35,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:36:35,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:36:35,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/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-02 07:36:35,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:36:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:36:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 07:36:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 07:36:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-12-02 07:36:35,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 07:36:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 07:36:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 07:36:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 07:36:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 07:36:35,770 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 07:36:35,771 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 07:36:35,772 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:36:35,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:36:36,021 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:36:36,021 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 07:36:36,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:36:36 BoogieIcfgContainer [2018-12-02 07:36:36,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:36:36,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:36:36,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:36:36,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:36:36,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:36:35" (1/3) ... [2018-12-02 07:36:36,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ca7040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:36:36, skipping insertion in model container [2018-12-02 07:36:36,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:36:35" (2/3) ... [2018-12-02 07:36:36,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ca7040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:36:36, skipping insertion in model container [2018-12-02 07:36:36,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:36:36" (3/3) ... [2018-12-02 07:36:36,026 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-12-02 07:36:36,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:36:36,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-02 07:36:36,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-02 07:36:36,061 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:36:36,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:36:36,062 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 07:36:36,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:36:36,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:36:36,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:36:36,062 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:36:36,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:36:36,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:36:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-12-02 07:36:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 07:36:36,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:36,079 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752957, now seen corresponding path program 1 times [2018-12-02 07:36:36,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,197 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-02 07:36:36,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 07:36:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:36:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:36:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:36:36,215 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-12-02 07:36:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,267 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-12-02 07:36:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:36:36,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 07:36:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,274 INFO L225 Difference]: With dead ends: 60 [2018-12-02 07:36:36,274 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 07:36:36,275 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-02 07:36:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 07:36:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 07:36:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 07:36:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-02 07:36:36,299 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 10 [2018-12-02 07:36:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,300 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-02 07:36:36,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:36:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-02 07:36:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 07:36:36,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:36,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752956, now seen corresponding path program 1 times [2018-12-02 07:36:36,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,345 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-02 07:36:36,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:36:36,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:36:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:36:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:36:36,346 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 4 states. [2018-12-02 07:36:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,360 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-02 07:36:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 07:36:36,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 07:36:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,361 INFO L225 Difference]: With dead ends: 56 [2018-12-02 07:36:36,361 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 07:36:36,361 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-02 07:36:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 07:36:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 07:36:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 07:36:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-12-02 07:36:36,365 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 10 [2018-12-02 07:36:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,365 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-12-02 07:36:36,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:36:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-12-02 07:36:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 07:36:36,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:36,366 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231174, now seen corresponding path program 1 times [2018-12-02 07:36:36,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,388 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-02 07:36:36,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 07:36:36,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:36:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:36:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:36:36,389 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2018-12-02 07:36:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,428 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-12-02 07:36:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:36:36,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 07:36:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,429 INFO L225 Difference]: With dead ends: 50 [2018-12-02 07:36:36,429 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 07:36:36,429 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-02 07:36:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 07:36:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-02 07:36:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 07:36:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-12-02 07:36:36,433 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-12-02 07:36:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,433 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-12-02 07:36:36,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:36:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-12-02 07:36:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 07:36:36,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:36,434 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231175, now seen corresponding path program 1 times [2018-12-02 07:36:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,460 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-02 07:36:36,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 07:36:36,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:36:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:36:36,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:36:36,462 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-12-02 07:36:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,482 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 07:36:36,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:36:36,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 07:36:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,483 INFO L225 Difference]: With dead ends: 44 [2018-12-02 07:36:36,483 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 07:36:36,483 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-02 07:36:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 07:36:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 07:36:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 07:36:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 07:36:36,485 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-12-02 07:36:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,485 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 07:36:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:36:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 07:36:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 07:36:36,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,486 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] [2018-12-02 07:36:36,486 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -185937938, now seen corresponding path program 1 times [2018-12-02 07:36:36,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,526 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-02 07:36:36,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:36:36,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:36:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:36:36,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:36:36,527 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-12-02 07:36:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,563 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-12-02 07:36:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:36:36,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 07:36:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,566 INFO L225 Difference]: With dead ends: 65 [2018-12-02 07:36:36,567 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 07:36:36,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:36:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 07:36:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-12-02 07:36:36,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 07:36:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-12-02 07:36:36,576 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 21 [2018-12-02 07:36:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,576 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-12-02 07:36:36,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:36:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-12-02 07:36:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 07:36:36,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,577 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] [2018-12-02 07:36:36,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1197055188, now seen corresponding path program 1 times [2018-12-02 07:36:36,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,632 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-02 07:36:36,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:36:36,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:36:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:36:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:36:36,633 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-12-02 07:36:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,674 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-12-02 07:36:36,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:36:36,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 07:36:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,676 INFO L225 Difference]: With dead ends: 62 [2018-12-02 07:36:36,676 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 07:36:36,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:36:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 07:36:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-12-02 07:36:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 07:36:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 07:36:36,679 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2018-12-02 07:36:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,679 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 07:36:36,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:36:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 07:36:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:36:36,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,680 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] [2018-12-02 07:36:36,680 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466273, now seen corresponding path program 1 times [2018-12-02 07:36:36,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:36,804 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-02 07:36:36,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:36,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 07:36:36,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 07:36:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 07:36:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:36:36,805 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2018-12-02 07:36:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:36,896 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-02 07:36:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:36:36,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 07:36:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:36,896 INFO L225 Difference]: With dead ends: 43 [2018-12-02 07:36:36,896 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 07:36:36,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:36:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 07:36:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 07:36:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 07:36:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 07:36:36,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2018-12-02 07:36:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:36,898 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 07:36:36,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 07:36:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-02 07:36:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:36:36,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:36,899 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] [2018-12-02 07:36:36,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:36,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466272, now seen corresponding path program 1 times [2018-12-02 07:36:36,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:36,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:36,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:36,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:37,008 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-02 07:36:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 07:36:37,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 07:36:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 07:36:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:36:37,009 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 10 states. [2018-12-02 07:36:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:37,145 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-02 07:36:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:36:37,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 07:36:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:37,145 INFO L225 Difference]: With dead ends: 49 [2018-12-02 07:36:37,146 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 07:36:37,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-02 07:36:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 07:36:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-02 07:36:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 07:36:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 07:36:37,148 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2018-12-02 07:36:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:37,148 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 07:36:37,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 07:36:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-02 07:36:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 07:36:37,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:37,149 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] [2018-12-02 07:36:37,149 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:37,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054998, now seen corresponding path program 1 times [2018-12-02 07:36:37,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:37,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:37,247 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-02 07:36:37,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 07:36:37,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 07:36:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 07:36:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:36:37,248 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 10 states. [2018-12-02 07:36:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:37,368 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-02 07:36:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:36:37,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-02 07:36:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:37,369 INFO L225 Difference]: With dead ends: 51 [2018-12-02 07:36:37,369 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 07:36:37,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-02 07:36:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 07:36:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-12-02 07:36:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 07:36:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 07:36:37,371 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2018-12-02 07:36:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:37,372 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 07:36:37,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 07:36:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 07:36:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 07:36:37,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:37,372 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] [2018-12-02 07:36:37,373 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:37,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054999, now seen corresponding path program 1 times [2018-12-02 07:36:37,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:37,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:37,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:37,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:37,528 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-02 07:36:37,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 07:36:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 07:36:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 07:36:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:36:37,529 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2018-12-02 07:36:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:37,691 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-02 07:36:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 07:36:37,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-02 07:36:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:37,692 INFO L225 Difference]: With dead ends: 45 [2018-12-02 07:36:37,692 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 07:36:37,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:36:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 07:36:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 07:36:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 07:36:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 07:36:37,694 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2018-12-02 07:36:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:37,694 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 07:36:37,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 07:36:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-12-02 07:36:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:36:37,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:37,695 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, 1, 1, 1, 1] [2018-12-02 07:36:37,695 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:37,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110580, now seen corresponding path program 1 times [2018-12-02 07:36:37,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:37,720 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-02 07:36:37,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:37,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:36:37,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:36:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:36:37,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:36:37,721 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2018-12-02 07:36:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:37,763 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-02 07:36:37,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:36:37,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-02 07:36:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:37,763 INFO L225 Difference]: With dead ends: 44 [2018-12-02 07:36:37,763 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 07:36:37,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 07:36:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 07:36:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 07:36:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 07:36:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-02 07:36:37,765 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2018-12-02 07:36:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:37,765 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-02 07:36:37,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:36:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-02 07:36:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:36:37,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:37,766 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, 1, 1, 1, 1] [2018-12-02 07:36:37,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:37,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110579, now seen corresponding path program 1 times [2018-12-02 07:36:37,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:37,815 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-02 07:36:37,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:37,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:36:37,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:36:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:36:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:36:37,816 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-12-02 07:36:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:37,853 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-12-02 07:36:37,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:36:37,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 07:36:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:37,854 INFO L225 Difference]: With dead ends: 85 [2018-12-02 07:36:37,854 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 07:36:37,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:36:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 07:36:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-12-02 07:36:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 07:36:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-02 07:36:37,857 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 28 [2018-12-02 07:36:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:37,857 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-02 07:36:37,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:36:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-02 07:36:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:36:37,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:37,857 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, 1, 1, 1, 1, 1] [2018-12-02 07:36:37,857 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:37,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1564088447, now seen corresponding path program 1 times [2018-12-02 07:36:37,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:37,902 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-02 07:36:37,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:37,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:36:37,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:36:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:36:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:36:37,903 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 6 states. [2018-12-02 07:36:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:37,938 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-12-02 07:36:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:36:37,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 07:36:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:37,939 INFO L225 Difference]: With dead ends: 72 [2018-12-02 07:36:37,939 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 07:36:37,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 07:36:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 07:36:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-12-02 07:36:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 07:36:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-12-02 07:36:37,941 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 28 [2018-12-02 07:36:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:37,942 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-12-02 07:36:37,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:36:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-12-02 07:36:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:36:37,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:37,942 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, 1, 1, 1, 1] [2018-12-02 07:36:37,942 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:37,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1162408753, now seen corresponding path program 1 times [2018-12-02 07:36:37,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:38,299 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-02 07:36:38,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 07:36:38,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 07:36:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 07:36:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-02 07:36:38,300 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2018-12-02 07:36:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:38,947 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-12-02 07:36:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 07:36:38,948 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-02 07:36:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:38,949 INFO L225 Difference]: With dead ends: 76 [2018-12-02 07:36:38,949 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 07:36:38,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-12-02 07:36:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 07:36:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-02 07:36:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 07:36:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-02 07:36:38,955 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 28 [2018-12-02 07:36:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:38,955 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-02 07:36:38,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 07:36:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-02 07:36:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:36:38,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:38,957 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, 1, 1, 1, 1, 1] [2018-12-02 07:36:38,957 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:38,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1141386621, now seen corresponding path program 1 times [2018-12-02 07:36:38,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:39,074 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-02 07:36:39,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:39,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 07:36:39,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 07:36:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 07:36:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-02 07:36:39,075 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 12 states. [2018-12-02 07:36:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:39,266 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-12-02 07:36:39,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 07:36:39,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-02 07:36:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:39,267 INFO L225 Difference]: With dead ends: 130 [2018-12-02 07:36:39,267 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 07:36:39,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-12-02 07:36:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 07:36:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-02 07:36:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-02 07:36:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-12-02 07:36:39,271 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 28 [2018-12-02 07:36:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:39,271 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-12-02 07:36:39,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 07:36:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-12-02 07:36:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:36:39,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:39,272 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, 1, 1, 1, 1, 1] [2018-12-02 07:36:39,272 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:39,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -922531903, now seen corresponding path program 1 times [2018-12-02 07:36:39,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:39,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:39,440 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-02 07:36:39,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:36:39,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/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-02 07:36:39,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:39,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:36:39,508 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-02 07:36:39,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 11 treesize of output 10 [2018-12-02 07:36:39,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,520 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-02 07:36:39,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 07:36:39,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:39,577 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 14 treesize of output 17 [2018-12-02 07:36:39,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:39,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:39,591 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:36:39,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:39,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-12-02 07:36:39,623 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 26 treesize of output 27 [2018-12-02 07:36:39,625 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 1 [2018-12-02 07:36:39,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,637 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-02 07:36:39,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-12-02 07:36:39,699 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 26 treesize of output 27 [2018-12-02 07:36:39,701 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 1 [2018-12-02 07:36:39,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:39,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:39,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-12-02 07:36:39,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 07:36:39,783 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-02 07:36:39,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 07:36:39,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:36:39,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 07:36:39,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-12-02 07:36:39,893 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-02 07:36:39,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:36:39,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-12-02 07:36:39,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 07:36:39,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 07:36:39,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-12-02 07:36:39,910 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 24 states. [2018-12-02 07:36:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:40,644 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2018-12-02 07:36:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 07:36:40,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-02 07:36:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:40,645 INFO L225 Difference]: With dead ends: 141 [2018-12-02 07:36:40,645 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 07:36:40,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2018-12-02 07:36:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 07:36:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-12-02 07:36:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 07:36:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-12-02 07:36:40,649 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 28 [2018-12-02 07:36:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:40,649 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2018-12-02 07:36:40,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 07:36:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2018-12-02 07:36:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 07:36:40,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:40,650 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:40,651 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:40,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1466282070, now seen corresponding path program 1 times [2018-12-02 07:36:40,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:40,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:40,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:40,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:36:40,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/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-02 07:36:40,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:40,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:36:40,976 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-02 07:36:40,978 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-02 07:36:40,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:40,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:41,007 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-02 07:36:41,009 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-02 07:36:41,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-02 07:36:41,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:41,059 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 07:36:41,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:41,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:41,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:41,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-02 07:36:41,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-02 07:36:41,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 07:36:41,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:36:41,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 07:36:41,110 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 8 treesize of output 7 [2018-12-02 07:36:41,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-02 07:36:41,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-02 07:36:41,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-02 07:36:41,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 [2018-12-02 07:36:41,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, 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 3 [2018-12-02 07:36:41,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:41,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:41,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-12-02 07:36:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:41,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:36:41,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-12-02 07:36:41,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 07:36:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 07:36:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-12-02 07:36:41,494 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 29 states. [2018-12-02 07:36:42,051 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-12-02 07:36:42,250 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-12-02 07:36:42,462 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-12-02 07:36:43,200 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-12-02 07:36:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:44,098 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-02 07:36:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 07:36:44,099 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-02 07:36:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:44,101 INFO L225 Difference]: With dead ends: 132 [2018-12-02 07:36:44,101 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 07:36:44,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 07:36:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 07:36:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-12-02 07:36:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 07:36:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-12-02 07:36:44,110 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 29 [2018-12-02 07:36:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:44,111 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-12-02 07:36:44,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 07:36:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-12-02 07:36:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 07:36:44,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:44,112 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:44,113 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:44,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1002178119, now seen corresponding path program 1 times [2018-12-02 07:36:44,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:44,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:44,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:44,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:36:44,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/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-02 07:36:44,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:44,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:36:44,530 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-02 07:36:44,533 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-02 07:36:44,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:44,542 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-02 07:36:44,544 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-02 07:36:44,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:44,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-02 07:36:44,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:44,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:44,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:44,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-02 07:36:44,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 07:36:44,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-02 07:36:44,642 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 11 treesize of output 8 [2018-12-02 07:36:44,643 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 8 treesize of output 7 [2018-12-02 07:36:44,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,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 11 treesize of output 8 [2018-12-02 07:36:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:36:44,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-02 07:36:44,708 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 19 [2018-12-02 07:36:44,710 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 19 treesize of output 10 [2018-12-02 07:36:44,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 07:36:44,719 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 3 [2018-12-02 07:36:44,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:44,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:44,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-02 07:36:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:44,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:36:44,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-12-02 07:36:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 07:36:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 07:36:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 07:36:44,978 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 33 states. [2018-12-02 07:36:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:46,686 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-12-02 07:36:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 07:36:46,687 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-02 07:36:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:46,687 INFO L225 Difference]: With dead ends: 175 [2018-12-02 07:36:46,687 INFO L226 Difference]: Without dead ends: 175 [2018-12-02 07:36:46,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=477, Invalid=3683, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 07:36:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-02 07:36:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2018-12-02 07:36:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-02 07:36:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-12-02 07:36:46,691 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 32 [2018-12-02 07:36:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:46,692 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-12-02 07:36:46,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 07:36:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-12-02 07:36:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 07:36:46,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:46,692 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:46,692 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:46,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1609289062, now seen corresponding path program 1 times [2018-12-02 07:36:46,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:46,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:46,890 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-02 07:36:46,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:36:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 07:36:46,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 07:36:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 07:36:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-02 07:36:46,891 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 11 states. [2018-12-02 07:36:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:46,982 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-12-02 07:36:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 07:36:46,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-12-02 07:36:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:46,982 INFO L225 Difference]: With dead ends: 153 [2018-12-02 07:36:46,982 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 07:36:46,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:36:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 07:36:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-12-02 07:36:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 07:36:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-12-02 07:36:46,984 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2018-12-02 07:36:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:46,984 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-12-02 07:36:46,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 07:36:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-12-02 07:36:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 07:36:46,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:46,984 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:46,984 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:46,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1731160686, now seen corresponding path program 1 times [2018-12-02 07:36:46,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:46,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:46,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:46,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:46,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:47,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:36:47,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/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-02 07:36:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:47,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:36:47,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:47,376 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-02 07:36:47,378 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-02 07:36:47,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,392 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-02 07:36:47,394 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-02 07:36:47,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:47,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-12-02 07:36:47,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:47,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:47,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:47,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-02 07:36:47,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 07:36:47,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-02 07:36:47,484 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 11 treesize of output 8 [2018-12-02 07:36:47,485 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 8 treesize of output 7 [2018-12-02 07:36:47,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,493 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 11 treesize of output 8 [2018-12-02 07:36:47,494 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:36:47,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-02 07:36:47,542 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 19 [2018-12-02 07:36:47,544 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 19 treesize of output 10 [2018-12-02 07:36:47,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 07:36:47,554 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 3 [2018-12-02 07:36:47,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:47,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:47,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-02 07:36:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:47,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:36:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-12-02 07:36:47,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 07:36:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 07:36:47,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-12-02 07:36:47,839 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 32 states. [2018-12-02 07:36:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:49,076 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-02 07:36:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 07:36:49,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-12-02 07:36:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:49,076 INFO L225 Difference]: With dead ends: 52 [2018-12-02 07:36:49,076 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 07:36:49,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=345, Invalid=2517, Unknown=0, NotChecked=0, Total=2862 [2018-12-02 07:36:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 07:36:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-02 07:36:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 07:36:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-02 07:36:49,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-12-02 07:36:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:49,078 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-02 07:36:49,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 07:36:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-02 07:36:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 07:36:49,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:49,078 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:49,078 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:49,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1752182818, now seen corresponding path program 2 times [2018-12-02 07:36:49,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:49,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:49,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:36:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:49,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:36:49,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:36:49,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:36:49,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:36:49,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:36:49,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:36:49,418 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-02 07:36:49,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,424 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-02 07:36:49,426 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-02 07:36:49,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,432 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-12-02 07:36:49,450 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-02 07:36:49,451 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-02 07:36:49,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,458 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-02 07:36:49,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 07:36:49,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:49,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:49,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 07:36:49,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,515 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 07:36:49,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:49,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-12-02 07:36:49,548 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 11 treesize of output 8 [2018-12-02 07:36:49,550 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:36:49,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 07:36:49,564 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 1 [2018-12-02 07:36:49,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:49,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-12-02 07:36:49,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 07:36:49,637 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 12 treesize of output 4 [2018-12-02 07:36:49,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,644 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-02 07:36:49,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-12-02 07:36:49,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 07:36:49,709 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 1 [2018-12-02 07:36:49,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:49,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 [2018-12-02 07:36:49,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-02 07:36:49,824 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 8 treesize of output 7 [2018-12-02 07:36:49,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:49,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:49,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:31 [2018-12-02 07:36:49,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-02 07:36:49,942 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-02 07:36:49,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 07:36:49,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 07:36:49,953 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 2 xjuncts. [2018-12-02 07:36:49,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:55 [2018-12-02 07:36:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:36:50,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:36:50,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-12-02 07:36:50,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 07:36:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 07:36:50,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 07:36:50,126 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-12-02 07:36:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:51,440 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-02 07:36:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 07:36:51,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-02 07:36:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:51,440 INFO L225 Difference]: With dead ends: 37 [2018-12-02 07:36:51,440 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 07:36:51,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=257, Invalid=2293, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 07:36:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 07:36:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-02 07:36:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 07:36:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-02 07:36:51,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-02 07:36:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:51,442 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-02 07:36:51,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 07:36:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-02 07:36:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 07:36:51,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:36:51,443 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:36:51,443 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION]=== [2018-12-02 07:36:51,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:36:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1516907499, now seen corresponding path program 2 times [2018-12-02 07:36:51,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:36:51,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:36:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:51,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:36:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:36:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:36:51,770 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-02 07:36:51,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:36:51,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:36:51,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 07:36:51,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 07:36:51,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:36:51,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:36:51,816 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-02 07:36:51,819 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-02 07:36:51,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:51,830 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-02 07:36:51,832 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-02 07:36:51,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-02 07:36:51,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:51,902 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 07:36:51,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:51,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:51,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 07:36:51,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2018-12-02 07:36:51,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-12-02 07:36:51,938 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 11 treesize of output 8 [2018-12-02 07:36:51,939 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 07:36:51,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,947 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 11 treesize of output 8 [2018-12-02 07:36:51,948 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 8 treesize of output 7 [2018-12-02 07:36:51,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:51,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-02 07:36:51,998 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 19 [2018-12-02 07:36:52,000 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 19 treesize of output 10 [2018-12-02 07:36:52,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:52,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:52,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 07:36:52,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 07:36:52,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 07:36:52,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 07:36:52,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 07:36:52,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-12-02 07:36:52,316 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-02 07:36:52,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 07:36:52,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-12-02 07:36:52,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-02 07:36:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-02 07:36:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 07:36:52,337 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-02 07:36:54,117 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2018-12-02 07:36:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:36:54,126 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-02 07:36:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 07:36:54,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-02 07:36:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:36:54,127 INFO L225 Difference]: With dead ends: 42 [2018-12-02 07:36:54,127 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 07:36:54,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=344, Invalid=2736, Unknown=0, NotChecked=0, Total=3080 [2018-12-02 07:36:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 07:36:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 07:36:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 07:36:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 07:36:54,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-02 07:36:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:36:54,129 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:36:54,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-02 07:36:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:36:54,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 07:36:54,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:36:54 BoogieIcfgContainer [2018-12-02 07:36:54,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:36:54,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:36:54,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:36:54,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:36:54,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:36:36" (3/4) ... [2018-12-02 07:36:54,141 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 07:36:54,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 07:36:54,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 07:36:54,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 07:36:54,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpncpy [2018-12-02 07:36:54,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 07:36:54,154 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-02 07:36:54,154 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 07:36:54,154 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 07:36:54,180 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a555eae-079f-4965-8cd7-5400e11414ed/bin-2019/uautomizer/witness.graphml [2018-12-02 07:36:54,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:36:54,181 INFO L168 Benchmark]: Toolchain (without parser) took 18775.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 954.9 MB in the beginning and 837.2 MB in the end (delta: 117.7 MB). Peak memory consumption was 508.8 MB. Max. memory is 11.5 GB. [2018-12-02 07:36:54,181 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:36:54,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 07:36:54,182 INFO L168 Benchmark]: Boogie Preprocessor took 32.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:36:54,182 INFO L168 Benchmark]: RCFGBuilder took 289.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-12-02 07:36:54,182 INFO L168 Benchmark]: TraceAbstraction took 18112.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 837.2 MB in the end (delta: 175.4 MB). Peak memory consumption was 481.6 MB. Max. memory is 11.5 GB. [2018-12-02 07:36:54,182 INFO L168 Benchmark]: Witness Printer took 44.97 ms. Allocated memory is still 1.4 GB. Free memory is still 837.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:36:54,183 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18112.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 837.2 MB in the end (delta: 175.4 MB). Peak memory consumption was 481.6 MB. Max. memory is 11.5 GB. * Witness Printer took 44.97 ms. Allocated memory is still 1.4 GB. Free memory is still 837.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 540]: 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: 548]: 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: 544]: 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: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: 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: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: 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: 548]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 67 locations, 21 error locations. SAFE Result, 18.0s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 1205 SDslu, 4124 SDs, 0 SdLazy, 4633 SolverSat, 417 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=18, 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, 111 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 706 ConstructedInterpolants, 116 QuantifiedInterpolants, 299665 SizeOfPredicates, 109 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 4/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...