./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f6e8c8b965f85c3429105401e9fda59f9f060cb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:17:02,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:17:02,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:17:02,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:17:02,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:17:02,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:17:02,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:17:02,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:17:02,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:17:02,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:17:02,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:17:02,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:17:02,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:17:02,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:17:02,738 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:17:02,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:17:02,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:17:02,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:17:02,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:17:02,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:17:02,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:17:02,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:17:02,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:17:02,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:17:02,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:17:02,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:17:02,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:17:02,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:17:02,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:17:02,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:17:02,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:17:02,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:17:02,750 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:17:02,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:17:02,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:17:02,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:17:02,752 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 20:17:02,762 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:17:02,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:17:02,763 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:17:02,763 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:17:02,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:17:02,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:17:02,764 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:17:02,764 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:17:02,764 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:17:02,764 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 20:17:02,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:17:02,766 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:17:02,766 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:17:02,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:17:02,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:17:02,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:17:02,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:17:02,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:17:02,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:17:02,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:17:02,767 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:17:02,767 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:17:02,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-12-02 20:17:02,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:17:02,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:17:02,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:17:02,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:17:02,800 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:17:02,800 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 20:17:02,835 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/data/9d0a0a838/3fb2ce7b8a2e4048a1d776a4e5dbf57c/FLAG74ea3e2ca [2018-12-02 20:17:03,262 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:17:03,262 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 20:17:03,268 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/data/9d0a0a838/3fb2ce7b8a2e4048a1d776a4e5dbf57c/FLAG74ea3e2ca [2018-12-02 20:17:03,276 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/data/9d0a0a838/3fb2ce7b8a2e4048a1d776a4e5dbf57c [2018-12-02 20:17:03,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:17:03,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 20:17:03,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:17:03,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:17:03,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:17:03,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e809d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03, skipping insertion in model container [2018-12-02 20:17:03,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:17:03,311 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:17:03,451 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:17:03,457 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:17:03,520 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:17:03,549 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:17:03,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03 WrapperNode [2018-12-02 20:17:03,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:17:03,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:17:03,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:17:03,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:17:03,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... [2018-12-02 20:17:03,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:17:03,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:17:03,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:17:03,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:17:03,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:17:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:17:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:17:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 20:17:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 20:17:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-12-02 20:17:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:17:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 20:17:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 20:17:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 20:17:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 20:17:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 20:17:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 20:17:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 20:17:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 20:17:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 20:17:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:17:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:17:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:17:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:17:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:17:03,843 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:17:03,843 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 20:17:03,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:03 BoogieIcfgContainer [2018-12-02 20:17:03,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:17:03,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:17:03,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:17:03,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:17:03,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:17:03" (1/3) ... [2018-12-02 20:17:03,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee98976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:17:03, skipping insertion in model container [2018-12-02 20:17:03,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:03" (2/3) ... [2018-12-02 20:17:03,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee98976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:17:03, skipping insertion in model container [2018-12-02 20:17:03,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:03" (3/3) ... [2018-12-02 20:17:03,847 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 20:17:03,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:17:03,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 20:17:03,866 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 20:17:03,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:17:03,879 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:17:03,879 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 20:17:03,879 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:17:03,880 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:17:03,880 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:17:03,880 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:17:03,880 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:17:03,880 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:17:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-02 20:17:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 20:17:03,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:03,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:03,895 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:03,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2018-12-02 20:17:03,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:03,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:03,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:03,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:03,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:17:03,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:17:04,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:17:04,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:17:04,006 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-02 20:17:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,035 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-02 20:17:04,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:17:04,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 20:17:04,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,041 INFO L225 Difference]: With dead ends: 48 [2018-12-02 20:17:04,042 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 20:17:04,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:17:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 20:17:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 20:17:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 20:17:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-02 20:17:04,063 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-02 20:17:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,063 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-02 20:17:04,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:17:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-02 20:17:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 20:17:04,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,064 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2018-12-02 20:17:04,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:17:04,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:17:04,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:17:04,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:17:04,101 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-02 20:17:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,115 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 20:17:04,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:17:04,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 20:17:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,116 INFO L225 Difference]: With dead ends: 44 [2018-12-02 20:17:04,116 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 20:17:04,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:17:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 20:17:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 20:17:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 20:17:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 20:17:04,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-02 20:17:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,120 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 20:17:04,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:17:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 20:17:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 20:17:04,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,121 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2018-12-02 20:17:04,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 20:17:04,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:17:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:17:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:17:04,147 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-12-02 20:17:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,173 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-02 20:17:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:17:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 20:17:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,173 INFO L225 Difference]: With dead ends: 43 [2018-12-02 20:17:04,173 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:17:04,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:17:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:17:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 20:17:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 20:17:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 20:17:04,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-02 20:17:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,176 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 20:17:04,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:17:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 20:17:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 20:17:04,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,177 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2018-12-02 20:17:04,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:17:04,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:17:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:17:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:17:04,210 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-02 20:17:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,219 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-02 20:17:04,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:17:04,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 20:17:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,219 INFO L225 Difference]: With dead ends: 42 [2018-12-02 20:17:04,219 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 20:17:04,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:17:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 20:17:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 20:17:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 20:17:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 20:17:04,222 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-02 20:17:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,222 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 20:17:04,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:17:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 20:17:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 20:17:04,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash -828291016, now seen corresponding path program 1 times [2018-12-02 20:17:04,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:17:04,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:17:04,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:17:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:17:04,246 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-02 20:17:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,284 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-02 20:17:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:17:04,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 20:17:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,284 INFO L225 Difference]: With dead ends: 40 [2018-12-02 20:17:04,285 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 20:17:04,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:17:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 20:17:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 20:17:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 20:17:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 20:17:04,287 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-02 20:17:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,287 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 20:17:04,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:17:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 20:17:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 20:17:04,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash -828291015, now seen corresponding path program 1 times [2018-12-02 20:17:04,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:17:04,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:17:04,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:17:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:17:04,349 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-02 20:17:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,431 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-02 20:17:04,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:17:04,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-02 20:17:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,433 INFO L225 Difference]: With dead ends: 62 [2018-12-02 20:17:04,433 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 20:17:04,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:17:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 20:17:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-02 20:17:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 20:17:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-02 20:17:04,436 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-02 20:17:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,437 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-02 20:17:04,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:17:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-02 20:17:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 20:17:04,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,437 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695426, now seen corresponding path program 1 times [2018-12-02 20:17:04,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:17:04,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:17:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:17:04,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:17:04,470 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-02 20:17:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,537 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-02 20:17:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:17:04,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 20:17:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,538 INFO L225 Difference]: With dead ends: 43 [2018-12-02 20:17:04,538 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:17:04,538 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 [2018-12-02 20:17:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:17:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-02 20:17:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 20:17:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-02 20:17:04,540 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-02 20:17:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,540 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 20:17:04,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:17:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-02 20:17:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 20:17:04,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,541 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695425, now seen corresponding path program 1 times [2018-12-02 20:17:04,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:17:04,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:17:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:17:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:17:04,612 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-02 20:17:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,686 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-02 20:17:04,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:17:04,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-02 20:17:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,687 INFO L225 Difference]: With dead ends: 55 [2018-12-02 20:17:04,687 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 20:17:04,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:17:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 20:17:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-02 20:17:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 20:17:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-02 20:17:04,690 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-02 20:17:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,690 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-02 20:17:04,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:17:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-02 20:17:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 20:17:04,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,690 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] [2018-12-02 20:17:04,690 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash -145313269, now seen corresponding path program 1 times [2018-12-02 20:17:04,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:17:04,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:17:04,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:17:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:17:04,732 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-02 20:17:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,767 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-02 20:17:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:17:04,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 20:17:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,768 INFO L225 Difference]: With dead ends: 46 [2018-12-02 20:17:04,768 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 20:17:04,769 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 [2018-12-02 20:17:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 20:17:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 20:17:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 20:17:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-02 20:17:04,771 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-02 20:17:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,771 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-02 20:17:04,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:17:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-02 20:17:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 20:17:04,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:04,772 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1476836758, now seen corresponding path program 1 times [2018-12-02 20:17:04,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:04,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:17:04,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:17:04,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:17:04,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:17:04,791 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-02 20:17:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,800 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-02 20:17:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:17:04,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 20:17:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,801 INFO L225 Difference]: With dead ends: 43 [2018-12-02 20:17:04,801 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:17:04,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:17:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:17:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 20:17:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 20:17:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-02 20:17:04,803 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-02 20:17:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,804 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-02 20:17:04,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:17:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-02 20:17:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:17:04,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,805 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] [2018-12-02 20:17:04,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1895057779, now seen corresponding path program 1 times [2018-12-02 20:17:04,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 20:17:04,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:04,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 20:17:04,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:17:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:17:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:17:04,891 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 8 states. [2018-12-02 20:17:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:04,947 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-02 20:17:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:17:04,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-02 20:17:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:04,953 INFO L225 Difference]: With dead ends: 51 [2018-12-02 20:17:04,953 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:17:04,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:17:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:17:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 20:17:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 20:17:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 20:17:04,955 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-12-02 20:17:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:04,955 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 20:17:04,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:17:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 20:17:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:17:04,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:04,956 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] [2018-12-02 20:17:04,956 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:04,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:04,956 INFO L82 PathProgramCache]: Analyzing trace with hash -99086927, now seen corresponding path program 1 times [2018-12-02 20:17:04,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:04,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:04,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:04,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:05,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:05,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:17:05,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:17:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:17:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:17:05,049 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-12-02 20:17:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:05,127 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-02 20:17:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:17:05,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-02 20:17:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:05,128 INFO L225 Difference]: With dead ends: 64 [2018-12-02 20:17:05,128 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 20:17:05,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 20:17:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 20:17:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-02 20:17:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 20:17:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-02 20:17:05,131 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2018-12-02 20:17:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:05,131 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-02 20:17:05,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:17:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-02 20:17:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 20:17:05,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:05,132 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] [2018-12-02 20:17:05,132 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:05,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1687434829, now seen corresponding path program 1 times [2018-12-02 20:17:05,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:05,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:05,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:17:05,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:17:05,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:05,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:17:05,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 20:17:05,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 20:17:05,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:05,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:05,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:17:05,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 20:17:05,423 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 18 treesize of output 14 [2018-12-02 20:17:05,432 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 14 treesize of output 11 [2018-12-02 20:17:05,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:05,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:17:05,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:17:05,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 20:17:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:05,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:17:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-02 20:17:05,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 20:17:05,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 20:17:05,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:17:05,536 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 19 states. [2018-12-02 20:17:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:06,559 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-02 20:17:06,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 20:17:06,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-02 20:17:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:06,560 INFO L225 Difference]: With dead ends: 86 [2018-12-02 20:17:06,560 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 20:17:06,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-02 20:17:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 20:17:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-02 20:17:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 20:17:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-02 20:17:06,565 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2018-12-02 20:17:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:06,566 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-02 20:17:06,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 20:17:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-02 20:17:06,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 20:17:06,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:06,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:06,567 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:06,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1403727160, now seen corresponding path program 1 times [2018-12-02 20:17:06,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:06,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:06,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:06,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:17:06,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:17:06,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:17:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:17:06,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:17:06,628 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 10 states. [2018-12-02 20:17:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:06,759 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-02 20:17:06,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 20:17:06,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-02 20:17:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:06,760 INFO L225 Difference]: With dead ends: 69 [2018-12-02 20:17:06,760 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 20:17:06,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:17:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 20:17:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-02 20:17:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 20:17:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-12-02 20:17:06,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 25 [2018-12-02 20:17:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:06,762 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-02 20:17:06,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:17:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-12-02 20:17:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 20:17:06,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:06,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:06,763 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:06,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2074932103, now seen corresponding path program 1 times [2018-12-02 20:17:06,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:06,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:06,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:07,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:17:07,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:17:07,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:07,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:17:07,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 20:17:07,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:07,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:07,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 20:17:07,127 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 [2018-12-02 20:17:07,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 20:17:07,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:07,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:07,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:17:07,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 20:17:07,161 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 [2018-12-02 20:17:07,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 20:17:07,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:07,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:07,172 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. [2018-12-02 20:17:07,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 20:17:08,349 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 20:17:08,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-02 20:17:08,453 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 45 treesize of output 38 [2018-12-02 20:17:08,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-02 20:17:08,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-02 20:17:08,571 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 34 treesize of output 32 [2018-12-02 20:17:08,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:08,626 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 28 treesize of output 20 [2018-12-02 20:17:08,627 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,628 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 24 treesize of output 16 [2018-12-02 20:17:08,628 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-02 20:17:08,682 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-12-02 20:17:08,746 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-02 20:17:08,818 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 29 treesize of output 27 [2018-12-02 20:17:08,818 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:08,885 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 34 treesize of output 26 [2018-12-02 20:17:08,885 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-02 20:17:08,887 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-02 20:17:08,889 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:08,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 20:17:08,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 20:17:08,976 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-02 20:17:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:09,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:17:09,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-12-02 20:17:09,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 20:17:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 20:17:09,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-12-02 20:17:09,071 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 31 states. [2018-12-02 20:17:12,119 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2018-12-02 20:17:12,943 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-12-02 20:17:13,799 WARN L180 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-12-02 20:17:15,587 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2018-12-02 20:17:16,938 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-12-02 20:17:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:17,057 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-02 20:17:17,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 20:17:17,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-12-02 20:17:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:17,058 INFO L225 Difference]: With dead ends: 109 [2018-12-02 20:17:17,058 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 20:17:17,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=293, Invalid=1963, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 20:17:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 20:17:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-12-02 20:17:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 20:17:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-12-02 20:17:17,062 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 27 [2018-12-02 20:17:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:17,063 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-12-02 20:17:17,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 20:17:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-12-02 20:17:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 20:17:17,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:17,064 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:17,064 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:17,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:17,064 INFO L82 PathProgramCache]: Analyzing trace with hash -729755417, now seen corresponding path program 2 times [2018-12-02 20:17:17,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:17,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:17,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:17,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:17,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:17,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:17:17,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:17:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:17:17,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:17:17,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:17:17,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:17:17,266 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 [2018-12-02 20:17:17,283 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 [2018-12-02 20:17:17,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:17,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:17:17,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:17,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-02 20:17:17,326 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 [2018-12-02 20:17:17,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 20:17:17,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:17,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:17,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:17,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 20:17:17,423 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 [2018-12-02 20:17:17,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 20:17:17,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:17,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:17:17,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:17:17,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-02 20:17:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:17:17,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-12-02 20:17:17,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 20:17:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 20:17:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-02 20:17:17,551 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 21 states. [2018-12-02 20:17:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:18,266 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-12-02 20:17:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 20:17:18,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-02 20:17:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:18,267 INFO L225 Difference]: With dead ends: 92 [2018-12-02 20:17:18,268 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 20:17:18,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 20:17:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 20:17:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-12-02 20:17:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 20:17:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-02 20:17:18,270 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-12-02 20:17:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:18,270 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-02 20:17:18,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 20:17:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-02 20:17:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 20:17:18,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:18,271 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:18,272 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:18,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1281582983, now seen corresponding path program 2 times [2018-12-02 20:17:18,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:18,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:18,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:17:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:17:18,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:17:18,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:17:18,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:17:18,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:17:18,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:17:18,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 [2018-12-02 20:17:18,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 20:17:18,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 20:17:18,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-12-02 20:17:18,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 20:17:18,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 20:17:18,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-02 20:17:18,537 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 [2018-12-02 20:17:18,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 20:17:18,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-12-02 20:17:18,915 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 46 treesize of output 40 [2018-12-02 20:17:18,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-02 20:17:18,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:18,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 20:17:18,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:18,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:17:18,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 20:17:18,950 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-12-02 20:17:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:17:19,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:17:19,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2018-12-02 20:17:19,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 20:17:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 20:17:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-12-02 20:17:19,074 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 27 states. [2018-12-02 20:17:20,246 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-12-02 20:17:21,725 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-12-02 20:17:22,124 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2018-12-02 20:17:22,453 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2018-12-02 20:17:22,875 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-12-02 20:17:23,366 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2018-12-02 20:17:23,672 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2018-12-02 20:17:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:25,149 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-12-02 20:17:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-02 20:17:25,150 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-12-02 20:17:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:25,150 INFO L225 Difference]: With dead ends: 106 [2018-12-02 20:17:25,150 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 20:17:25,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=787, Invalid=4183, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 20:17:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 20:17:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 60. [2018-12-02 20:17:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 20:17:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-02 20:17:25,152 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 40 [2018-12-02 20:17:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:25,152 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-02 20:17:25,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 20:17:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-02 20:17:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 20:17:25,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:17:25,153 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:17:25,153 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION]=== [2018-12-02 20:17:25,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:17:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 178768069, now seen corresponding path program 1 times [2018-12-02 20:17:25,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:17:25,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:17:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:25,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:17:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:17:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 20:17:25,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:17:25,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:17:25,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:17:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:17:25,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:17:25,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 20:17:25,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 20:17:25,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 20:17:25,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 20:17:25,405 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 [2018-12-02 20:17:25,406 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 [2018-12-02 20:17:25,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 20:17:25,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 20:17:25,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 20:17:25,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:17:25,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 20:17:25,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-02 20:17:27,767 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 20:17:27,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-12-02 20:17:27,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-12-02 20:17:27,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:27,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-02 20:17:27,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:27,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-12-02 20:17:27,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:27,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-12-02 20:17:27,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-02 20:17:27,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-12-02 20:17:27,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-02 20:17:28,063 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 34 treesize of output 24 [2018-12-02 20:17:28,063 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:28,064 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 39 treesize of output 29 [2018-12-02 20:17:28,064 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:28,066 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 38 treesize of output 28 [2018-12-02 20:17:28,066 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:28,126 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 26 treesize of output 16 [2018-12-02 20:17:28,127 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:28,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-12-02 20:17:28,128 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 20:17:28,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-12-02 20:17:28,186 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 20:17:28,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 20:17:28,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 20:17:28,266 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-12-02 20:17:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 20:17:28,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:17:28,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-12-02 20:17:28,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 20:17:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 20:17:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 20:17:28,381 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 33 states. [2018-12-02 20:17:31,866 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-12-02 20:17:32,445 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-02 20:17:32,618 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-12-02 20:17:35,603 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-02 20:17:37,073 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-12-02 20:17:37,380 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2018-12-02 20:17:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:17:37,457 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-02 20:17:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 20:17:37,457 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-12-02 20:17:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:17:37,458 INFO L225 Difference]: With dead ends: 84 [2018-12-02 20:17:37,458 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:17:37,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2018-12-02 20:17:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:17:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:17:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:17:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:17:37,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-12-02 20:17:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:17:37,459 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:17:37,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 20:17:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:17:37,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:17:37,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:17:37 BoogieIcfgContainer [2018-12-02 20:17:37,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:17:37,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:17:37,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:17:37,462 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:17:37,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:03" (3/4) ... [2018-12-02 20:17:37,464 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:17:37,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:17:37,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 20:17:37,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 20:17:37,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:17:37,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-12-02 20:17:37,471 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-02 20:17:37,471 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 20:17:37,471 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 20:17:37,495 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59becb31-cf92-4a0b-8783-c312d7e4bd27/bin-2019/uautomizer/witness.graphml [2018-12-02 20:17:37,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:17:37,496 INFO L168 Benchmark]: Toolchain (without parser) took 34217.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -223.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:17:37,496 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:17:37,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.4 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:17:37,496 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:17:37,496 INFO L168 Benchmark]: RCFGBuilder took 264.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:17:37,497 INFO L168 Benchmark]: TraceAbstraction took 33618.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -139.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:17:37,497 INFO L168 Benchmark]: Witness Printer took 33.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:17:37,497 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.4 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33618.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -139.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 33.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 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: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 33.5s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 25.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 535 SDtfs, 1767 SDslu, 2005 SDs, 0 SdLazy, 3322 SolverSat, 384 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 140 SyntacticMatches, 6 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 27.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 178 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 558 ConstructedInterpolants, 106 QuantifiedInterpolants, 321757 SizeOfPredicates, 74 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 75/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...