./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-91b1670 [2018-11-28 22:43:47,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:47,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:47,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:47,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:47,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:47,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:47,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:47,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:47,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:47,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:47,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:47,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:47,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:47,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:47,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:47,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:47,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:47,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:47,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:47,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:47,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:47,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:47,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:47,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:47,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:47,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:47,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:47,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:47,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:47,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:47,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:47,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:47,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:47,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:47,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:47,624 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:47,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:47,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:47,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:47,641 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:47,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:47,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:47,642 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:47,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:47,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:47,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:47,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:47,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:47,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:47,645 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:47,645 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:47,645 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:47,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:47,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:47,646 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:47,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:47,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:47,646 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:47,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:47,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:47,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:47,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:47,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:47,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:47,649 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 22:43:47,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:47,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:47,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:47,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:47,732 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:47,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:47,807 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3286410b4/c535ba7c28b8486dac4b02653a7d1318/FLAGae2e3ecd3 [2018-11-28 22:43:48,308 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:48,308 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:48,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3286410b4/c535ba7c28b8486dac4b02653a7d1318/FLAGae2e3ecd3 [2018-11-28 22:43:48,585 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3286410b4/c535ba7c28b8486dac4b02653a7d1318 [2018-11-28 22:43:48,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:48,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:48,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:48,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:48,595 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:48,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:48" (1/1) ... [2018-11-28 22:43:48,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60127b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:48, skipping insertion in model container [2018-11-28 22:43:48,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:48" (1/1) ... [2018-11-28 22:43:48,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:48,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:49,070 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:49,082 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:49,139 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:49,278 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:49,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49 WrapperNode [2018-11-28 22:43:49,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:49,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:49,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:49,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:49,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... [2018-11-28 22:43:49,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:49,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:49,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:49,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:49,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:43:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-11-28 22:43:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:49,414 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:49,415 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:49,417 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:49,420 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:49,423 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:49,426 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:49,427 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:49,429 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:49,430 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:49,431 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:50,301 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:50,302 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:43:50,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:50 BoogieIcfgContainer [2018-11-28 22:43:50,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:50,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:50,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:50,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:50,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:48" (1/3) ... [2018-11-28 22:43:50,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78323f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:50, skipping insertion in model container [2018-11-28 22:43:50,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:49" (2/3) ... [2018-11-28 22:43:50,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78323f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:50, skipping insertion in model container [2018-11-28 22:43:50,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:50" (3/3) ... [2018-11-28 22:43:50,313 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:50,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:50,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-11-28 22:43:50,358 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-11-28 22:43:50,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:50,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:50,396 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:50,397 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:50,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:50,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:50,398 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:50,398 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:50,398 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-28 22:43:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:50,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:50,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:50,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:50,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752957, now seen corresponding path program 1 times [2018-11-28 22:43:50,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:50,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:50,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:50,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:50,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:50,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:50,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:50,697 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-11-28 22:43:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:50,957 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-28 22:43:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:50,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:50,971 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:43:50,971 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 22:43:50,974 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-11-28 22:43:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 22:43:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-28 22:43:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 22:43:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-28 22:43:51,022 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 10 [2018-11-28 22:43:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:51,023 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-28 22:43:51,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-28 22:43:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:51,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:51,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:51,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:51,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1703752956, now seen corresponding path program 1 times [2018-11-28 22:43:51,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:51,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:51,166 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 4 states. [2018-11-28 22:43:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:51,198 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-28 22:43:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:51,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:51,201 INFO L225 Difference]: With dead ends: 56 [2018-11-28 22:43:51,201 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 22:43:51,202 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-11-28 22:43:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 22:43:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 22:43:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 22:43:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-28 22:43:51,210 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 10 [2018-11-28 22:43:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:51,210 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-28 22:43:51,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-28 22:43:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:43:51,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:51,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:51,211 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:51,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:51,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231174, now seen corresponding path program 1 times [2018-11-28 22:43:51,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:51,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:51,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:51,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:51,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:51,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:51,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:51,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:51,293 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 3 states. [2018-11-28 22:43:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:51,422 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-28 22:43:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:51,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 22:43:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:51,425 INFO L225 Difference]: With dead ends: 50 [2018-11-28 22:43:51,425 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 22:43:51,426 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-11-28 22:43:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 22:43:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-28 22:43:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 22:43:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-28 22:43:51,433 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-11-28 22:43:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:51,434 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-28 22:43:51,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-28 22:43:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:43:51,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:51,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:51,435 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:51,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1419231175, now seen corresponding path program 1 times [2018-11-28 22:43:51,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:51,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:51,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:51,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:51,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:51,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:51,517 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 3 states. [2018-11-28 22:43:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:51,792 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 22:43:51,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:51,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 22:43:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:51,795 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:43:51,795 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:43:51,795 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-11-28 22:43:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:43:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:43:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-28 22:43:51,811 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-11-28 22:43:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:51,815 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-28 22:43:51,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-28 22:43:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:43:51,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:51,816 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-11-28 22:43:51,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:51,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash -185937938, now seen corresponding path program 1 times [2018-11-28 22:43:51,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:51,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:51,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:51,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:51,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:51,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:51,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:51,961 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-11-28 22:43:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:52,067 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-11-28 22:43:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:52,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-28 22:43:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:52,071 INFO L225 Difference]: With dead ends: 65 [2018-11-28 22:43:52,071 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 22:43:52,072 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-11-28 22:43:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 22:43:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2018-11-28 22:43:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 22:43:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-28 22:43:52,086 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 21 [2018-11-28 22:43:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:52,086 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-28 22:43:52,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-28 22:43:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:43:52,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:52,088 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-11-28 22:43:52,088 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:52,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1197055188, now seen corresponding path program 1 times [2018-11-28 22:43:52,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:52,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:52,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:52,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:52,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:52,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:52,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:52,235 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-11-28 22:43:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:52,354 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-28 22:43:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:52,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 22:43:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:52,355 INFO L225 Difference]: With dead ends: 62 [2018-11-28 22:43:52,356 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 22:43:52,356 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-11-28 22:43:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 22:43:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-28 22:43:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 22:43:52,361 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2018-11-28 22:43:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:52,361 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 22:43:52,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 22:43:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:43:52,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:52,363 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-11-28 22:43:52,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:52,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466273, now seen corresponding path program 1 times [2018-11-28 22:43:52,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:43:52,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:43:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:43:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:52,792 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2018-11-28 22:43:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:53,063 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-28 22:43:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:43:53,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-28 22:43:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:53,064 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:43:53,065 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:43:53,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:43:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:43:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:43:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:43:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-28 22:43:53,070 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 22 [2018-11-28 22:43:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:53,070 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-28 22:43:53,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:43:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-28 22:43:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:43:53,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:53,071 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-11-28 22:43:53,072 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:53,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:53,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2041466272, now seen corresponding path program 1 times [2018-11-28 22:43:53,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:53,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:53,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:43:53,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:43:53,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:43:53,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:53,327 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 10 states. [2018-11-28 22:43:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:53,841 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-28 22:43:53,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:43:53,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-28 22:43:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:53,844 INFO L225 Difference]: With dead ends: 49 [2018-11-28 22:43:53,844 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 22:43:53,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:43:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 22:43:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-28 22:43:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:43:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-28 22:43:53,849 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2018-11-28 22:43:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:53,849 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-28 22:43:53,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:43:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-28 22:43:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:43:53,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:53,850 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-11-28 22:43:53,850 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:53,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054998, now seen corresponding path program 1 times [2018-11-28 22:43:53,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:53,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:53,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:53,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:43:54,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:43:54,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:43:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:43:54,313 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 10 states. [2018-11-28 22:43:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:54,632 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-28 22:43:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:43:54,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-28 22:43:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:54,634 INFO L225 Difference]: With dead ends: 51 [2018-11-28 22:43:54,635 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 22:43:54,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:43:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 22:43:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-11-28 22:43:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 22:43:54,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2018-11-28 22:43:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:54,640 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 22:43:54,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:43:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 22:43:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:43:54,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:54,641 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-11-28 22:43:54,641 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:54,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1139054999, now seen corresponding path program 1 times [2018-11-28 22:43:54,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:54,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:55,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:43:55,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:43:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:43:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:43:55,102 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2018-11-28 22:43:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:55,573 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-28 22:43:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:43:55,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-28 22:43:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:55,576 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:43:55,576 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 22:43:55,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:43:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 22:43:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 22:43:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:43:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-28 22:43:55,582 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2018-11-28 22:43:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:55,582 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-28 22:43:55,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:43:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-28 22:43:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:43:55,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:55,583 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-11-28 22:43:55,584 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:55,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110580, now seen corresponding path program 1 times [2018-11-28 22:43:55,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:55,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:55,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:55,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:55,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:55,715 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2018-11-28 22:43:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:55,822 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-28 22:43:55,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:55,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-28 22:43:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:55,825 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:43:55,825 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:43:55,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:43:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:43:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 22:43:55,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 28 [2018-11-28 22:43:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:55,830 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 22:43:55,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 22:43:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:43:55,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:55,831 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-11-28 22:43:55,832 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:55,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1585110579, now seen corresponding path program 1 times [2018-11-28 22:43:55,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:55,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:56,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:56,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:56,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:56,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:56,168 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-11-28 22:43:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:56,308 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-11-28 22:43:56,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:56,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 22:43:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:56,311 INFO L225 Difference]: With dead ends: 85 [2018-11-28 22:43:56,311 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 22:43:56,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 22:43:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-11-28 22:43:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 22:43:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-11-28 22:43:56,318 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 28 [2018-11-28 22:43:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:56,318 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-28 22:43:56,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-11-28 22:43:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:43:56,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:56,320 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-11-28 22:43:56,320 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:56,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1564088447, now seen corresponding path program 1 times [2018-11-28 22:43:56,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:56,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:56,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:56,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:56,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:56,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:56,911 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 6 states. [2018-11-28 22:43:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:57,009 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-28 22:43:57,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:57,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 22:43:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:57,012 INFO L225 Difference]: With dead ends: 72 [2018-11-28 22:43:57,012 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 22:43:57,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 22:43:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-11-28 22:43:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 22:43:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-11-28 22:43:57,020 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 28 [2018-11-28 22:43:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:57,021 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-11-28 22:43:57,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-11-28 22:43:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:43:57,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:57,022 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-11-28 22:43:57,023 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:57,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1162408753, now seen corresponding path program 1 times [2018-11-28 22:43:57,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:57,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:57,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:57,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:57,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:57,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 22:43:57,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:43:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:43:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:43:57,845 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2018-11-28 22:43:58,533 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-11-28 22:43:58,964 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-28 22:43:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,342 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-28 22:43:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 22:43:59,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-28 22:43:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,345 INFO L225 Difference]: With dead ends: 76 [2018-11-28 22:43:59,345 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 22:43:59,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-11-28 22:43:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 22:43:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-28 22:43:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 22:43:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-28 22:43:59,350 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 28 [2018-11-28 22:43:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,351 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-28 22:43:59,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:43:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-28 22:43:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:43:59,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,352 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-11-28 22:43:59,352 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1141386621, now seen corresponding path program 1 times [2018-11-28 22:43:59,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 22:43:59,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 22:43:59,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 22:43:59,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:43:59,658 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 12 states. [2018-11-28 22:44:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,062 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-28 22:44:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:44:00,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-28 22:44:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,065 INFO L225 Difference]: With dead ends: 130 [2018-11-28 22:44:00,066 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 22:44:00,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-28 22:44:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 22:44:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-11-28 22:44:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 22:44:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2018-11-28 22:44:00,073 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 28 [2018-11-28 22:44:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,074 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2018-11-28 22:44:00,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 22:44:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2018-11-28 22:44:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:44:00,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,076 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-11-28 22:44:00,076 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash -922531903, now seen corresponding path program 1 times [2018-11-28 22:44:00,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:00,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:44:00,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:00,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, 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-11-28 22:44:00,657 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-11-28 22:44:00,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:00,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:00,737 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-11-28 22:44:00,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 22:44:01,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:01,011 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-11-28 22:44:01,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:01,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:01,033 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-11-28 22:44:01,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,067 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-11-28 22:44:01,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-11-28 22:44:01,162 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-11-28 22:44:01,166 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-11-28 22:44:01,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,185 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-11-28 22:44:01,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-11-28 22:44:01,374 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-11-28 22:44:01,381 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-11-28 22:44:01,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,403 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-11-28 22:44:01,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-11-28 22:44:01,536 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-11-28 22:44:01,659 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-11-28 22:44:01,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:01,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:01,790 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-11-28 22:44:01,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-11-28 22:44:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-28 22:44:02,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 22:44:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 22:44:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-11-28 22:44:02,087 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 24 states. [2018-11-28 22:44:02,491 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-11-28 22:44:03,278 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2018-11-28 22:44:03,520 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2018-11-28 22:44:03,821 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2018-11-28 22:44:03,987 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-11-28 22:44:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,595 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2018-11-28 22:44:04,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:44:04,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-11-28 22:44:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,598 INFO L225 Difference]: With dead ends: 141 [2018-11-28 22:44:04,598 INFO L226 Difference]: Without dead ends: 141 [2018-11-28 22:44:04,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2018-11-28 22:44:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-28 22:44:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-11-28 22:44:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 22:44:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-11-28 22:44:04,613 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 28 [2018-11-28 22:44:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,615 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2018-11-28 22:44:04,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 22:44:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2018-11-28 22:44:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:44:04,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,620 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-11-28 22:44:04,620 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1466282070, now seen corresponding path program 1 times [2018-11-28 22:44:04,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:05,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:05,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:44:05,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:05,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:05,491 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-11-28 22:44:05,541 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-11-28 22:44:05,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:05,575 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-11-28 22:44:05,585 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-11-28 22:44:05,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-11-28 22:44:05,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:05,680 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-11-28 22:44:05,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:05,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:05,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:05,705 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-11-28 22:44:05,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-28 22:44:05,764 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-11-28 22:44:05,767 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-11-28 22:44:05,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,819 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-11-28 22:44:05,823 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-11-28 22:44:05,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-11-28 22:44:06,006 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-11-28 22:44:06,019 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-11-28 22:44:06,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,064 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-11-28 22:44:06,067 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-11-28 22:44:06,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,083 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-11-28 22:44:06,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-11-28 22:44:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:06,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:06,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-11-28 22:44:06,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 22:44:06,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 22:44:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-11-28 22:44:06,550 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 29 states. [2018-11-28 22:44:07,135 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-28 22:44:07,320 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2018-11-28 22:44:07,491 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-11-28 22:44:07,663 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-11-28 22:44:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:09,329 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-11-28 22:44:09,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 22:44:09,330 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-11-28 22:44:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:09,333 INFO L225 Difference]: With dead ends: 132 [2018-11-28 22:44:09,334 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 22:44:09,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 22:44:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 22:44:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-28 22:44:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 22:44:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-11-28 22:44:09,343 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 29 [2018-11-28 22:44:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:09,343 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-11-28 22:44:09,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 22:44:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-11-28 22:44:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 22:44:09,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:09,345 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-11-28 22:44:09,345 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:09,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1002178119, now seen corresponding path program 1 times [2018-11-28 22:44:09,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:09,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:09,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:10,195 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-11-28 22:44:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:10,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:10,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:44:10,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:10,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:10,703 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-11-28 22:44:10,710 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-11-28 22:44:10,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:10,731 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-11-28 22:44:10,747 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-11-28 22:44:10,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,766 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-11-28 22:44:10,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-11-28 22:44:10,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:10,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:10,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:10,897 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-11-28 22:44:10,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,952 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-11-28 22:44:10,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:10,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-11-28 22:44:10,997 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-11-28 22:44:11,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:44:11,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,054 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-11-28 22:44:11,058 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-11-28 22:44:11,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-28 22:44:11,250 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-11-28 22:44:11,253 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-11-28 22:44:11,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,376 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-11-28 22:44:11,379 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-11-28 22:44:11,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:11,387 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-11-28 22:44:11,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-11-28 22:44:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:11,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:11,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-11-28 22:44:11,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 22:44:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 22:44:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 22:44:11,784 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 33 states. [2018-11-28 22:44:12,318 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-11-28 22:44:12,592 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-11-28 22:44:13,322 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-28 22:44:13,728 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-28 22:44:14,138 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-11-28 22:44:14,842 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-11-28 22:44:15,089 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-28 22:44:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:15,348 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-11-28 22:44:15,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 22:44:15,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-11-28 22:44:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:15,351 INFO L225 Difference]: With dead ends: 175 [2018-11-28 22:44:15,352 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 22:44:15,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=477, Invalid=3683, Unknown=0, NotChecked=0, Total=4160 [2018-11-28 22:44:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 22:44:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 138. [2018-11-28 22:44:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-28 22:44:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-11-28 22:44:15,362 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 32 [2018-11-28 22:44:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:15,362 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-11-28 22:44:15,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 22:44:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-11-28 22:44:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 22:44:15,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:15,363 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-11-28 22:44:15,364 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:15,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1609289062, now seen corresponding path program 1 times [2018-11-28 22:44:15,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:15,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:15,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:15,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:15,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:16,042 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2018-11-28 22:44:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 22:44:16,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:44:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:44:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:16,412 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 11 states. [2018-11-28 22:44:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:16,673 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-11-28 22:44:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:44:16,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-28 22:44:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:16,675 INFO L225 Difference]: With dead ends: 153 [2018-11-28 22:44:16,676 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 22:44:16,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:44:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 22:44:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-28 22:44:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:44:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-28 22:44:16,680 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2018-11-28 22:44:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:16,681 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-28 22:44:16,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:44:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-28 22:44:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 22:44:16,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:16,682 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-11-28 22:44:16,682 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:16,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1731160686, now seen corresponding path program 1 times [2018-11-28 22:44:16,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:16,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:17,250 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:44:17,477 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-28 22:44:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:17,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:17,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:44:18,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:18,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:18,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:18,138 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-11-28 22:44:18,152 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-11-28 22:44:18,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,199 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-11-28 22:44:18,205 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-11-28 22:44:18,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,224 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-11-28 22:44:18,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 [2018-11-28 22:44:18,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:18,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:18,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:18,305 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-11-28 22:44:18,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,331 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-11-28 22:44:18,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-11-28 22:44:18,378 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-11-28 22:44:18,380 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-11-28 22:44:18,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,397 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-11-28 22:44:18,399 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-11-28 22:44:18,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-28 22:44:18,500 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-11-28 22:44:18,503 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-11-28 22:44:18,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,520 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-11-28 22:44:18,523 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-11-28 22:44:18,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:18,541 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-11-28 22:44:18,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-11-28 22:44:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:19,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:19,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-11-28 22:44:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 22:44:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 22:44:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-11-28 22:44:19,070 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 32 states. [2018-11-28 22:44:21,129 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2018-11-28 22:44:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:21,384 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-28 22:44:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 22:44:21,385 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-11-28 22:44:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:21,386 INFO L225 Difference]: With dead ends: 52 [2018-11-28 22:44:21,386 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:44:21,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=345, Invalid=2517, Unknown=0, NotChecked=0, Total=2862 [2018-11-28 22:44:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:44:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-28 22:44:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 22:44:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-28 22:44:21,391 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-28 22:44:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:21,391 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-28 22:44:21,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 22:44:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-28 22:44:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 22:44:21,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:21,392 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-11-28 22:44:21,392 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:21,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1752182818, now seen corresponding path program 2 times [2018-11-28 22:44:21,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:21,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:21,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:21,944 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-28 22:44:22,159 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 22:44:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:22,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:22,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:44:22,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:22,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:22,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:22,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:22,691 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-11-28 22:44:22,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,698 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-11-28 22:44:22,703 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-11-28 22:44:22,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:44:22,743 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-11-28 22:44:22,746 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-11-28 22:44:22,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,758 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-11-28 22:44:22,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-11-28 22:44:22,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:22,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:22,832 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-11-28 22:44:22,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,848 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-11-28 22:44:22,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,860 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-11-28 22:44:22,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-11-28 22:44:22,914 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-11-28 22:44:22,918 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-11-28 22:44:22,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,944 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-11-28 22:44:22,946 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-11-28 22:44:22,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:22,965 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-11-28 22:44:22,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-11-28 22:44:23,049 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-11-28 22:44:23,057 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-11-28 22:44:23,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,072 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-11-28 22:44:23,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-11-28 22:44:23,167 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-11-28 22:44:23,169 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-11-28 22:44:23,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,187 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-11-28 22:44:23,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 [2018-11-28 22:44:23,676 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-11-28 22:44:23,679 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-11-28 22:44:23,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:23,702 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-11-28 22:44:23,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:31 [2018-11-28 22:44:23,828 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-11-28 22:44:23,962 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-11-28 22:44:23,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:23,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:23,984 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-11-28 22:44:23,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:55 [2018-11-28 22:44:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:24,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:24,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-11-28 22:44:24,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 22:44:24,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 22:44:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 22:44:24,250 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-11-28 22:44:25,661 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-11-28 22:44:25,849 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-28 22:44:26,250 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-28 22:44:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:27,586 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-28 22:44:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 22:44:27,588 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-11-28 22:44:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:27,589 INFO L225 Difference]: With dead ends: 37 [2018-11-28 22:44:27,589 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 22:44:27,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=257, Invalid=2293, Unknown=0, NotChecked=0, Total=2550 [2018-11-28 22:44:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 22:44:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-28 22:44:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 22:44:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-28 22:44:27,593 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-11-28 22:44:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:27,593 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-28 22:44:27,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 22:44:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-28 22:44:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 22:44:27,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:27,597 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-11-28 22:44:27,597 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstpncpyErr11REQUIRES_VIOLATION, cstpncpyErr12REQUIRES_VIOLATION, cstpncpyErr1REQUIRES_VIOLATION, cstpncpyErr10REQUIRES_VIOLATION, cstpncpyErr0REQUIRES_VIOLATION, cstpncpyErr9REQUIRES_VIOLATION, cstpncpyErr7REQUIRES_VIOLATION, cstpncpyErr8REQUIRES_VIOLATION, cstpncpyErr6REQUIRES_VIOLATION, cstpncpyErr17REQUIRES_VIOLATION, cstpncpyErr15REQUIRES_VIOLATION, cstpncpyErr16REQUIRES_VIOLATION, cstpncpyErr5REQUIRES_VIOLATION, cstpncpyErr14REQUIRES_VIOLATION, cstpncpyErr3REQUIRES_VIOLATION, cstpncpyErr4REQUIRES_VIOLATION, cstpncpyErr2REQUIRES_VIOLATION, cstpncpyErr13REQUIRES_VIOLATION]=== [2018-11-28 22:44:27,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1516907499, now seen corresponding path program 2 times [2018-11-28 22:44:27,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:27,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:44:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:28,327 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-28 22:44:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:28,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:28,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 22:44:28,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:28,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:28,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:28,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:28,958 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-11-28 22:44:28,965 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-11-28 22:44:28,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:28,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:28,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:28,993 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-11-28 22:44:28,996 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-11-28 22:44:28,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-11-28 22:44:29,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:29,166 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-11-28 22:44:29,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:29,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:29,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:44:29,481 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-11-28 22:44:29,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:29,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-11-28 22:44:30,226 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 22:44:30,271 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-11-28 22:44:30,279 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-11-28 22:44:30,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,309 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-11-28 22:44:30,312 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-11-28 22:44:30,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-28 22:44:30,421 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-11-28 22:44:30,431 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-11-28 22:44:30,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,449 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-11-28 22:44:30,458 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-11-28 22:44:30,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:30,466 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-11-28 22:44:30,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-11-28 22:44:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:30,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:30,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-11-28 22:44:30,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 22:44:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 22:44:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 22:44:30,933 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-11-28 22:44:32,610 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-11-28 22:44:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:33,095 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-28 22:44:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 22:44:33,099 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-11-28 22:44:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:33,100 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:44:33,100 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:33,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=344, Invalid=2736, Unknown=0, NotChecked=0, Total=3080 [2018-11-28 22:44:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:33,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-28 22:44:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:33,102 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:33,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 22:44:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:33,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:33 BoogieIcfgContainer [2018-11-28 22:44:33,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:33,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:33,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:33,108 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:33,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:50" (3/4) ... [2018-11-28 22:44:33,113 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:33,120 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:33,121 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:33,121 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:33,121 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstpncpy [2018-11-28 22:44:33,121 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:33,127 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 22:44:33,127 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 22:44:33,127 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 22:44:33,177 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:33,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:33,179 INFO L168 Benchmark]: Toolchain (without parser) took 44589.19 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 452.5 MB). Free memory was 948.7 MB in the beginning and 1.4 GB in the end (delta: -430.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:33,179 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:33,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:33,181 INFO L168 Benchmark]: Boogie Preprocessor took 66.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:33,182 INFO L168 Benchmark]: RCFGBuilder took 956.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:33,183 INFO L168 Benchmark]: TraceAbstraction took 42804.62 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -309.6 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:33,183 INFO L168 Benchmark]: Witness Printer took 69.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:33,186 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 956.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42804.62 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -309.6 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Witness Printer took 69.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. 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: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 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: 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 - 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 - 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: 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: 551]: 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: 549]: 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, 42.7s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 1205 SDslu, 4124 SDs, 0 SdLazy, 4633 SolverSat, 417 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2837 ImplicationChecksByTransitivity, 28.8s 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 111 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.3s 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...