./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_cstrcspn-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 b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:32,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:32,798 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:32,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:32,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:32,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:32,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:32,817 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:32,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:32,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:32,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:32,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:32,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:32,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:32,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:32,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:32,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:32,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:32,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:32,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:32,845 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:32,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:32,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:32,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:32,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:32,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:32,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:32,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:32,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:32,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:32,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:32,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:32,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:32,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:32,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:32,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:32,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 21:56:32,894 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:32,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:32,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:32,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:32,896 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:32,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:32,896 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:32,896 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:32,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:32,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:32,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:32,899 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:32,899 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:32,899 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:32,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:32,900 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:32,900 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:32,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:32,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:32,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:32,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:32,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:32,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:32,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:32,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 21:56:32,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:32,904 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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2019-01-13 21:56:32,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:32,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:32,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:32,966 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:32,966 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:32,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:33,023 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6b39568/b9cd1de67b19438e92adefd84be9b945/FLAGf7bed75c4 [2019-01-13 21:56:33,472 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:33,475 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:33,497 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6b39568/b9cd1de67b19438e92adefd84be9b945/FLAGf7bed75c4 [2019-01-13 21:56:33,775 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6b39568/b9cd1de67b19438e92adefd84be9b945 [2019-01-13 21:56:33,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:33,781 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:33,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:33,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:33,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:33,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54188bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:33, skipping insertion in model container [2019-01-13 21:56:33,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:33" (1/1) ... [2019-01-13 21:56:33,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:33,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:56:34,175 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:34,187 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:56:34,235 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:56:34,303 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:56:34,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34 WrapperNode [2019-01-13 21:56:34,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:34,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:56:34,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:56:34,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:56:34,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... [2019-01-13 21:56:34,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:56:34,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:56:34,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:56:34,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:56:34,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:56:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:56:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:56:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:56:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-01-13 21:56:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:56:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:56:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:56:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:56:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:56:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:56:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:56:34,554 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:56:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:56:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:56:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:56:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:56:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:56:34,555 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:56:34,556 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:56:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:56:34,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:56:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:56:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:56:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:56:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:56:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:56:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:56:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:56:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:56:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:56:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:56:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:56:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:56:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:56:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:56:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:56:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:56:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:56:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:56:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:56:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:56:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:56:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:56:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:56:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:56:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:56:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:56:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:56:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:56:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:56:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:56:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:56:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:56:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:56:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:56:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:56:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:56:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:56:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:56:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:56:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:56:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:56:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:56:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:56:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:56:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:56:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:56:34,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:56:34,584 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-01-13 21:56:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 21:56:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:56:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:56:34,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 21:56:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:56:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:56:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:56:35,318 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:56:35,320 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:56:35,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:35 BoogieIcfgContainer [2019-01-13 21:56:35,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:56:35,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:56:35,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:56:35,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:56:35,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:33" (1/3) ... [2019-01-13 21:56:35,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0b7ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:35, skipping insertion in model container [2019-01-13 21:56:35,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:34" (2/3) ... [2019-01-13 21:56:35,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0b7ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:56:35, skipping insertion in model container [2019-01-13 21:56:35,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:35" (3/3) ... [2019-01-13 21:56:35,330 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:35,340 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:56:35,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-13 21:56:35,367 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-13 21:56:35,391 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:56:35,392 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:56:35,392 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:56:35,393 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:56:35,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:56:35,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:56:35,394 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:56:35,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:56:35,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:56:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-13 21:56:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:35,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:35,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:35,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851682, now seen corresponding path program 1 times [2019-01-13 21:56:35,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:35,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:35,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:35,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:35,651 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-13 21:56:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:35,757 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-13 21:56:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:35,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:56:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:35,768 INFO L225 Difference]: With dead ends: 36 [2019-01-13 21:56:35,768 INFO L226 Difference]: Without dead ends: 33 [2019-01-13 21:56:35,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-13 21:56:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-13 21:56:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-13 21:56:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-13 21:56:35,804 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2019-01-13 21:56:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:35,805 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-13 21:56:35,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-13 21:56:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:56:35,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:35,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:35,806 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:35,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851683, now seen corresponding path program 1 times [2019-01-13 21:56:35,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:35,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:35,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:35,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:35,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:35,973 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2019-01-13 21:56:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,030 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-13 21:56:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:36,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:56:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,031 INFO L225 Difference]: With dead ends: 32 [2019-01-13 21:56:36,032 INFO L226 Difference]: Without dead ends: 32 [2019-01-13 21:56:36,033 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-13 21:56:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-13 21:56:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-13 21:56:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-13 21:56:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-13 21:56:36,038 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2019-01-13 21:56:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,038 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-13 21:56:36,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-13 21:56:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:36,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172715, now seen corresponding path program 1 times [2019-01-13 21:56:36,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:36,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:56:36,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:56:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:56:36,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:36,084 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2019-01-13 21:56:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,127 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-13 21:56:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:56:36,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:56:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,129 INFO L225 Difference]: With dead ends: 31 [2019-01-13 21:56:36,129 INFO L226 Difference]: Without dead ends: 31 [2019-01-13 21:56:36,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:56:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-13 21:56:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-13 21:56:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-13 21:56:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-13 21:56:36,136 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2019-01-13 21:56:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,137 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-13 21:56:36,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:56:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-13 21:56:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:56:36,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,139 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1341172714, now seen corresponding path program 1 times [2019-01-13 21:56:36,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:36,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:36,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:36,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:36,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:36,392 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-01-13 21:56:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,478 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-13 21:56:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:36,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:56:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,480 INFO L225 Difference]: With dead ends: 30 [2019-01-13 21:56:36,480 INFO L226 Difference]: Without dead ends: 30 [2019-01-13 21:56:36,480 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-13 21:56:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-13 21:56:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-13 21:56:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:56:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-13 21:56:36,485 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2019-01-13 21:56:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,485 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-13 21:56:36,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-13 21:56:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:36,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,487 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020149, now seen corresponding path program 1 times [2019-01-13 21:56:36,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:36,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:36,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:56:36,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:56:36,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:56:36,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:56:36,597 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2019-01-13 21:56:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:36,805 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-13 21:56:36,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:56:36,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-13 21:56:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:36,807 INFO L225 Difference]: With dead ends: 29 [2019-01-13 21:56:36,808 INFO L226 Difference]: Without dead ends: 29 [2019-01-13 21:56:36,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-13 21:56:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-13 21:56:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 21:56:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-13 21:56:36,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-01-13 21:56:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:36,819 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-13 21:56:36,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:56:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-13 21:56:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:56:36,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:36,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:36,820 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1317020148, now seen corresponding path program 1 times [2019-01-13 21:56:36,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:36,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:36,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:37,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:56:37,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:56:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:56:37,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:56:37,164 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-01-13 21:56:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:37,376 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-13 21:56:37,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:37,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 21:56:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:37,378 INFO L225 Difference]: With dead ends: 32 [2019-01-13 21:56:37,378 INFO L226 Difference]: Without dead ends: 32 [2019-01-13 21:56:37,379 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-13 21:56:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-13 21:56:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-13 21:56:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-13 21:56:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-13 21:56:37,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2019-01-13 21:56:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:37,385 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-13 21:56:37,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:56:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-13 21:56:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:37,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:37,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:37,386 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash -820999840, now seen corresponding path program 1 times [2019-01-13 21:56:37,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:37,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:37,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:56:37,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:56:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:56:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:56:37,484 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-01-13 21:56:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:37,637 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-13 21:56:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:56:37,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-13 21:56:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:37,639 INFO L225 Difference]: With dead ends: 31 [2019-01-13 21:56:37,639 INFO L226 Difference]: Without dead ends: 31 [2019-01-13 21:56:37,641 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-13 21:56:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-13 21:56:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-13 21:56:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:56:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-13 21:56:37,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2019-01-13 21:56:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:37,645 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-13 21:56:37,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:56:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-13 21:56:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:56:37,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:37,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:37,647 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -820999839, now seen corresponding path program 1 times [2019-01-13 21:56:37,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:37,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:37,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 21:56:37,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 21:56:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 21:56:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 21:56:37,955 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-01-13 21:56:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,155 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-13 21:56:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:56:38,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-13 21:56:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,157 INFO L225 Difference]: With dead ends: 34 [2019-01-13 21:56:38,157 INFO L226 Difference]: Without dead ends: 34 [2019-01-13 21:56:38,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:56:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-13 21:56:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-01-13 21:56:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-13 21:56:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-13 21:56:38,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-01-13 21:56:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,163 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-13 21:56:38,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 21:56:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-13 21:56:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:38,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,165 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-13 21:56:38,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2018091976, now seen corresponding path program 1 times [2019-01-13 21:56:38,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:38,399 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-13 21:56:38,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:38,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 21:56:38,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 21:56:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 21:56:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:38,401 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2019-01-13 21:56:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:38,700 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-01-13 21:56:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 21:56:38,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-13 21:56:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:38,704 INFO L225 Difference]: With dead ends: 56 [2019-01-13 21:56:38,704 INFO L226 Difference]: Without dead ends: 56 [2019-01-13 21:56:38,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-13 21:56:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-13 21:56:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-13 21:56:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 21:56:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-01-13 21:56:38,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2019-01-13 21:56:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:38,712 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-13 21:56:38,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 21:56:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-01-13 21:56:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:38,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:38,713 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-13 21:56:38,713 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2018089798, now seen corresponding path program 1 times [2019-01-13 21:56:38,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:38,988 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-13 21:56:38,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:38,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 21:56:38,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 21:56:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 21:56:38,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:56:38,989 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2019-01-13 21:56:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:39,338 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-01-13 21:56:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:56:39,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-13 21:56:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:39,343 INFO L225 Difference]: With dead ends: 94 [2019-01-13 21:56:39,343 INFO L226 Difference]: Without dead ends: 93 [2019-01-13 21:56:39,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-13 21:56:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-01-13 21:56:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-13 21:56:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-01-13 21:56:39,353 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2019-01-13 21:56:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:39,353 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-01-13 21:56:39,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 21:56:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-01-13 21:56:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:39,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:39,355 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-13 21:56:39,355 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1255809144, now seen corresponding path program 1 times [2019-01-13 21:56:39,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:39,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:39,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,784 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-13 21:56:39,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:39,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:39,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:39,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:39,906 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-13 21:56:39,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:56:39,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:39,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:39,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:39,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-13 21:56:40,390 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-13 21:56:40,404 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-13 21:56:40,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:40,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:40,429 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-13 21:56:40,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-13 21:56:40,581 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-13 21:56:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-01-13 21:56:40,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 21:56:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 21:56:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:56:40,610 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 20 states. [2019-01-13 21:56:41,307 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-01-13 21:56:41,463 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-01-13 21:56:41,936 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-13 21:56:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:42,231 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-01-13 21:56:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:56:42,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-01-13 21:56:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:42,235 INFO L225 Difference]: With dead ends: 105 [2019-01-13 21:56:42,235 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 21:56:42,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2019-01-13 21:56:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 21:56:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-01-13 21:56:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-13 21:56:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-01-13 21:56:42,248 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 23 [2019-01-13 21:56:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:42,248 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-01-13 21:56:42,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 21:56:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-01-13 21:56:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:56:42,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:42,250 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-13 21:56:42,250 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash 688527418, now seen corresponding path program 1 times [2019-01-13 21:56:42,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:42,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:42,709 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-13 21:56:42,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:42,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:42,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:42,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:42,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:42,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-13 21:56:42,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-13 21:56:42,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:56:42,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:42,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:43,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-01-13 21:56:43,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-13 21:56:43,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-13 21:56:43,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:43,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:43,300 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-13 21:56:43,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2019-01-13 21:56:43,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:43,322 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-13 21:56:43,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:43,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:43,346 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-13 21:56:43,347 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2019-01-13 21:56:43,530 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-13 21:56:43,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:43,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2019-01-13 21:56:43,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 21:56:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 21:56:43,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-01-13 21:56:43,551 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2019-01-13 21:56:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:44,929 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2019-01-13 21:56:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 21:56:44,930 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-01-13 21:56:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:44,932 INFO L225 Difference]: With dead ends: 121 [2019-01-13 21:56:44,932 INFO L226 Difference]: Without dead ends: 121 [2019-01-13 21:56:44,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 21:56:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-13 21:56:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-13 21:56:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 21:56:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2019-01-13 21:56:44,951 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 23 [2019-01-13 21:56:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:44,951 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2019-01-13 21:56:44,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 21:56:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2019-01-13 21:56:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:56:44,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:44,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:56:44,952 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:44,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1863036971, now seen corresponding path program 1 times [2019-01-13 21:56:44,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:44,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:56:45,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:56:45,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:56:45,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:56:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:56:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:45,066 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand 4 states. [2019-01-13 21:56:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:45,128 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2019-01-13 21:56:45,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:56:45,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-13 21:56:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:45,130 INFO L225 Difference]: With dead ends: 113 [2019-01-13 21:56:45,131 INFO L226 Difference]: Without dead ends: 91 [2019-01-13 21:56:45,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:56:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-13 21:56:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-13 21:56:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-13 21:56:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-13 21:56:45,137 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2019-01-13 21:56:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:45,138 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-13 21:56:45,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:56:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-01-13 21:56:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:56:45,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:45,139 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] [2019-01-13 21:56:45,139 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash -728587261, now seen corresponding path program 2 times [2019-01-13 21:56:45,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:45,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:56:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:45,558 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-13 21:56:45,791 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-13 21:56:46,006 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-13 21:56:46,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:46,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:46,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:46,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:46,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:46,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:46,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:46,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:46,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:46,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:46,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:46,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:56:46,412 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-13 21:56:46,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:46,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:46,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:46,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:46,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-01-13 21:56:46,706 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-13 21:56:46,837 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-13 21:56:46,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:46,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:46,871 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-13 21:56:46,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-13 21:56:46,983 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-13 21:56:47,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-01-13 21:56:47,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 21:56:47,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 21:56:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-01-13 21:56:47,012 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 24 states. [2019-01-13 21:56:47,982 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-01-13 21:56:48,158 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-01-13 21:56:48,777 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-01-13 21:56:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:48,843 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-01-13 21:56:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 21:56:48,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-01-13 21:56:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:48,846 INFO L225 Difference]: With dead ends: 102 [2019-01-13 21:56:48,846 INFO L226 Difference]: Without dead ends: 79 [2019-01-13 21:56:48,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2019-01-13 21:56:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-13 21:56:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-01-13 21:56:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-13 21:56:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-01-13 21:56:48,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 28 [2019-01-13 21:56:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:48,851 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-01-13 21:56:48,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 21:56:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-01-13 21:56:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 21:56:48,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:56:48,852 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-13 21:56:48,853 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-13 21:56:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:56:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -88962970, now seen corresponding path program 2 times [2019-01-13 21:56:48,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 21:56:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 21:56:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 21:56:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 21:56:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:56:49,304 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-13 21:56:49,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 21:56:49,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 21:56:49,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:56:49,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:56:49,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:56:49,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:56:49,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:56:49,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:56:49,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:56:49,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,482 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-01-13 21:56:49,510 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-13 21:56:49,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:49,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:49,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-13 21:56:49,557 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-13 21:56:49,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:56:49,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:56:49,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 21:56:49,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-01-13 21:56:49,957 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-13 21:56:49,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2019-01-13 21:56:49,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:56:50,095 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-13 21:56:50,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 21:56:50,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:50,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:56:50,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2019-01-13 21:56:50,358 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-13 21:56:50,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:56:50,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-01-13 21:56:50,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:56:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:56:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:56:50,377 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 25 states. [2019-01-13 21:56:52,779 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-01-13 21:56:54,538 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-01-13 21:56:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:56:56,397 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-13 21:56:56,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 21:56:56,398 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-01-13 21:56:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:56:56,399 INFO L225 Difference]: With dead ends: 59 [2019-01-13 21:56:56,399 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 21:56:56,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=197, Invalid=1285, Unknown=0, NotChecked=0, Total=1482 [2019-01-13 21:56:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 21:56:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 21:56:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 21:56:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 21:56:56,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-13 21:56:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:56:56,401 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 21:56:56,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:56:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 21:56:56,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 21:56:56,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 09:56:56 BoogieIcfgContainer [2019-01-13 21:56:56,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 21:56:56,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 21:56:56,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 21:56:56,408 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 21:56:56,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:56:35" (3/4) ... [2019-01-13 21:56:56,413 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 21:56:56,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 21:56:56,420 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2019-01-13 21:56:56,420 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 21:56:56,420 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 21:56:56,420 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 21:56:56,425 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-13 21:56:56,425 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-13 21:56:56,425 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 21:56:56,465 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-13 21:56:56,468 INFO L168 Benchmark]: Toolchain (without parser) took 22688.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 946.0 MB in the beginning and 992.0 MB in the end (delta: -46.0 MB). Peak memory consumption was 259.6 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,469 INFO L168 Benchmark]: CDTParser took 0.21 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-13 21:56:56,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.43 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 919.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,470 INFO L168 Benchmark]: Boogie Preprocessor took 171.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,471 INFO L168 Benchmark]: RCFGBuilder took 844.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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,471 INFO L168 Benchmark]: TraceAbstraction took 21085.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 992.0 MB in the end (delta: 85.9 MB). Peak memory consumption was 256.3 MB. Max. memory is 11.5 GB. [2019-01-13 21:56:56,472 INFO L168 Benchmark]: Witness Printer took 59.19 ms. Allocated memory is still 1.3 GB. Free memory is still 992.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 21:56:56,475 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 522.43 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 919.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 844.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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21085.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 992.0 MB in the end (delta: 85.9 MB). Peak memory consumption was 256.3 MB. Max. memory is 11.5 GB. * Witness Printer took 59.19 ms. Allocated memory is still 1.3 GB. Free memory is still 992.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 21.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 354 SDtfs, 659 SDslu, 1742 SDs, 0 SdLazy, 1748 SolverSat, 154 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 369 ConstructedInterpolants, 37 QuantifiedInterpolants, 98714 SizeOfPredicates, 57 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 8/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-13 21:56:58,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 21:56:58,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 21:56:58,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 21:56:58,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 21:56:58,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 21:56:58,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 21:56:58,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 21:56:58,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 21:56:58,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 21:56:58,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 21:56:58,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 21:56:58,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 21:56:58,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 21:56:58,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 21:56:58,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 21:56:58,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 21:56:58,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 21:56:58,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 21:56:58,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 21:56:58,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 21:56:58,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 21:56:58,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 21:56:58,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 21:56:58,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 21:56:58,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 21:56:58,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 21:56:58,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 21:56:58,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 21:56:58,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 21:56:58,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 21:56:58,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 21:56:58,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 21:56:58,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 21:56:58,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 21:56:58,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 21:56:58,804 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 21:56:58,825 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 21:56:58,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 21:56:58,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 21:56:58,827 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 21:56:58,827 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 21:56:58,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 21:56:58,827 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 21:56:58,827 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 21:56:58,828 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 21:56:58,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 21:56:58,829 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 21:56:58,829 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 21:56:58,829 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 21:56:58,829 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 21:56:58,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 21:56:58,829 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 21:56:58,830 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 21:56:58,830 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 21:56:58,830 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 21:56:58,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 21:56:58,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 21:56:58,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 21:56:58,832 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 21:56:58,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:56:58,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 21:56:58,832 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 21:56:58,833 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 21:56:58,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 21:56:58,834 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 21:56:58,834 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2019-01-13 21:56:58,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 21:56:58,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 21:56:58,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 21:56:58,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 21:56:58,898 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 21:56:58,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:58,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69532a3e/63da8393eb7943a6a156bbb891dead91/FLAG60e3d1ac5 [2019-01-13 21:56:59,390 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 21:56:59,391 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:56:59,407 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69532a3e/63da8393eb7943a6a156bbb891dead91/FLAG60e3d1ac5 [2019-01-13 21:56:59,729 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69532a3e/63da8393eb7943a6a156bbb891dead91 [2019-01-13 21:56:59,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 21:56:59,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 21:56:59,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 21:56:59,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 21:56:59,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 21:56:59,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:59" (1/1) ... [2019-01-13 21:56:59,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79cfa51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:56:59, skipping insertion in model container [2019-01-13 21:56:59,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 09:56:59" (1/1) ... [2019-01-13 21:56:59,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 21:56:59,801 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 21:57:00,168 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:00,193 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 21:57:00,338 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 21:57:00,397 INFO L195 MainTranslator]: Completed translation [2019-01-13 21:57:00,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00 WrapperNode [2019-01-13 21:57:00,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 21:57:00,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 21:57:00,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 21:57:00,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 21:57:00,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... [2019-01-13 21:57:00,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 21:57:00,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 21:57:00,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 21:57:00,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 21:57:00,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 21:57:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 21:57:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 21:57:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 21:57:00,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 21:57:00,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 21:57:00,537 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-01-13 21:57:00,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 21:57:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 21:57:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 21:57:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 21:57:00,537 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 21:57:00,538 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 21:57:00,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 21:57:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 21:57:00,541 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 21:57:00,542 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 21:57:00,543 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 21:57:00,544 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 21:57:00,544 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 21:57:00,545 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 21:57:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 21:57:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 21:57:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 21:57:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 21:57:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 21:57:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 21:57:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 21:57:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 21:57:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 21:57:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 21:57:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 21:57:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 21:57:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 21:57:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 21:57:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 21:57:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 21:57:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 21:57:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 21:57:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 21:57:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 21:57:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 21:57:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 21:57:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 21:57:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 21:57:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 21:57:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 21:57:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 21:57:00,556 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 21:57:00,556 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 21:57:00,556 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 21:57:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 21:57:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 21:57:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 21:57:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 21:57:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 21:57:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 21:57:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 21:57:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 21:57:00,560 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-01-13 21:57:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 21:57:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 21:57:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-01-13 21:57:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 21:57:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 21:57:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 21:57:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 21:57:01,294 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 21:57:01,295 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 21:57:01,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:01 BoogieIcfgContainer [2019-01-13 21:57:01,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 21:57:01,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 21:57:01,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 21:57:01,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 21:57:01,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 09:56:59" (1/3) ... [2019-01-13 21:57:01,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454add5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:01, skipping insertion in model container [2019-01-13 21:57:01,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 09:57:00" (2/3) ... [2019-01-13 21:57:01,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454add5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 09:57:01, skipping insertion in model container [2019-01-13 21:57:01,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:01" (3/3) ... [2019-01-13 21:57:01,306 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2019-01-13 21:57:01,313 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 21:57:01,320 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-13 21:57:01,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-13 21:57:01,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 21:57:01,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 21:57:01,365 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 21:57:01,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 21:57:01,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 21:57:01,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 21:57:01,366 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 21:57:01,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 21:57:01,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 21:57:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-13 21:57:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:01,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:01,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:01,392 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450496, now seen corresponding path program 1 times [2019-01-13 21:57:01,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:01,402 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:01,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:01,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:01,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:57:01,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:01,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:01,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:01,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-13 21:57:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:01,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:01,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:01,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:01,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:01,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:01,660 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-13 21:57:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:01,798 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-13 21:57:01,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:01,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 21:57:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:01,809 INFO L225 Difference]: With dead ends: 36 [2019-01-13 21:57:01,810 INFO L226 Difference]: Without dead ends: 33 [2019-01-13 21:57:01,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-13 21:57:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-13 21:57:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-13 21:57:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-13 21:57:01,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2019-01-13 21:57:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:01,851 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-13 21:57:01,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-13 21:57:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 21:57:01,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:01,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:01,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450497, now seen corresponding path program 1 times [2019-01-13 21:57:01,855 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:01,855 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:01,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:01,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:02,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:02,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:02,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:02,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,268 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:13 [2019-01-13 21:57:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:02,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 21:57:02,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:02,374 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2019-01-13 21:57:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:02,497 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-13 21:57:02,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:02,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-13 21:57:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:02,499 INFO L225 Difference]: With dead ends: 32 [2019-01-13 21:57:02,499 INFO L226 Difference]: Without dead ends: 32 [2019-01-13 21:57:02,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-13 21:57:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-13 21:57:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-13 21:57:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-13 21:57:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-13 21:57:02,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 10 [2019-01-13 21:57:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:02,506 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-13 21:57:02,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-13 21:57:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:02,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:02,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:02,507 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash -736544066, now seen corresponding path program 1 times [2019-01-13 21:57:02,509 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:02,509 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:02,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:02,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:02,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:57:02,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:02,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:02,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-13 21:57:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:02,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:02,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:02,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 21:57:02,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 21:57:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 21:57:02,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:02,775 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2019-01-13 21:57:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:02,967 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-13 21:57:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 21:57:02,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 21:57:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:02,969 INFO L225 Difference]: With dead ends: 31 [2019-01-13 21:57:02,969 INFO L226 Difference]: Without dead ends: 31 [2019-01-13 21:57:02,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 21:57:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-13 21:57:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-13 21:57:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-13 21:57:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-13 21:57:02,980 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2019-01-13 21:57:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:02,981 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-13 21:57:02,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 21:57:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-13 21:57:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:02,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:02,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:02,985 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash -736544065, now seen corresponding path program 1 times [2019-01-13 21:57:02,992 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:02,992 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:03,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:03,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:03,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:03,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:03,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:03,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-01-13 21:57:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:03,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:03,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:03,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:03,293 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-01-13 21:57:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:03,339 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-01-13 21:57:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:03,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:57:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:03,343 INFO L225 Difference]: With dead ends: 38 [2019-01-13 21:57:03,343 INFO L226 Difference]: Without dead ends: 38 [2019-01-13 21:57:03,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-13 21:57:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-01-13 21:57:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-13 21:57:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-01-13 21:57:03,354 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2019-01-13 21:57:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-01-13 21:57:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-01-13 21:57:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 21:57:03,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:03,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:03,356 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:03,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash -736484483, now seen corresponding path program 1 times [2019-01-13 21:57:03,356 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:03,357 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:03,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:03,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:03,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:03,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:03,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:03,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:03,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-13 21:57:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:03,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:03,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:03,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 21:57:03,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 21:57:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 21:57:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:03,639 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-01-13 21:57:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:03,737 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-13 21:57:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 21:57:03,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-13 21:57:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:03,741 INFO L225 Difference]: With dead ends: 33 [2019-01-13 21:57:03,741 INFO L226 Difference]: Without dead ends: 33 [2019-01-13 21:57:03,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 21:57:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-13 21:57:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-01-13 21:57:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:57:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-13 21:57:03,746 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2019-01-13 21:57:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:03,746 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-13 21:57:03,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 21:57:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-13 21:57:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:57:03,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:03,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:03,748 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1534562804, now seen corresponding path program 1 times [2019-01-13 21:57:03,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:03,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:03,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:03,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:03,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:03,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:03,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 21:57:03,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 21:57:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 21:57:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 21:57:03,903 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2019-01-13 21:57:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:04,198 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-01-13 21:57:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 21:57:04,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-13 21:57:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:04,200 INFO L225 Difference]: With dead ends: 29 [2019-01-13 21:57:04,200 INFO L226 Difference]: Without dead ends: 29 [2019-01-13 21:57:04,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-13 21:57:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-13 21:57:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-13 21:57:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-13 21:57:04,206 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-01-13 21:57:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:04,206 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-13 21:57:04,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 21:57:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-13 21:57:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 21:57:04,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:04,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:04,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1534562805, now seen corresponding path program 1 times [2019-01-13 21:57:04,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:04,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:04,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:04,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:04,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:04,519 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-01-13 21:57:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:04,982 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-13 21:57:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:04,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 21:57:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:04,985 INFO L225 Difference]: With dead ends: 32 [2019-01-13 21:57:04,985 INFO L226 Difference]: Without dead ends: 32 [2019-01-13 21:57:04,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:57:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-13 21:57:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-13 21:57:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-13 21:57:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-13 21:57:04,991 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2019-01-13 21:57:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:04,991 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-13 21:57:04,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-13 21:57:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:57:04,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:04,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:04,993 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 528612350, now seen corresponding path program 1 times [2019-01-13 21:57:04,994 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:04,994 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:05,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:05,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:05,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:05,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:57:05,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:05,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-13 21:57:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:05,191 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:05,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:05,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:05,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 21:57:05,194 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-01-13 21:57:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:05,397 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-13 21:57:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:57:05,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-13 21:57:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:05,399 INFO L225 Difference]: With dead ends: 31 [2019-01-13 21:57:05,399 INFO L226 Difference]: Without dead ends: 31 [2019-01-13 21:57:05,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-13 21:57:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-13 21:57:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-13 21:57:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-13 21:57:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-13 21:57:05,404 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2019-01-13 21:57:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:05,404 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-13 21:57:05,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:57:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-13 21:57:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:57:05,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:05,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:05,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash 528612351, now seen corresponding path program 1 times [2019-01-13 21:57:05,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:05,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:05,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:05,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:05,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:05,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:05,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:05,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:05,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-01-13 21:57:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:05,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:05,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:05,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:05,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:05,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:05,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:05,779 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-01-13 21:57:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,154 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-01-13 21:57:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:57:06,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-13 21:57:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,157 INFO L225 Difference]: With dead ends: 56 [2019-01-13 21:57:06,157 INFO L226 Difference]: Without dead ends: 56 [2019-01-13 21:57:06,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:57:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-13 21:57:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-01-13 21:57:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-13 21:57:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-01-13 21:57:06,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2019-01-13 21:57:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,164 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-01-13 21:57:06,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-01-13 21:57:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-13 21:57:06,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:06,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:06,167 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1229676929, now seen corresponding path program 1 times [2019-01-13 21:57:06,167 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:06,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:06,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:06,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:06,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:06,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:06,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:06,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-01-13 21:57:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:06,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:06,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:06,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 21:57:06,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 21:57:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 21:57:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 21:57:06,527 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 8 states. [2019-01-13 21:57:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:06,876 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-01-13 21:57:06,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 21:57:06,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-13 21:57:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:06,881 INFO L225 Difference]: With dead ends: 55 [2019-01-13 21:57:06,882 INFO L226 Difference]: Without dead ends: 55 [2019-01-13 21:57:06,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-13 21:57:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-13 21:57:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2019-01-13 21:57:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-13 21:57:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-01-13 21:57:06,887 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-01-13 21:57:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:06,887 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-01-13 21:57:06,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 21:57:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-01-13 21:57:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:57:06,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:06,889 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-13 21:57:06,889 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1818219299, now seen corresponding path program 1 times [2019-01-13 21:57:06,889 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:06,889 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:06,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:06,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:07,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-01-13 21:57:07,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2019-01-13 21:57:07,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-13 21:57:07,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-13 21:57:07,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-13 21:57:07,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:07,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-13 21:57:07,229 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-13 21:57:07,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:07,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:07,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 21:57:07,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 21:57:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 21:57:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-13 21:57:07,234 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2019-01-13 21:57:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:07,957 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-13 21:57:07,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 21:57:07,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-13 21:57:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:07,960 INFO L225 Difference]: With dead ends: 61 [2019-01-13 21:57:07,960 INFO L226 Difference]: Without dead ends: 61 [2019-01-13 21:57:07,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-01-13 21:57:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-13 21:57:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2019-01-13 21:57:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-13 21:57:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-01-13 21:57:07,967 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2019-01-13 21:57:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:07,967 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-01-13 21:57:07,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 21:57:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-01-13 21:57:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:57:07,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:07,969 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-13 21:57:07,969 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1818217121, now seen corresponding path program 1 times [2019-01-13 21:57:07,971 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:07,971 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:07,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:08,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:08,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:57:08,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:08,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:08,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-13 21:57:08,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 15 treesize of output 12 [2019-01-13 21:57:08,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 21:57:08,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:08,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:08,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:08,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2019-01-13 21:57:08,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-13 21:57:08,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2019-01-13 21:57:08,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:08,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:08,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:08,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-01-13 21:57:08,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-01-13 21:57:08,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-13 21:57:08,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:08,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:08,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:08,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-01-13 21:57:09,224 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-01-13 21:57:09,719 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-13 21:57:09,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 21:57:12,554 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-13 21:57:12,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2019-01-13 21:57:12,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:13,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2019-01-13 21:57:13,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:13,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-01-13 21:57:13,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:14,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2019-01-13 21:57:14,212 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-13 21:57:14,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:57:14,223 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:14,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 21:57:14,307 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 21:57:14,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 21:57:14,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-13 21:57:14,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:14,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:14,417 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:14,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2019-01-13 21:57:15,031 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-01-13 21:57:15,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:57:15,045 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:15,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 21:57:15,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 21:57:15,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 21:57:15,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-13 21:57:15,146 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:15,165 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:15,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:15,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2019-01-13 21:57:15,925 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-13 21:57:15,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:57:15,955 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:16,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 21:57:18,068 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= main_~nondetString1~0.offset (bvadd main_~nondetString1~0.offset main_~length1~0 (_ bv4294967295 32))) [2019-01-13 21:57:18,072 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 21:57:18,074 INFO L303 Elim1Store]: Index analysis took 2012 ms [2019-01-13 21:57:18,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-13 21:57:18,076 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:18,098 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:57:18,181 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:18,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2019-01-13 21:57:18,649 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:245, output treesize:206 [2019-01-13 21:57:19,661 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-01-13 21:57:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (13)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 21:57:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-01-13 21:57:19,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-13 21:57:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-13 21:57:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-01-13 21:57:19,910 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 27 states. [2019-01-13 21:57:20,417 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-13 21:57:21,703 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-13 21:57:22,790 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-13 21:57:23,574 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-13 21:57:24,496 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-13 21:57:24,981 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-01-13 21:57:26,280 WARN L181 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-01-13 21:57:27,167 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-13 21:57:27,868 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-01-13 21:57:28,432 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-13 21:57:29,129 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-13 21:57:30,066 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-13 21:57:30,854 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-13 21:57:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:31,378 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-01-13 21:57:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-13 21:57:31,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-01-13 21:57:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:31,380 INFO L225 Difference]: With dead ends: 81 [2019-01-13 21:57:31,380 INFO L226 Difference]: Without dead ends: 81 [2019-01-13 21:57:31,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2019-01-13 21:57:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-13 21:57:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2019-01-13 21:57:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-13 21:57:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-01-13 21:57:31,389 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2019-01-13 21:57:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:31,389 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-13 21:57:31,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-13 21:57:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-01-13 21:57:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 21:57:31,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:31,392 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-13 21:57:31,392 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash 797150945, now seen corresponding path program 1 times [2019-01-13 21:57:31,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:31,393 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:31,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:31,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:57:31,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:57:31,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:57:31,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:31,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:31,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-13 21:57:31,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-13 21:57:31,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-13 21:57:31,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:31,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:31,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:31,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-01-13 21:57:32,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-13 21:57:32,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-13 21:57:32,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:32,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:32,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:32,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:38 [2019-01-13 21:57:32,301 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-13 21:57:32,476 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-13 21:57:32,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 21:57:33,024 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 21:57:34,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-01-13 21:57:34,265 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-01-13 21:57:34,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-13 21:57:34,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:34,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:34,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-01-13 21:57:34,434 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-01-13 21:57:34,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-13 21:57:34,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:34,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:34,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-13 21:57:34,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-13 21:57:34,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:34,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:34,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:57:34,724 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:119, output treesize:77 [2019-01-13 21:57:35,066 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-13 21:57:35,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:57:35,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-01-13 21:57:35,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-13 21:57:35,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-13 21:57:35,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-01-13 21:57:35,069 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 23 states. [2019-01-13 21:57:35,451 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-13 21:57:36,528 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-13 21:57:36,910 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-13 21:57:37,365 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-13 21:57:43,248 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-13 21:57:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:57:43,510 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2019-01-13 21:57:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 21:57:43,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-13 21:57:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:57:43,518 INFO L225 Difference]: With dead ends: 89 [2019-01-13 21:57:43,518 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 21:57:43,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 21:57:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 21:57:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2019-01-13 21:57:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-13 21:57:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2019-01-13 21:57:43,542 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 23 [2019-01-13 21:57:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:57:43,544 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2019-01-13 21:57:43,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-13 21:57:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2019-01-13 21:57:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 21:57:43,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:57:43,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:57:43,546 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:57:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:57:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 529534697, now seen corresponding path program 1 times [2019-01-13 21:57:43,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:57:43,552 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:57:43,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 21:57:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 21:57:43,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:57:43,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 21:57:43,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:43,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:57:43,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 21:57:44,213 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-13 21:57:44,388 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 21:57:44,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:44,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2019-01-13 21:57:44,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:44,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:44,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2019-01-13 21:57:44,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:44,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 21:57:44,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2019-01-13 21:57:44,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:57:44,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:57:44,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-13 21:57:44,570 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:38 [2019-01-13 21:57:50,014 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-13 21:57:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 21:57:50,017 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 21:57:50,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 21:57:50,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 21:57:50,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 21:57:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 21:57:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2019-01-13 21:57:50,020 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 7 states. [2019-01-13 21:58:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:12,432 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2019-01-13 21:58:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 21:58:12,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-13 21:58:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:12,435 INFO L225 Difference]: With dead ends: 76 [2019-01-13 21:58:12,435 INFO L226 Difference]: Without dead ends: 70 [2019-01-13 21:58:12,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=25, Invalid=45, Unknown=2, NotChecked=0, Total=72 [2019-01-13 21:58:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-13 21:58:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-13 21:58:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-13 21:58:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2019-01-13 21:58:12,439 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2019-01-13 21:58:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:12,440 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2019-01-13 21:58:12,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 21:58:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2019-01-13 21:58:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 21:58:12,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:12,441 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] [2019-01-13 21:58:12,441 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:58:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -634339967, now seen corresponding path program 2 times [2019-01-13 21:58:12,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:58:12,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:58:12,463 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-13 21:58:12,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:58:12,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:12,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:12,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:12,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:12,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:58:12,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:58:12,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:12,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-13 21:58:12,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-13 21:58:12,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-13 21:58:12,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:12,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:12,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:12,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2019-01-13 21:58:13,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-13 21:58:13,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-13 21:58:13,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:13,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:13,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:13,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:36 [2019-01-13 21:58:13,397 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-13 21:58:13,593 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-13 21:58:13,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 21:58:15,354 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 50 treesize of output 48 [2019-01-13 21:58:15,507 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-01-13 21:58:15,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-13 21:58:15,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:15,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:15,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-01-13 21:58:15,925 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-01-13 21:58:15,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-13 21:58:15,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:15,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:15,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-01-13 21:58:16,114 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-01-13 21:58:16,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-13 21:58:16,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:16,157 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:16,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:58:16,287 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:149, output treesize:105 [2019-01-13 21:58:16,711 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-13 21:58:16,729 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-13 21:58:16,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:16,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-01-13 21:58:16,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-13 21:58:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-13 21:58:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-01-13 21:58:16,737 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 25 states. [2019-01-13 21:58:18,148 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-13 21:58:18,805 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-13 21:58:19,519 WARN L181 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-01-13 21:58:19,891 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-13 21:58:20,517 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-13 21:58:20,852 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-13 21:58:21,317 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-13 21:58:21,808 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-01-13 21:58:22,447 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-13 21:58:23,421 WARN L181 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-13 21:58:24,385 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-13 21:58:25,280 WARN L181 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-01-13 21:58:25,996 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-01-13 21:58:26,482 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-13 21:58:27,071 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-01-13 21:58:27,741 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-13 21:58:28,304 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-01-13 21:58:28,915 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-13 21:58:29,576 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-13 21:58:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:58:30,349 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-01-13 21:58:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-13 21:58:30,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-01-13 21:58:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:58:30,353 INFO L225 Difference]: With dead ends: 118 [2019-01-13 21:58:30,354 INFO L226 Difference]: Without dead ends: 118 [2019-01-13 21:58:30,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=423, Invalid=1929, Unknown=0, NotChecked=0, Total=2352 [2019-01-13 21:58:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-13 21:58:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-01-13 21:58:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 21:58:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-01-13 21:58:30,361 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 28 [2019-01-13 21:58:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:58:30,361 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-01-13 21:58:30,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-13 21:58:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-01-13 21:58:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 21:58:30,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:58:30,365 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-13 21:58:30,366 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:58:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:58:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1416980659, now seen corresponding path program 2 times [2019-01-13 21:58:30,366 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:58:30,366 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:58:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 21:58:30,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 21:58:30,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:58:30,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:58:30,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:58:30,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:58:30,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 21:58:30,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,779 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2019-01-13 21:58:30,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-13 21:58:30,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-13 21:58:30,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2019-01-13 21:58:30,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-13 21:58:30,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-13 21:58:30,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:30,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:58:31,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:31,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2019-01-13 21:58:31,910 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-13 21:58:31,957 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-13 21:58:32,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-01-13 21:58:32,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:32,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-13 21:58:32,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:32,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:32,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:58:32,127 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-01-13 21:58:32,401 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-13 21:58:32,808 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-13 21:58:32,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 21:58:36,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2019-01-13 21:58:36,612 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-01-13 21:58:36,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-01-13 21:58:36,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:36,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:36,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-01-13 21:58:37,023 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-01-13 21:58:37,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-01-13 21:58:37,031 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:37,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:37,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2019-01-13 21:58:37,479 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-01-13 21:58:37,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-01-13 21:58:37,489 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:37,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 21:58:37,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-13 21:58:37,803 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:109 [2019-01-13 21:58:38,247 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-13 21:58:38,255 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2019-01-13 21:58:38,255 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:60, output treesize:1 [2019-01-13 21:58:38,265 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-13 21:58:38,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:58:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-01-13 21:58:38,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-13 21:58:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-13 21:58:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-01-13 21:58:38,268 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 26 states. [2019-01-13 21:58:39,060 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-01-13 21:58:40,036 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-01-13 21:58:41,411 WARN L181 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-01-13 21:58:43,288 WARN L181 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-01-13 21:58:44,247 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-01-13 21:58:45,182 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-01-13 21:58:46,208 WARN L181 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-13 21:58:47,370 WARN L181 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-01-13 21:58:48,413 WARN L181 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-01-13 21:58:49,466 WARN L181 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-01-13 21:58:50,659 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-01-13 21:58:51,310 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-01-13 21:58:52,714 WARN L181 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2019-01-13 21:58:54,228 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-01-13 21:58:55,128 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-13 21:58:56,525 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-13 21:58:59,190 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-13 21:59:00,158 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-01-13 21:59:01,359 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-01-13 21:59:01,827 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-13 21:59:02,667 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-13 21:59:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 21:59:06,245 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2019-01-13 21:59:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-13 21:59:06,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2019-01-13 21:59:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 21:59:06,249 INFO L225 Difference]: With dead ends: 218 [2019-01-13 21:59:06,249 INFO L226 Difference]: Without dead ends: 218 [2019-01-13 21:59:06,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=370, Invalid=2178, Unknown=2, NotChecked=0, Total=2550 [2019-01-13 21:59:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-13 21:59:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2019-01-13 21:59:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-13 21:59:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 246 transitions. [2019-01-13 21:59:06,262 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 246 transitions. Word has length 31 [2019-01-13 21:59:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 21:59:06,262 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 246 transitions. [2019-01-13 21:59:06,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-13 21:59:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2019-01-13 21:59:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 21:59:06,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 21:59:06,266 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 21:59:06,267 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 21:59:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 21:59:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1211181343, now seen corresponding path program 3 times [2019-01-13 21:59:06,267 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 21:59:06,267 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 21:59:06,295 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-13 21:59:06,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-13 21:59:06,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 21:59:06,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 21:59:06,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 21:59:06,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 21:59:06,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 21:59:06,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 21:59:06,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:06,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-01-13 21:59:06,963 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-13 21:59:06,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 21:59:06,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:06,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:06,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:06,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:19 [2019-01-13 21:59:07,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 21:59:07,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2019-01-13 21:59:07,242 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:59:07,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:59:07,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 21:59:07,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:52 [2019-01-13 21:59:07,736 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-13 21:59:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-13 21:59:08,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 21:59:21,992 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 66 treesize of output 64 [2019-01-13 21:59:22,199 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2019-01-13 21:59:22,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-13 21:59:22,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:22,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:22,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-13 21:59:22,657 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-01-13 21:59:22,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-13 21:59:22,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 21:59:22,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 21:59:22,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 21:59:22,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:77 [2019-01-13 21:59:23,555 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-13 21:59:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-13 21:59:23,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 21:59:23,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-01-13 21:59:23,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-13 21:59:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-13 21:59:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=442, Unknown=6, NotChecked=0, Total=506 [2019-01-13 21:59:23,620 INFO L87 Difference]: Start difference. First operand 214 states and 246 transitions. Second operand 23 states. [2019-01-13 21:59:28,201 WARN L181 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-01-13 21:59:32,545 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-01-13 21:59:41,140 WARN L181 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-01-13 21:59:54,511 WARN L181 SmtUtils]: Spent 12.70 s on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-01-13 22:00:08,088 WARN L181 SmtUtils]: Spent 12.88 s on a formula simplification. DAG size of input: 122 DAG size of output: 74 [2019-01-13 22:00:24,542 WARN L181 SmtUtils]: Spent 13.59 s on a formula simplification. DAG size of input: 134 DAG size of output: 81 [2019-01-13 22:00:41,085 WARN L181 SmtUtils]: Spent 13.89 s on a formula simplification. DAG size of input: 138 DAG size of output: 84 [2019-01-13 22:00:55,599 WARN L181 SmtUtils]: Spent 13.26 s on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2019-01-13 22:01:10,138 WARN L181 SmtUtils]: Spent 13.56 s on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2019-01-13 22:01:24,182 WARN L181 SmtUtils]: Spent 13.39 s on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2019-01-13 22:01:40,892 WARN L181 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 140 DAG size of output: 86 [2019-01-13 22:01:58,109 WARN L181 SmtUtils]: Spent 14.14 s on a formula simplification. DAG size of input: 144 DAG size of output: 89 [2019-01-13 22:01:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:01:58,680 INFO L93 Difference]: Finished difference Result 213 states and 241 transitions. [2019-01-13 22:01:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 22:01:58,686 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-13 22:01:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:01:58,687 INFO L225 Difference]: With dead ends: 213 [2019-01-13 22:01:58,687 INFO L226 Difference]: Without dead ends: 213 [2019-01-13 22:01:58,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 166.4s TimeCoverageRelationStatistics Valid=230, Invalid=954, Unknown=6, NotChecked=0, Total=1190 [2019-01-13 22:01:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-13 22:01:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 103. [2019-01-13 22:01:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-13 22:01:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-13 22:01:58,693 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 43 [2019-01-13 22:01:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:01:58,695 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-13 22:01:58,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-13 22:01:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-13 22:01:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 22:01:58,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:01:58,697 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:01:58,697 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:01:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:01:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1336773295, now seen corresponding path program 3 times [2019-01-13 22:01:58,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:01:58,698 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:01:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:01:59,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-13 22:01:59,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:01:59,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:01:59,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 22:01:59,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 22:01:59,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 22:01:59,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-01-13 22:01:59,241 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-13 22:01:59,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-13 22:01:59,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:44 [2019-01-13 22:01:59,353 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-13 22:01:59,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 22:01:59,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:01:59,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-01-13 22:01:59,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-13 22:01:59,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2019-01-13 22:01:59,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 22:01:59,926 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-13 22:01:59,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:01:59,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 22:02:00,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-13 22:02:00,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:70 [2019-01-13 22:02:00,474 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-13 22:02:00,907 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-13 22:02:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-13 22:02:01,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:02:05,595 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-13 22:02:40,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 90 [2019-01-13 22:02:41,037 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-01-13 22:02:41,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 22:02:41,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:41,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 22:02:41,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:02:41,266 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:02:41,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-13 22:02:41,269 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:02:41,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:02:41,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 22:02:42,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 80 [2019-01-13 22:02:42,383 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-01-13 22:02:42,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-13 22:02:42,404 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:42,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-13 22:02:42,596 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:02:42,597 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:02:42,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-01-13 22:02:42,600 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:02:42,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:02:42,793 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-13 22:02:43,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-13 22:02:43,412 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:203, output treesize:187 [2019-01-13 22:02:45,668 WARN L181 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-13 22:02:45,955 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 1 [2019-01-13 22:02:45,955 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2019-01-13 22:02:45,955 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 20 variables, input treesize:245, output treesize:1 [2019-01-13 22:02:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-13 22:02:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:02:45,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-01-13 22:02:45,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-13 22:02:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-13 22:02:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=571, Unknown=9, NotChecked=0, Total=650 [2019-01-13 22:02:45,995 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 26 states. [2019-01-13 22:02:47,713 WARN L181 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-13 22:02:56,577 WARN L181 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-01-13 22:03:00,625 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 102 [2019-01-13 22:03:13,293 WARN L181 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-01-13 22:03:25,451 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 97 [2019-01-13 22:03:30,181 WARN L181 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-01-13 22:03:39,733 WARN L181 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-01-13 22:03:40,268 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-13 22:04:11,841 WARN L181 SmtUtils]: Spent 20.84 s on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-01-13 22:04:12,842 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-13 22:04:40,698 WARN L181 SmtUtils]: Spent 17.04 s on a formula simplification. DAG size of input: 140 DAG size of output: 87 [2019-01-13 22:04:42,317 WARN L181 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2019-01-13 22:04:58,051 WARN L181 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-01-13 22:04:58,577 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-13 22:05:20,705 WARN L181 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2019-01-13 22:05:21,434 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-13 22:05:36,452 WARN L181 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-01-13 22:06:05,147 WARN L181 SmtUtils]: Spent 16.81 s on a formula simplification. DAG size of input: 126 DAG size of output: 77 [2019-01-13 22:06:06,641 WARN L181 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-01-13 22:06:34,762 WARN L181 SmtUtils]: Spent 17.20 s on a formula simplification. DAG size of input: 148 DAG size of output: 83 [2019-01-13 22:06:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:06:37,378 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2019-01-13 22:06:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-13 22:06:37,379 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-13 22:06:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:06:37,380 INFO L225 Difference]: With dead ends: 117 [2019-01-13 22:06:37,380 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:06:37,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 243.7s TimeCoverageRelationStatistics Valid=253, Invalid=1864, Unknown=45, NotChecked=0, Total=2162 [2019-01-13 22:06:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:06:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:06:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:06:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:06:37,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-01-13 22:06:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:06:37,382 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:06:37,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-13 22:06:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:06:37,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:06:37,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:06:37 BoogieIcfgContainer [2019-01-13 22:06:37,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:06:37,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:06:37,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:06:37,388 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:06:37,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 09:57:01" (3/4) ... [2019-01-13 22:06:37,392 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:06:37,399 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:06:37,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:06:37,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2019-01-13 22:06:37,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-13 22:06:37,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-13 22:06:37,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:06:37,408 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-13 22:06:37,410 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-13 22:06:37,410 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:06:37,411 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:06:37,446 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:59) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromStep(CACSLBacktranslationValueProvider.java:1) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.GeneratedWitnessEdge.getSourceCode(GeneratedWitnessEdge.java:153) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.lambda$2(CorrectnessWitnessGenerator.java:95) at edu.uci.ics.jung.io.GraphMLWriter.writeEdgeData(GraphMLWriter.java:237) at de.uni_freiburg.informatik.ultimate.witnessprinter.graphml.UltimateGraphMLWriter.save(UltimateGraphMLWriter.java:106) at de.uni_freiburg.informatik.ultimate.witnessprinter.CorrectnessWitnessGenerator.makeGraphMLString(CorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:165) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:131) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-13 22:06:37,449 INFO L168 Benchmark]: Toolchain (without parser) took 577715.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.0 MB). Free memory was 951.4 MB in the beginning and 850.1 MB in the end (delta: 101.3 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:06:37,458 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:06:37,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-13 22:06:37,459 INFO L168 Benchmark]: Boogie Preprocessor took 73.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:06:37,459 INFO L168 Benchmark]: RCFGBuilder took 824.39 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:06:37,459 INFO L168 Benchmark]: TraceAbstraction took 576089.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 850.1 MB in the end (delta: 224.5 MB). Peak memory consumption was 375.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:06:37,460 INFO L168 Benchmark]: Witness Printer took 60.21 ms. Allocated memory is still 1.3 GB. Free memory is still 850.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:06:37,462 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 662.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 824.39 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 576089.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 850.1 MB in the end (delta: 224.5 MB). Peak memory consumption was 375.5 MB. Max. memory is 11.5 GB. * Witness Printer took 60.21 ms. Allocated memory is still 1.3 GB. Free memory is still 850.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 46 locations, 9 error locations. SAFE Result, 576.0s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 473.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 409 SDtfs, 898 SDslu, 2182 SDs, 0 SdLazy, 2614 SolverSat, 234 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 71.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 364 SyntacticMatches, 21 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 481.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 209 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 99.7s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 566 ConstructedInterpolants, 187 QuantifiedInterpolants, 647530 SizeOfPredicates, 188 NumberOfNonLiveVariables, 1548 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 182/352 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSLBacktranslationValueProvider.getStringFromIASTNode(CACSLBacktranslationValueProvider.java:78) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...