./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-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/openbsd_cstrpbrk-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 37ce12f320cb92b62d01decbfb4f63ee1143a42a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-14 18:08:23,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:08:23,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:08:23,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:08:23,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:08:23,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:08:23,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:08:23,757 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:08:23,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:08:23,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:08:23,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:08:23,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:08:23,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:08:23,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:08:23,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:08:23,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:08:23,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:08:23,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:08:23,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:08:23,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:08:23,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:08:23,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:08:23,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:08:23,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:08:23,785 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:08:23,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:08:23,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:08:23,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:08:23,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:08:23,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:08:23,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:08:23,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:08:23,793 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:08:23,793 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:08:23,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:08:23,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:08:23,795 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:08:23,819 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:08:23,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:08:23,821 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:08:23,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:08:23,823 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:08:23,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:08:23,824 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:08:23,824 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:08:23,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:08:23,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:08:23,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:08:23,825 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:08:23,825 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:08:23,825 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:08:23,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:08:23,825 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:08:23,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:08:23,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:08:23,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:08:23,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:08:23,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:08:23,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:08:23,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:08:23,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:08:23,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:08:23,827 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 -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2019-01-14 18:08:23,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:08:23,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:08:23,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:08:23,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:08:23,886 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:08:23,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:23,945 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fe825b0/4f4b5bf338394662b463c645c9d7a46a/FLAGa0e406c2b [2019-01-14 18:08:24,430 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:08:24,431 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:24,444 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fe825b0/4f4b5bf338394662b463c645c9d7a46a/FLAGa0e406c2b [2019-01-14 18:08:24,752 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fe825b0/4f4b5bf338394662b463c645c9d7a46a [2019-01-14 18:08:24,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:08:24,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:08:24,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:08:24,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:08:24,763 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:08:24,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:08:24" (1/1) ... [2019-01-14 18:08:24,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a409c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:24, skipping insertion in model container [2019-01-14 18:08:24,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:08:24" (1/1) ... [2019-01-14 18:08:24,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:08:24,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:08:25,162 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:08:25,181 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:08:25,245 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:08:25,300 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:08:25,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25 WrapperNode [2019-01-14 18:08:25,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:08:25,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:08:25,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:08:25,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:08:25,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (1/1) ... [2019-01-14 18:08:25,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:08:25,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:08:25,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:08:25,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:08:25,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (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-14 18:08:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:08:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:08:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:08:25,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:08:25,494 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2019-01-14 18:08:25,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:08:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:08:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:08:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:08:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:08:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:08:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:08:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:08:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:08:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:08:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:08:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:08:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:08:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:08:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:08:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:08:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:08:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:08:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:08:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:08:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:08:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:08:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:08:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:08:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:08:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:08:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:08:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:08:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:08:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:08:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:08:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:08:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:08:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:08:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:08:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:08:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:08:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:08:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:08:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:08:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:08:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:08:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:08:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:08:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:08:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:08:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:08:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:08:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:08:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:08:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:08:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:08:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:08:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:08:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:08:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:08:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:08:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:08:26,190 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:08:26,191 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:08:26,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:26 BoogieIcfgContainer [2019-01-14 18:08:26,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:08:26,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:08:26,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:08:26,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:08:26,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:08:24" (1/3) ... [2019-01-14 18:08:26,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b6c21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:08:26, skipping insertion in model container [2019-01-14 18:08:26,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:08:25" (2/3) ... [2019-01-14 18:08:26,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b6c21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:08:26, skipping insertion in model container [2019-01-14 18:08:26,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:26" (3/3) ... [2019-01-14 18:08:26,199 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:08:26,209 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:08:26,217 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-14 18:08:26,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-14 18:08:26,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:08:26,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:08:26,260 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:08:26,261 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:08:26,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:08:26,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:08:26,261 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:08:26,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:08:26,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:08:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-01-14 18:08:26,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:08:26,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:26,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:26,290 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash -339131128, now seen corresponding path program 1 times [2019-01-14 18:08:26,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:26,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:26,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:26,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:26,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:26,462 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-14 18:08:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:08:26,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:08:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:08:26,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:26,481 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-01-14 18:08:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:26,602 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-14 18:08:26,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:08:26,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:08:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:26,614 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:08:26,615 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 18:08:26,617 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-14 18:08:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 18:08:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-14 18:08:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 18:08:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-01-14 18:08:26,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2019-01-14 18:08:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:26,654 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-01-14 18:08:26,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:08:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-01-14 18:08:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:08:26,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:26,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:26,656 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash -339131127, now seen corresponding path program 1 times [2019-01-14 18:08:26,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:26,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:26,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:26,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:26,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:26,826 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-14 18:08:26,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:26,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:26,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:26,830 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-01-14 18:08:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:26,885 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-14 18:08:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:26,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:08:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:26,888 INFO L225 Difference]: With dead ends: 34 [2019-01-14 18:08:26,888 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 18:08:26,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 18:08:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 18:08:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 18:08:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-14 18:08:26,896 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2019-01-14 18:08:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:26,897 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-14 18:08:26,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-14 18:08:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:08:26,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:26,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:26,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1923130343, now seen corresponding path program 1 times [2019-01-14 18:08:26,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:26,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:26,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:26,975 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-14 18:08:26,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:26,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:26,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:26,978 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-01-14 18:08:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:27,071 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 18:08:27,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:27,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 18:08:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:27,074 INFO L225 Difference]: With dead ends: 33 [2019-01-14 18:08:27,074 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 18:08:27,075 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-14 18:08:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 18:08:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-14 18:08:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:08:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 18:08:27,081 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 11 [2019-01-14 18:08:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:27,082 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 18:08:27,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-14 18:08:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 18:08:27,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:27,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:27,083 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1923130344, now seen corresponding path program 1 times [2019-01-14 18:08:27,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:27,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:27,150 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-14 18:08:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:08:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:08:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:08:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:08:27,153 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-01-14 18:08:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:27,210 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-14 18:08:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:08:27,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 18:08:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:27,212 INFO L225 Difference]: With dead ends: 32 [2019-01-14 18:08:27,212 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 18:08:27,213 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-14 18:08:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 18:08:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 18:08:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 18:08:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-14 18:08:27,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2019-01-14 18:08:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:27,220 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-14 18:08:27,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:08:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-14 18:08:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:08:27,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:27,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:27,221 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -675861453, now seen corresponding path program 1 times [2019-01-14 18:08:27,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:27,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:27,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:27,349 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-14 18:08:27,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:08:27,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:08:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:08:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:08:27,352 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-01-14 18:08:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:27,634 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-14 18:08:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:08:27,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 18:08:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:27,636 INFO L225 Difference]: With dead ends: 31 [2019-01-14 18:08:27,637 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 18:08:27,637 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-14 18:08:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 18:08:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-14 18:08:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 18:08:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 18:08:27,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-01-14 18:08:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:27,649 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 18:08:27,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:08:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-01-14 18:08:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:08:27,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:27,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:27,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash -675861452, now seen corresponding path program 1 times [2019-01-14 18:08:27,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:27,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:27,950 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-14 18:08:27,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:27,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:08:27,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:08:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:08:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:08:27,952 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2019-01-14 18:08:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:28,138 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-14 18:08:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:28,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-14 18:08:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:28,140 INFO L225 Difference]: With dead ends: 35 [2019-01-14 18:08:28,140 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 18:08:28,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:08:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 18:08:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-14 18:08:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:08:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 18:08:28,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2019-01-14 18:08:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:28,149 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 18:08:28,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:08:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-14 18:08:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:08:28,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:28,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:28,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1828195751, now seen corresponding path program 1 times [2019-01-14 18:08:28,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:28,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:28,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:28,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:28,264 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-14 18:08:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:28,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:08:28,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:08:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:08:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:08:28,266 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-01-14 18:08:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:28,442 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-01-14 18:08:28,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:08:28,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-14 18:08:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:28,447 INFO L225 Difference]: With dead ends: 37 [2019-01-14 18:08:28,447 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 18:08:28,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 18:08:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-01-14 18:08:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 18:08:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-14 18:08:28,453 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-01-14 18:08:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:28,454 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-14 18:08:28,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:08:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-14 18:08:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:08:28,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:28,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:28,456 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1828195750, now seen corresponding path program 1 times [2019-01-14 18:08:28,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:28,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:28,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:28,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:28,740 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-14 18:08:28,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:28,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:08:28,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:08:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:08:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:08:28,742 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-01-14 18:08:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:28,923 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-01-14 18:08:28,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:08:28,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-01-14 18:08:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:28,928 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:08:28,928 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 18:08:28,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:08:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 18:08:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-14 18:08:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 18:08:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-14 18:08:28,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2019-01-14 18:08:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:28,933 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-14 18:08:28,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:08:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-14 18:08:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:08:28,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:28,934 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-14 18:08:28,934 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash 663468183, now seen corresponding path program 1 times [2019-01-14 18:08:28,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:28,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:28,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:29,036 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-14 18:08:29,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:29,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:08:29,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:08:29,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:08:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:08:29,038 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-01-14 18:08:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:29,125 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 18:08:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:08:29,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-14 18:08:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:29,126 INFO L225 Difference]: With dead ends: 33 [2019-01-14 18:08:29,126 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 18:08:29,127 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-14 18:08:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 18:08:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 18:08:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 18:08:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-01-14 18:08:29,131 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2019-01-14 18:08:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:29,131 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-14 18:08:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:08:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-01-14 18:08:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:08:29,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:29,133 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:29,133 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 245581310, now seen corresponding path program 1 times [2019-01-14 18:08:29,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:29,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:29,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:29,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 18:08:29,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:08:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:08:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:08:29,564 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-01-14 18:08:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:29,757 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-01-14 18:08:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:08:29,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-14 18:08:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:29,758 INFO L225 Difference]: With dead ends: 38 [2019-01-14 18:08:29,759 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 18:08:29,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-14 18:08:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 18:08:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 18:08:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 18:08:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-14 18:08:29,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-14 18:08:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:29,763 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-14 18:08:29,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:08:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-14 18:08:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:08:29,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:29,764 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:29,764 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1342766592, now seen corresponding path program 1 times [2019-01-14 18:08:29,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:29,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:29,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:30,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:30,062 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-14 18:08:30,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:30,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:30,178 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-14 18:08:30,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:30,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:30,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-14 18:08:30,243 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-14 18:08:30,247 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-14 18:08:30,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:30,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:30,277 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-14 18:08:30,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-14 18:08:30,376 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-14 18:08:30,387 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-14 18:08:30,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:30,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:30,436 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-14 18:08:30,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-14 18:08:30,904 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 18:08:30,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-14 18:08:30,964 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-14 18:08:30,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:31,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:31,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:31,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:31,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:31,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-14 18:08:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:31,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:31,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2019-01-14 18:08:31,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 18:08:31,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 18:08:31,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:08:31,181 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 20 states. [2019-01-14 18:08:31,664 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2019-01-14 18:08:32,819 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-01-14 18:08:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:33,205 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-14 18:08:33,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 18:08:33,206 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-01-14 18:08:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:33,207 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:08:33,207 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:08:33,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-01-14 18:08:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:08:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-14 18:08:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 18:08:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 18:08:33,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 23 [2019-01-14 18:08:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:33,213 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 18:08:33,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 18:08:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-14 18:08:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:08:33,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:33,214 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:33,217 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1323993511, now seen corresponding path program 1 times [2019-01-14 18:08:33,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:33,677 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2019-01-14 18:08:33,952 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-14 18:08:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:34,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:08:34,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 18:08:34,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 18:08:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 18:08:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-14 18:08:34,265 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-01-14 18:08:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:34,662 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-01-14 18:08:34,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:08:34,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-01-14 18:08:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:34,664 INFO L225 Difference]: With dead ends: 64 [2019-01-14 18:08:34,664 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 18:08:34,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:08:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 18:08:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-01-14 18:08:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 18:08:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-01-14 18:08:34,672 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2019-01-14 18:08:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:34,672 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-01-14 18:08:34,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 18:08:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-01-14 18:08:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 18:08:34,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:34,673 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:34,673 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -264354391, now seen corresponding path program 1 times [2019-01-14 18:08:34,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:35,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:35,014 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-14 18:08:35,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:35,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:35,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-14 18:08:35,129 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-14 18:08:35,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:35,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:35,253 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-14 18:08:35,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 18:08:35,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 18:08:35,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:35,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:35,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:35,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:35,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-14 18:08:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:35,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:35,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-01-14 18:08:35,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 18:08:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 18:08:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:08:35,615 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 20 states. [2019-01-14 18:08:36,721 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-01-14 18:08:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:37,194 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-01-14 18:08:37,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 18:08:37,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-01-14 18:08:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:37,202 INFO L225 Difference]: With dead ends: 83 [2019-01-14 18:08:37,202 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 18:08:37,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2019-01-14 18:08:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 18:08:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-01-14 18:08:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 18:08:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-01-14 18:08:37,220 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2019-01-14 18:08:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:37,220 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-01-14 18:08:37,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 18:08:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-01-14 18:08:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 18:08:37,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:37,228 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:37,228 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1666919290, now seen corresponding path program 2 times [2019-01-14 18:08:37,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:37,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:37,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:37,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:08:37,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:37,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:37,813 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-14 18:08:37,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:37,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:37,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:37,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:37,886 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-14 18:08:37,907 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-14 18:08:37,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:37,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:37,954 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-14 18:08:37,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-14 18:08:38,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:38,246 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-14 18:08:38,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:38,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:38,255 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-14 18:08:38,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-14 18:08:38,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 18:08:38,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 18:08:38,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:38,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:38,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:38,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-14 18:08:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:38,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:38,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-14 18:08:38,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 18:08:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 18:08:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-01-14 18:08:38,640 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 24 states. [2019-01-14 18:08:39,744 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-01-14 18:08:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:40,388 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-01-14 18:08:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 18:08:40,389 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2019-01-14 18:08:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:40,391 INFO L225 Difference]: With dead ends: 82 [2019-01-14 18:08:40,391 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 18:08:40,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 18:08:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 18:08:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 57. [2019-01-14 18:08:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 18:08:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-01-14 18:08:40,398 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 29 [2019-01-14 18:08:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:40,399 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-01-14 18:08:40,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 18:08:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-01-14 18:08:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 18:08:40,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:08:40,402 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:08:40,402 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:08:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:08:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1321635786, now seen corresponding path program 2 times [2019-01-14 18:08:40,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:08:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:08:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:40,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:08:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:08:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:08:40,845 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-14 18:08:41,292 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-01-14 18:08:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:41,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:08:41,653 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-14 18:08:41,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:08:41,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:08:41,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:08:41,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:08:41,730 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-14 18:08:41,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,813 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-14 18:08:41,822 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-14 18:08:41,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,840 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-14 18:08:41,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 18:08:41,869 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-14 18:08:41,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,895 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-14 18:08:41,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 18:08:41,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 18:08:41,934 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-14 18:08:41,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:08:41,953 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-14 18:08:41,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-14 18:08:44,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-14 18:08:44,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-14 18:08:44,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:08:44,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 18:08:44,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 18:08:44,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:08:44,376 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-14 18:08:44,377 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-14 18:08:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:08:44,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:08:44,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-01-14 18:08:44,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 18:08:44,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 18:08:44,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-01-14 18:08:44,538 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 23 states. [2019-01-14 18:08:48,023 WARN L181 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-14 18:08:50,364 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-01-14 18:08:50,782 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-01-14 18:08:51,026 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-01-14 18:08:51,262 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-01-14 18:08:53,491 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-01-14 18:08:53,798 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-14 18:08:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:08:53,908 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-01-14 18:08:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 18:08:53,908 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-01-14 18:08:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:08:53,909 INFO L225 Difference]: With dead ends: 60 [2019-01-14 18:08:53,909 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:08:53,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 18:08:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:08:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:08:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:08:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:08:53,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-14 18:08:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:08:53,911 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:08:53,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 18:08:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:08:53,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:08:53,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:08:53 BoogieIcfgContainer [2019-01-14 18:08:53,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:08:53,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:08:53,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:08:53,921 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:08:53,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:08:26" (3/4) ... [2019-01-14 18:08:53,927 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:08:53,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:08:53,937 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2019-01-14 18:08:53,937 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:08:53,938 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:08:53,938 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:08:53,946 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-14 18:08:53,947 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 18:08:53,947 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 18:08:54,026 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:08:54,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:08:54,031 INFO L168 Benchmark]: Toolchain (without parser) took 29274.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -95.2 MB). Peak memory consumption was 216.3 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:54,033 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:08:54,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.13 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-14 18:08:54,034 INFO L168 Benchmark]: Boogie Preprocessor took 139.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -216.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:54,035 INFO L168 Benchmark]: RCFGBuilder took 751.16 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: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:54,035 INFO L168 Benchmark]: TraceAbstraction took 27727.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 205.0 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:54,036 INFO L168 Benchmark]: Witness Printer took 108.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-01-14 18:08:54,048 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 543.13 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 139.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -216.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 751.16 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: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27727.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 205.0 MB. Max. memory is 11.5 GB. * Witness Printer took 108.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 45 locations, 9 error locations. SAFE Result, 27.6s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 16.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 382 SDtfs, 661 SDslu, 1684 SDs, 0 SdLazy, 1515 SolverSat, 153 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=13, 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, 15 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 374 ConstructedInterpolants, 39 QuantifiedInterpolants, 96868 SizeOfPredicates, 54 NumberOfNonLiveVariables, 601 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...