./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f 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/cstrspn-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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:02,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:02,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:02,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:02,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:02,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:02,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:02,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:02,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:02,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:02,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:02,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:02,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:02,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:02,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:02,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:02,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:02,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:02,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:02,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:02,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:02,651 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:02,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:02,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:02,654 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:02,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:02,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:02,658 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:02,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:02,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:02,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:02,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:02,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:02,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:02,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:02,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:02,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:02,680 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:02,680 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:02,681 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:02,682 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:02,682 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:02,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:02,683 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:02,683 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:02,683 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:02,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:02,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:02,684 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:02,684 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:02,684 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:02,684 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:02,684 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:02,685 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:02,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:02,685 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:02,685 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:02,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:02,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:02,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:02,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:02,687 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:02,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:02,687 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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2019-01-13 21:56:02,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:02,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:02,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:02,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:02,737 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:02,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:02,791 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8beb27b29/93786367109d4675bf54baec7184172a/FLAGc86e76a6c [2019-01-13 21:56:03,309 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:03,310 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:03,322 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8beb27b29/93786367109d4675bf54baec7184172a/FLAGc86e76a6c [2019-01-13 21:56:03,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8beb27b29/93786367109d4675bf54baec7184172a [2019-01-13 21:56:03,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:03,589 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:03,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:03,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:03,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:03,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:03" (1/1) ... [2019-01-13 21:56:03,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c8caa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:03, skipping insertion in model container [2019-01-13 21:56:03,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:03" (1/1) ... [2019-01-13 21:56:03,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:03,665 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:04,043 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:04,059 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:04,141 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:04,216 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:04,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04 WrapperNode [2019-01-13 21:56:04,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:04,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:04,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:04,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:04,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (1/1) ... [2019-01-13 21:56:04,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:04,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:04,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:04,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:04,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (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 [2019-01-13 21:56:04,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:04,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:04,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-01-13 21:56:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:04,492 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:04,496 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:04,502 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:04,508 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:04,508 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:04,509 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:05,280 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:05,281 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:56:05,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:05 BoogieIcfgContainer [2019-01-13 21:56:05,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:05,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:05,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:05,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:05,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:03" (1/3) ... [2019-01-13 21:56:05,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b0fc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:05, skipping insertion in model container [2019-01-13 21:56:05,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:04" (2/3) ... [2019-01-13 21:56:05,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b0fc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:05, skipping insertion in model container [2019-01-13 21:56:05,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:05" (3/3) ... [2019-01-13 21:56:05,292 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:05,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:05,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-01-13 21:56:05,327 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-01-13 21:56:05,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:05,354 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:05,355 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:05,355 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:05,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:05,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:05,356 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:05,356 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:05,356 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-13 21:56:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:05,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:05,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:05,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2019-01-13 21:56:05,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:05,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:05,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:05,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:05,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:05,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:05,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:05,663 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-01-13 21:56:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:05,782 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2019-01-13 21:56:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:05,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:05,792 INFO L225 Difference]: With dead ends: 48 [2019-01-13 21:56:05,792 INFO L226 Difference]: Without dead ends: 45 [2019-01-13 21:56:05,794 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 [2019-01-13 21:56:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-13 21:56:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-13 21:56:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 21:56:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-13 21:56:05,835 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2019-01-13 21:56:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:05,835 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-01-13 21:56:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-01-13 21:56:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:05,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:05,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:05,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2019-01-13 21:56:05,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:05,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:05,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:05,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:05,998 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2019-01-13 21:56:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,069 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-13 21:56:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:06,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,072 INFO L225 Difference]: With dead ends: 44 [2019-01-13 21:56:06,072 INFO L226 Difference]: Without dead ends: 44 [2019-01-13 21:56:06,073 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 [2019-01-13 21:56:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-13 21:56:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-13 21:56:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-01-13 21:56:06,080 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2019-01-13 21:56:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,081 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-01-13 21:56:06,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-01-13 21:56:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:06,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,083 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2019-01-13 21:56:06,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:06,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:06,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:06,187 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2019-01-13 21:56:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,264 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-13 21:56:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:06,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,266 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:06,267 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:06,268 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 [2019-01-13 21:56:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-13 21:56:06,277 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-01-13 21:56:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-13 21:56:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-13 21:56:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:06,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2019-01-13 21:56:06,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:06,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:06,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:06,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:06,355 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-01-13 21:56:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,388 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-01-13 21:56:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:06,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,390 INFO L225 Difference]: With dead ends: 42 [2019-01-13 21:56:06,391 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 21:56:06,391 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 [2019-01-13 21:56:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 21:56:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-13 21:56:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-13 21:56:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-13 21:56:06,404 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2019-01-13 21:56:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,408 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-13 21:56:06,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-13 21:56:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:06,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,409 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash -828291016, now seen corresponding path program 1 times [2019-01-13 21:56:06,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 21:56:06,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 21:56:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 21:56:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 21:56:06,510 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2019-01-13 21:56:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:06,885 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-01-13 21:56:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 21:56:06,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-01-13 21:56:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:06,887 INFO L225 Difference]: With dead ends: 40 [2019-01-13 21:56:06,887 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 21:56:06,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 21:56:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 21:56:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-13 21:56:06,892 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2019-01-13 21:56:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:06,892 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-13 21:56:06,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 21:56:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-01-13 21:56:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-13 21:56:06,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:06,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:06,894 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash -828291015, now seen corresponding path program 1 times [2019-01-13 21:56:06,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:06,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:06,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:06,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:07,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:07,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:07,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:07,087 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2019-01-13 21:56:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,439 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-01-13 21:56:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:07,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-13 21:56:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,445 INFO L225 Difference]: With dead ends: 62 [2019-01-13 21:56:07,445 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 21:56:07,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 21:56:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2019-01-13 21:56:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-13 21:56:07,452 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2019-01-13 21:56:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,453 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-13 21:56:07,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-13 21:56:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:07,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,454 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695426, now seen corresponding path program 1 times [2019-01-13 21:56:07,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:07,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:07,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:07,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:07,547 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2019-01-13 21:56:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:07,687 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-13 21:56:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:07,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-13 21:56:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:07,690 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:07,690 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:07,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-13 21:56:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 21:56:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-13 21:56:07,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2019-01-13 21:56:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:07,697 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-13 21:56:07,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-13 21:56:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:07,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:07,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:07,699 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695425, now seen corresponding path program 1 times [2019-01-13 21:56:07,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:07,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:07,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:08,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:08,003 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-01-13 21:56:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:08,205 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-01-13 21:56:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:08,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-13 21:56:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:08,207 INFO L225 Difference]: With dead ends: 55 [2019-01-13 21:56:08,207 INFO L226 Difference]: Without dead ends: 55 [2019-01-13 21:56:08,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-13 21:56:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-01-13 21:56:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-13 21:56:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-01-13 21:56:08,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2019-01-13 21:56:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:08,215 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-01-13 21:56:08,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-01-13 21:56:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 21:56:08,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:08,217 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] [2019-01-13 21:56:08,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash -145313269, now seen corresponding path program 1 times [2019-01-13 21:56:08,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:08,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:08,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:08,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:08,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:08,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:08,346 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2019-01-13 21:56:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:08,461 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-01-13 21:56:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:08,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-13 21:56:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:08,463 INFO L225 Difference]: With dead ends: 46 [2019-01-13 21:56:08,464 INFO L226 Difference]: Without dead ends: 41 [2019-01-13 21:56:08,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-13 21:56:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-13 21:56:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 21:56:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-13 21:56:08,468 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2019-01-13 21:56:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:08,469 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-13 21:56:08,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-13 21:56:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 21:56:08,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:08,470 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] [2019-01-13 21:56:08,470 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1476836758, now seen corresponding path program 1 times [2019-01-13 21:56:08,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:08,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:08,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:08,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:08,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:08,506 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-01-13 21:56:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:08,522 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-13 21:56:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:08,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-13 21:56:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:08,524 INFO L225 Difference]: With dead ends: 43 [2019-01-13 21:56:08,524 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 21:56:08,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 21:56:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 21:56:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 21:56:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-13 21:56:08,531 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2019-01-13 21:56:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:08,531 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-13 21:56:08,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-13 21:56:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:08,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:08,536 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] [2019-01-13 21:56:08,536 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1895057779, now seen corresponding path program 1 times [2019-01-13 21:56:08,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:08,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:08,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:56:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:08,777 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2019-01-13 21:56:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:09,281 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-01-13 21:56:09,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 21:56:09,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-01-13 21:56:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:09,283 INFO L225 Difference]: With dead ends: 64 [2019-01-13 21:56:09,284 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 21:56:09,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 21:56:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 21:56:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-01-13 21:56:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 21:56:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-01-13 21:56:09,292 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2019-01-13 21:56:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:09,292 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-01-13 21:56:09,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-01-13 21:56:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:09,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:09,296 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] [2019-01-13 21:56:09,296 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 306709877, now seen corresponding path program 1 times [2019-01-13 21:56:09,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:09,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:09,730 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 [2019-01-13 21:56:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:09,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:10,191 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 [2019-01-13 21:56:10,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:10,285 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 [2019-01-13 21:56:10,290 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 [2019-01-13 21:56:10,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-13 21:56:10,401 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 22 treesize of output 23 [2019-01-13 21:56:10,404 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 [2019-01-13 21:56:10,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:10,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2019-01-13 21:56:10,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-01-13 21:56:10,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-13 21:56:10,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,714 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 [2019-01-13 21:56:10,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:10,726 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2019-01-13 21:56:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 21:56:10,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 21:56:10,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2019-01-13 21:56:10,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 21:56:10,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 21:56:10,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:56:10,802 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2019-01-13 21:56:11,069 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-13 21:56:13,420 WARN L181 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-13 21:56:15,968 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-13 21:56:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:16,599 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-13 21:56:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 21:56:16,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-01-13 21:56:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:16,602 INFO L225 Difference]: With dead ends: 101 [2019-01-13 21:56:16,603 INFO L226 Difference]: Without dead ends: 86 [2019-01-13 21:56:16,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:56:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-13 21:56:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2019-01-13 21:56:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 21:56:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-01-13 21:56:16,610 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2019-01-13 21:56:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:16,610 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-01-13 21:56:16,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 21:56:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-01-13 21:56:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 21:56:16,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:16,613 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] [2019-01-13 21:56:16,614 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1403727160, now seen corresponding path program 1 times [2019-01-13 21:56:16,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:16,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 21:56:16,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 21:56:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 21:56:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:56:16,711 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 10 states. [2019-01-13 21:56:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:16,998 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-01-13 21:56:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:16,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-01-13 21:56:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:17,000 INFO L225 Difference]: With dead ends: 69 [2019-01-13 21:56:17,000 INFO L226 Difference]: Without dead ends: 51 [2019-01-13 21:56:17,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-01-13 21:56:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-13 21:56:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-01-13 21:56:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-13 21:56:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-01-13 21:56:17,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 25 [2019-01-13 21:56:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:17,004 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-01-13 21:56:17,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 21:56:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-01-13 21:56:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 21:56:17,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:17,005 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] [2019-01-13 21:56:17,008 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2074932103, now seen corresponding path program 1 times [2019-01-13 21:56:17,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:17,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:17,446 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 [2019-01-13 21:56:17,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:17,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:17,504 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 [2019-01-13 21:56:17,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:17,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:56:17,614 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 [2019-01-13 21:56:17,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,625 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. [2019-01-13 21:56:17,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:56:17,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:56:17,682 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 [2019-01-13 21:56:17,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:17,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:17,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:21,872 WARN L181 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-13 21:56:22,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2019-01-13 21:56:22,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-01-13 21:56:22,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-13 21:56:22,273 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 41 treesize of output 39 [2019-01-13 21:56:22,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:22,424 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 31 treesize of output 23 [2019-01-13 21:56:22,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:22,432 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 35 treesize of output 27 [2019-01-13 21:56:22,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:22,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2019-01-13 21:56:22,601 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:22,778 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 31 treesize of output 23 [2019-01-13 21:56:22,778 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:22,793 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 27 treesize of output 19 [2019-01-13 21:56:22,794 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:22,946 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 37 treesize of output 29 [2019-01-13 21:56:22,946 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:23,282 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 23 treesize of output 16 [2019-01-13 21:56:23,282 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:23,285 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 27 treesize of output 20 [2019-01-13 21:56:23,286 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:23,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2019-01-13 21:56:23,442 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-13 21:56:23,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 21:56:23,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:56:23,649 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2019-01-13 21:56:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:23,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-01-13 21:56:23,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-13 21:56:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-13 21:56:23,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2019-01-13 21:56:23,862 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2019-01-13 21:56:26,252 WARN L181 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-01-13 21:56:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:28,103 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-01-13 21:56:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 21:56:28,106 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-01-13 21:56:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:28,107 INFO L225 Difference]: With dead ends: 109 [2019-01-13 21:56:28,107 INFO L226 Difference]: Without dead ends: 109 [2019-01-13 21:56:28,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 21:56:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-13 21:56:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2019-01-13 21:56:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-13 21:56:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-01-13 21:56:28,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 27 [2019-01-13 21:56:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:28,116 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-01-13 21:56:28,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-13 21:56:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-01-13 21:56:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 21:56:28,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:28,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:28,119 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash -729755417, now seen corresponding path program 1 times [2019-01-13 21:56:28,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:28,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:28,529 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-13 21:56:28,699 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-13 21:56:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:28,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:28,983 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 [2019-01-13 21:56:28,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:29,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:29,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:29,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:29,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:29,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:29,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:56:29,151 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 15 treesize of output 12 [2019-01-13 21:56:29,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:56:29,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:29,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-01-13 21:56:29,313 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 19 treesize of output 15 [2019-01-13 21:56:29,328 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 15 treesize of output 12 [2019-01-13 21:56:29,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:29,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:29,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:29,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-01-13 21:56:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:29,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:29,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-01-13 21:56:29,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:56:29,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:56:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:56:29,547 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 22 states. [2019-01-13 21:56:30,390 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-01-13 21:56:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:31,085 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-01-13 21:56:31,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:56:31,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-01-13 21:56:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:31,088 INFO L225 Difference]: With dead ends: 92 [2019-01-13 21:56:31,088 INFO L226 Difference]: Without dead ends: 90 [2019-01-13 21:56:31,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 21:56:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-13 21:56:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2019-01-13 21:56:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-13 21:56:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-01-13 21:56:31,094 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2019-01-13 21:56:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:31,094 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-01-13 21:56:31,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:56:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-01-13 21:56:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 21:56:31,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:31,095 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:31,099 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:56:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1281582983, now seen corresponding path program 2 times [2019-01-13 21:56:31,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:31,373 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-13 21:56:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:31,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:31,595 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 [2019-01-13 21:56:31,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:31,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:31,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:31,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:31,787 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 [2019-01-13 21:56:31,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:31,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:31,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-13 21:56:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:56:31,822 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 [2019-01-13 21:56:31,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:31,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:31,835 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. [2019-01-13 21:56:31,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-01-13 21:56:31,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:56:31,875 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 [2019-01-13 21:56:31,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:31,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:31,898 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. [2019-01-13 21:56:31,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-01-13 21:56:33,235 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-13 21:56:33,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-13 21:56:33,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:33,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:33,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:56:33,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 33 [2019-01-13 21:56:33,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:33,792 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 35 treesize of output 27 [2019-01-13 21:56:33,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:33,797 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 31 treesize of output 23 [2019-01-13 21:56:33,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:33,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:33,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:33,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:51 [2019-01-13 21:56:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:33,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:33,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22] total 28 [2019-01-13 21:56:33,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-13 21:56:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-13 21:56:33,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2019-01-13 21:56:33,975 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 29 states. [2019-01-13 21:56:34,618 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-13 21:56:35,294 WARN L181 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-13 21:56:35,522 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-13 21:56:35,761 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-13 21:56:35,978 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-13 21:56:36,258 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-01-13 21:56:36,448 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-13 21:56:36,743 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-01-13 21:56:37,092 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-01-13 21:56:37,307 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-01-13 21:56:37,486 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-01-13 21:56:37,966 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-13 21:56:38,152 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-01-13 21:56:42,042 WARN L181 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-01-13 21:56:47,337 WARN L181 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-01-13 21:56:49,727 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-01-13 21:56:51,983 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-13 21:56:54,697 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-13 21:56:58,608 WARN L181 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-13 21:57:00,922 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2019-01-13 21:57:01,198 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-13 21:57:03,717 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-01-13 21:57:08,189 WARN L181 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-01-13 21:57:09,875 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-01-13 21:57:12,301 WARN L181 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-01-13 21:57:14,714 WARN L181 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-01-13 21:57:17,220 WARN L181 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-01-13 21:57:19,602 WARN L181 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-01-13 21:57:21,979 WARN L181 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-01-13 21:57:24,621 WARN L181 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-01-13 21:57:26,784 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-01-13 21:57:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:27,487 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2019-01-13 21:57:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-13 21:57:27,489 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2019-01-13 21:57:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:27,490 INFO L225 Difference]: With dead ends: 120 [2019-01-13 21:57:27,491 INFO L226 Difference]: Without dead ends: 120 [2019-01-13 21:57:27,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=634, Invalid=3788, Unknown=0, NotChecked=0, Total=4422 [2019-01-13 21:57:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-13 21:57:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2019-01-13 21:57:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-13 21:57:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-01-13 21:57:27,499 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 40 [2019-01-13 21:57:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:27,500 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-01-13 21:57:27,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-13 21:57:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-01-13 21:57:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 21:57:27,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:27,501 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:27,501 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2019-01-13 21:57:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash 178768069, now seen corresponding path program 1 times [2019-01-13 21:57:27,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:57:27,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:57:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:27,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:57:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:57:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-13 21:57:28,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:57:28,533 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 [2019-01-13 21:57:28,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:28,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:28,604 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 [2019-01-13 21:57:28,609 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 [2019-01-13 21:57:28,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-13 21:57:28,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,647 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:57:28,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 21:57:28,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 12 treesize of output 11 [2019-01-13 21:57:28,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-13 21:57:28,740 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 28 treesize of output 29 [2019-01-13 21:57:28,744 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 [2019-01-13 21:57:28,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:28,757 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. [2019-01-13 21:57:28,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-13 21:57:31,332 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 41 [2019-01-13 21:57:31,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-13 21:57:31,502 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 48 treesize of output 41 [2019-01-13 21:57:31,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:32,376 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 40 treesize of output 32 [2019-01-13 21:57:32,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:32,833 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 40 treesize of output 30 [2019-01-13 21:57:32,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:32,896 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 32 treesize of output 30 [2019-01-13 21:57:32,897 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:32,978 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 37 treesize of output 27 [2019-01-13 21:57:32,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:33,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2019-01-13 21:57:33,533 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-13 21:57:33,706 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 27 treesize of output 25 [2019-01-13 21:57:33,707 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:33,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2019-01-13 21:57:33,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:57:33,880 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2019-01-13 21:57:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 21:57:34,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:34,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2019-01-13 21:57:34,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-13 21:57:34,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-13 21:57:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:57:34,067 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 33 states. [2019-01-13 21:57:35,002 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-13 21:57:35,384 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-13 21:57:36,022 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-01-13 21:57:36,503 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-13 21:57:39,012 WARN L181 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 21:57:39,821 WARN L181 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-13 21:57:40,114 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-13 21:57:42,019 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-13 21:57:44,200 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-13 21:57:45,169 WARN L181 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-13 21:57:50,255 WARN L181 SmtUtils]: Spent 4.92 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-01-13 21:57:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:52,925 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-01-13 21:57:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-13 21:57:52,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-01-13 21:57:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:52,928 INFO L225 Difference]: With dead ends: 113 [2019-01-13 21:57:52,928 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:57:52,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=1159, Invalid=4242, Unknown=1, NotChecked=0, Total=5402 [2019-01-13 21:57:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:57:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:57:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:57:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:57:52,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-01-13 21:57:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:52,932 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:57:52,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-13 21:57:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:57:52,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:57:52,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:57:52 BoogieIcfgContainer [2019-01-13 21:57:52,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:57:52,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:57:52,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:57:52,939 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:57:52,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:05" (3/4) ... [2019-01-13 21:57:52,948 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:57:52,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:57:52,955 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:57:52,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:57:52,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:57:52,956 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2019-01-13 21:57:52,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-13 21:57:52,966 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-13 21:57:52,966 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:57:53,029 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 21:57:53,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 21:57:53,033 INFO L168 Benchmark]: Toolchain (without parser) took 109445.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -222.0 MB). Peak memory consumption was 150.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,036 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:57:53,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.55 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,036 INFO L168 Benchmark]: Boogie Preprocessor took 193.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,037 INFO L168 Benchmark]: RCFGBuilder took 870.34 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,037 INFO L168 Benchmark]: TraceAbstraction took 107654.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.6 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. [2019-01-13 21:57:53,037 INFO L168 Benchmark]: Witness Printer took 94.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 21:57:53,040 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.55 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 193.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 870.34 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107654.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.6 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. * Witness Printer took 94.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 107.5s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 86.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 1536 SDslu, 1943 SDs, 0 SdLazy, 3450 SolverSat, 289 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 91.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=16, 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, 17 MinimizatonAttempts, 163 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 535 ConstructedInterpolants, 89 QuantifiedInterpolants, 319687 SizeOfPredicates, 79 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 75/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...