java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec9_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:08:20,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:08:20,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:08:20,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:08:20,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:08:20,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:08:20,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:08:20,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:08:20,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:08:20,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:08:20,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:08:20,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:08:20,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:08:20,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:08:20,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:08:20,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:08:20,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:08:20,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:08:20,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:08:20,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:08:20,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:08:20,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:08:20,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:08:20,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:08:20,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:08:20,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:08:20,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:08:20,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:08:20,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:08:20,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:08:20,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:08:20,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:08:20,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:08:20,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:08:20,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:08:20,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:08:20,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:08:20,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:08:20,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:08:20,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:08:20,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:08:20,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:08:20,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:08:20,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:08:20,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:08:20,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:08:20,350 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:08:20,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:08:20,351 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:08:20,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:08:20,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:08:20,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:08:20,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:08:20,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:08:20,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:08:20,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:08:20,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:08:20,354 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:08:20,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:08:20,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:08:20,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:08:20,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:08:20,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:08:20,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:08:20,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:08:20,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:08:20,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:08:20,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:08:20,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:08:20,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:08:20,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:08:20,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:08:20,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:08:20,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:08:20,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:08:20,429 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:08:20,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product20.cil.c [2019-10-02 14:08:20,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ddbe99c/e2bd5b91b1af462b95d0c7ae6b88d5e0/FLAG96d48d495 [2019-10-02 14:08:21,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:08:21,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product20.cil.c [2019-10-02 14:08:21,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ddbe99c/e2bd5b91b1af462b95d0c7ae6b88d5e0/FLAG96d48d495 [2019-10-02 14:08:21,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95ddbe99c/e2bd5b91b1af462b95d0c7ae6b88d5e0 [2019-10-02 14:08:21,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:08:21,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:08:21,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:08:21,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:08:21,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:08:21,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:08:21" (1/1) ... [2019-10-02 14:08:21,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:21, skipping insertion in model container [2019-10-02 14:08:21,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:08:21" (1/1) ... [2019-10-02 14:08:21,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:08:21,457 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:08:22,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:08:22,227 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:08:22,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:08:22,537 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:08:22,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22 WrapperNode [2019-10-02 14:08:22,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:08:22,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:08:22,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:08:22,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:08:22,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... [2019-10-02 14:08:22,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:08:22,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:08:22,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:08:22,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:08:22,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:08:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:08:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:08:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:08:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:08:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:08:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:08:22,825 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:08:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:08:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:08:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:08:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:08:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:08:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:08:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:08:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:08:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:08:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:08:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:08:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:08:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:08:22,829 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:08:22,830 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:08:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:08:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:08:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:08:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:08:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:08:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:08:22,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:08:22,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:08:22,832 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:08:22,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:08:22,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:08:22,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:08:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:08:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:08:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:08:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:08:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:08:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:08:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:08:22,837 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:08:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:08:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:08:22,838 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:08:22,839 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:08:22,839 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:08:22,839 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:08:22,839 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:08:22,839 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:08:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:08:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:08:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 14:08:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 14:08:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:08:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:08:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:08:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:08:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:08:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:08:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:08:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:08:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:08:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:08:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:08:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:08:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:08:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:08:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:08:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:08:22,848 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:08:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:08:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:08:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:08:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:08:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:08:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:08:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:08:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:08:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:08:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:08:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:08:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:08:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:08:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:08:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:08:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:08:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:08:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:08:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:08:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:08:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:08:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:08:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:08:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:08:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:08:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:08:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:08:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:08:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:08:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:08:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:08:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:08:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:08:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:08:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:08:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:08:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:08:22,868 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:08:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:08:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:08:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:08:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:08:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:08:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:08:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:08:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:08:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:08:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:08:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:08:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:08:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:08:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:08:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:08:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:08:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:08:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:08:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:08:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:08:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 14:08:22,880 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 14:08:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:08:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:08:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:08:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:08:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:08:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:08:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:08:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:08:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:08:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:08:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:08:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:08:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:08:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:08:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:08:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:08:24,999 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:08:25,000 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:08:25,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:08:25 BoogieIcfgContainer [2019-10-02 14:08:25,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:08:25,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:08:25,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:08:25,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:08:25,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:08:21" (1/3) ... [2019-10-02 14:08:25,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e3f3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:08:25, skipping insertion in model container [2019-10-02 14:08:25,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:08:22" (2/3) ... [2019-10-02 14:08:25,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e3f3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:08:25, skipping insertion in model container [2019-10-02 14:08:25,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:08:25" (3/3) ... [2019-10-02 14:08:25,009 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product20.cil.c [2019-10-02 14:08:25,019 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:08:25,031 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:08:25,048 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:08:25,092 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:08:25,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:08:25,093 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:08:25,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:08:25,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:08:25,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:08:25,093 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:08:25,094 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:08:25,094 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:08:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states. [2019-10-02 14:08:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 14:08:25,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:25,161 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:25,164 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1483923005, now seen corresponding path program 1 times [2019-10-02 14:08:25,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:08:25,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:08:25,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:08:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:08:25,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:08:25,773 INFO L87 Difference]: Start difference. First operand 563 states. Second operand 2 states. [2019-10-02 14:08:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:25,851 INFO L93 Difference]: Finished difference Result 764 states and 1044 transitions. [2019-10-02 14:08:25,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:08:25,853 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 14:08:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:25,877 INFO L225 Difference]: With dead ends: 764 [2019-10-02 14:08:25,877 INFO L226 Difference]: Without dead ends: 510 [2019-10-02 14:08:25,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:08:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-02 14:08:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2019-10-02 14:08:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-02 14:08:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 701 transitions. [2019-10-02 14:08:26,006 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 701 transitions. Word has length 154 [2019-10-02 14:08:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:26,009 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 701 transitions. [2019-10-02 14:08:26,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:08:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 701 transitions. [2019-10-02 14:08:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 14:08:26,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:26,024 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:26,025 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1309919830, now seen corresponding path program 1 times [2019-10-02 14:08:26,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:26,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:26,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:26,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:08:26,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:26,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:26,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:26,341 INFO L87 Difference]: Start difference. First operand 510 states and 701 transitions. Second operand 3 states. [2019-10-02 14:08:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:26,396 INFO L93 Difference]: Finished difference Result 747 states and 1010 transitions. [2019-10-02 14:08:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:26,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 14:08:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:26,402 INFO L225 Difference]: With dead ends: 747 [2019-10-02 14:08:26,403 INFO L226 Difference]: Without dead ends: 513 [2019-10-02 14:08:26,404 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-02 14:08:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-10-02 14:08:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-02 14:08:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 703 transitions. [2019-10-02 14:08:26,437 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 703 transitions. Word has length 155 [2019-10-02 14:08:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:26,438 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 703 transitions. [2019-10-02 14:08:26,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 703 transitions. [2019-10-02 14:08:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 14:08:26,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:26,443 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:26,443 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash 406210246, now seen corresponding path program 1 times [2019-10-02 14:08:26,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:26,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:26,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:08:26,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:26,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:26,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:26,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:26,630 INFO L87 Difference]: Start difference. First operand 512 states and 703 transitions. Second operand 3 states. [2019-10-02 14:08:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:26,673 INFO L93 Difference]: Finished difference Result 1002 states and 1407 transitions. [2019-10-02 14:08:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:26,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 14:08:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:26,678 INFO L225 Difference]: With dead ends: 1002 [2019-10-02 14:08:26,678 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 14:08:26,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 14:08:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2019-10-02 14:08:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 14:08:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 775 transitions. [2019-10-02 14:08:26,710 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 775 transitions. Word has length 165 [2019-10-02 14:08:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:26,710 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 775 transitions. [2019-10-02 14:08:26,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 775 transitions. [2019-10-02 14:08:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 14:08:26,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:26,715 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:26,715 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1441612235, now seen corresponding path program 1 times [2019-10-02 14:08:26,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:08:27,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:27,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:27,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:27,013 INFO L87 Difference]: Start difference. First operand 554 states and 775 transitions. Second operand 3 states. [2019-10-02 14:08:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:27,052 INFO L93 Difference]: Finished difference Result 1125 states and 1618 transitions. [2019-10-02 14:08:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:27,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-02 14:08:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:27,058 INFO L225 Difference]: With dead ends: 1125 [2019-10-02 14:08:27,059 INFO L226 Difference]: Without dead ends: 636 [2019-10-02 14:08:27,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-02 14:08:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 635. [2019-10-02 14:08:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 14:08:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 913 transitions. [2019-10-02 14:08:27,094 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 913 transitions. Word has length 166 [2019-10-02 14:08:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:27,094 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 913 transitions. [2019-10-02 14:08:27,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 913 transitions. [2019-10-02 14:08:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 14:08:27,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:27,101 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:27,101 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1339391418, now seen corresponding path program 1 times [2019-10-02 14:08:27,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:27,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:27,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:08:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:27,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:27,270 INFO L87 Difference]: Start difference. First operand 635 states and 913 transitions. Second operand 3 states. [2019-10-02 14:08:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:27,309 INFO L93 Difference]: Finished difference Result 1362 states and 2022 transitions. [2019-10-02 14:08:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:27,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 14:08:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:27,315 INFO L225 Difference]: With dead ends: 1362 [2019-10-02 14:08:27,315 INFO L226 Difference]: Without dead ends: 792 [2019-10-02 14:08:27,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-02 14:08:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2019-10-02 14:08:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-02 14:08:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1177 transitions. [2019-10-02 14:08:27,350 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1177 transitions. Word has length 167 [2019-10-02 14:08:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:27,350 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1177 transitions. [2019-10-02 14:08:27,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1177 transitions. [2019-10-02 14:08:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:08:27,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:27,356 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:27,357 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash 771079861, now seen corresponding path program 1 times [2019-10-02 14:08:27,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:27,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:27,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:08:27,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:27,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:27,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:27,514 INFO L87 Difference]: Start difference. First operand 791 states and 1177 transitions. Second operand 3 states. [2019-10-02 14:08:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:27,601 INFO L93 Difference]: Finished difference Result 1818 states and 2794 transitions. [2019-10-02 14:08:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:27,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 14:08:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:27,613 INFO L225 Difference]: With dead ends: 1818 [2019-10-02 14:08:27,613 INFO L226 Difference]: Without dead ends: 1092 [2019-10-02 14:08:27,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-10-02 14:08:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1091. [2019-10-02 14:08:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-10-02 14:08:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1681 transitions. [2019-10-02 14:08:27,697 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1681 transitions. Word has length 168 [2019-10-02 14:08:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:27,699 INFO L475 AbstractCegarLoop]: Abstraction has 1091 states and 1681 transitions. [2019-10-02 14:08:27,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1681 transitions. [2019-10-02 14:08:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 14:08:27,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:27,709 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:27,709 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash -846644512, now seen corresponding path program 1 times [2019-10-02 14:08:27,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:27,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:27,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:08:28,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:28,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:28,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:28,051 INFO L87 Difference]: Start difference. First operand 1091 states and 1681 transitions. Second operand 3 states. [2019-10-02 14:08:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:28,103 INFO L93 Difference]: Finished difference Result 1426 states and 2141 transitions. [2019-10-02 14:08:28,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:28,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 14:08:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:28,112 INFO L225 Difference]: With dead ends: 1426 [2019-10-02 14:08:28,112 INFO L226 Difference]: Without dead ends: 1205 [2019-10-02 14:08:28,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-10-02 14:08:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1204. [2019-10-02 14:08:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-02 14:08:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1843 transitions. [2019-10-02 14:08:28,187 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1843 transitions. Word has length 171 [2019-10-02 14:08:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:28,188 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1843 transitions. [2019-10-02 14:08:28,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:08:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1843 transitions. [2019-10-02 14:08:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 14:08:28,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:28,204 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:28,204 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -528556357, now seen corresponding path program 1 times [2019-10-02 14:08:28,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:28,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:28,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:08:28,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:28,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:08:28,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:08:28,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:08:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:08:28,492 INFO L87 Difference]: Start difference. First operand 1204 states and 1843 transitions. Second operand 6 states. [2019-10-02 14:08:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:29,129 INFO L93 Difference]: Finished difference Result 2682 states and 4084 transitions. [2019-10-02 14:08:29,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:08:29,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-10-02 14:08:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:29,152 INFO L225 Difference]: With dead ends: 2682 [2019-10-02 14:08:29,153 INFO L226 Difference]: Without dead ends: 2359 [2019-10-02 14:08:29,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:08:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-10-02 14:08:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2348. [2019-10-02 14:08:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-10-02 14:08:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3636 transitions. [2019-10-02 14:08:29,343 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3636 transitions. Word has length 295 [2019-10-02 14:08:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:29,344 INFO L475 AbstractCegarLoop]: Abstraction has 2348 states and 3636 transitions. [2019-10-02 14:08:29,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:08:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3636 transitions. [2019-10-02 14:08:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 14:08:29,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:29,363 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:29,364 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1922537697, now seen corresponding path program 1 times [2019-10-02 14:08:29,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:29,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:08:29,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:29,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:08:29,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:08:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:08:29,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:08:29,646 INFO L87 Difference]: Start difference. First operand 2348 states and 3636 transitions. Second operand 9 states. [2019-10-02 14:08:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:30,101 INFO L93 Difference]: Finished difference Result 2991 states and 4495 transitions. [2019-10-02 14:08:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:08:30,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-10-02 14:08:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:30,115 INFO L225 Difference]: With dead ends: 2991 [2019-10-02 14:08:30,116 INFO L226 Difference]: Without dead ends: 2322 [2019-10-02 14:08:30,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:08:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2019-10-02 14:08:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2318. [2019-10-02 14:08:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-10-02 14:08:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3585 transitions. [2019-10-02 14:08:30,231 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3585 transitions. Word has length 296 [2019-10-02 14:08:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:30,232 INFO L475 AbstractCegarLoop]: Abstraction has 2318 states and 3585 transitions. [2019-10-02 14:08:30,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:08:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3585 transitions. [2019-10-02 14:08:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 14:08:30,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:30,247 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:30,247 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1501375971, now seen corresponding path program 1 times [2019-10-02 14:08:30,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:30,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:30,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:30,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:08:30,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:08:30,736 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:08:30,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:31,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 3330 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:08:31,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:08:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:08:31,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:08:31,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:08:31,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:08:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:08:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:08:31,907 INFO L87 Difference]: Start difference. First operand 2318 states and 3585 transitions. Second operand 29 states. [2019-10-02 14:09:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:08,731 INFO L93 Difference]: Finished difference Result 11222 states and 17411 transitions. [2019-10-02 14:09:08,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 14:09:08,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 289 [2019-10-02 14:09:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:08,790 INFO L225 Difference]: With dead ends: 11222 [2019-10-02 14:09:08,790 INFO L226 Difference]: Without dead ends: 8796 [2019-10-02 14:09:08,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10451 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 14:09:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8796 states. [2019-10-02 14:09:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8796 to 8398. [2019-10-02 14:09:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-10-02 14:09:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 12814 transitions. [2019-10-02 14:09:09,362 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 12814 transitions. Word has length 289 [2019-10-02 14:09:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:09,362 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 12814 transitions. [2019-10-02 14:09:09,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:09:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 12814 transitions. [2019-10-02 14:09:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 14:09:09,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:09,401 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:09,401 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1774418235, now seen corresponding path program 1 times [2019-10-02 14:09:09,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:09,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 14:09:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:09:09,948 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:09:10,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:10,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:09:10,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:09:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 14:09:10,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:09:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:09:10,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:09:10,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:09:10,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:09:10,823 INFO L87 Difference]: Start difference. First operand 8398 states and 12814 transitions. Second operand 23 states. [2019-10-02 14:09:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:41,734 INFO L93 Difference]: Finished difference Result 22896 states and 35219 transitions. [2019-10-02 14:09:41,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:09:41,735 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 291 [2019-10-02 14:09:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:41,816 INFO L225 Difference]: With dead ends: 22896 [2019-10-02 14:09:41,816 INFO L226 Difference]: Without dead ends: 13026 [2019-10-02 14:09:41,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9531 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1916, Invalid=24816, Unknown=0, NotChecked=0, Total=26732 [2019-10-02 14:09:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2019-10-02 14:09:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 11572. [2019-10-02 14:09:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11572 states. [2019-10-02 14:09:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11572 states to 11572 states and 17496 transitions. [2019-10-02 14:09:42,429 INFO L78 Accepts]: Start accepts. Automaton has 11572 states and 17496 transitions. Word has length 291 [2019-10-02 14:09:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:42,430 INFO L475 AbstractCegarLoop]: Abstraction has 11572 states and 17496 transitions. [2019-10-02 14:09:42,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:09:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11572 states and 17496 transitions. [2019-10-02 14:09:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 14:09:42,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:42,465 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:42,466 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1354603554, now seen corresponding path program 1 times [2019-10-02 14:09:42,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:42,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:42,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:09:42,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:42,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:09:42,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:09:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:09:42,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:09:42,652 INFO L87 Difference]: Start difference. First operand 11572 states and 17496 transitions. Second operand 5 states. [2019-10-02 14:09:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:43,318 INFO L93 Difference]: Finished difference Result 19389 states and 28685 transitions. [2019-10-02 14:09:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:09:43,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 293 [2019-10-02 14:09:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:43,403 INFO L225 Difference]: With dead ends: 19389 [2019-10-02 14:09:43,403 INFO L226 Difference]: Without dead ends: 10966 [2019-10-02 14:09:43,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:09:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10966 states. [2019-10-02 14:09:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10966 to 10758. [2019-10-02 14:09:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10758 states. [2019-10-02 14:09:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10758 states to 10758 states and 16232 transitions. [2019-10-02 14:09:43,984 INFO L78 Accepts]: Start accepts. Automaton has 10758 states and 16232 transitions. Word has length 293 [2019-10-02 14:09:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:43,985 INFO L475 AbstractCegarLoop]: Abstraction has 10758 states and 16232 transitions. [2019-10-02 14:09:43,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:09:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10758 states and 16232 transitions. [2019-10-02 14:09:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 14:09:44,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:44,017 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:44,018 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:44,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1688923304, now seen corresponding path program 1 times [2019-10-02 14:09:44,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:44,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 14:09:44,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:09:44,383 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:09:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:45,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:09:45,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:09:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 14:09:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:09:45,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2019-10-02 14:09:45,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:09:45,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:09:45,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:09:45,277 INFO L87 Difference]: Start difference. First operand 10758 states and 16232 transitions. Second operand 23 states. [2019-10-02 14:09:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:48,573 INFO L93 Difference]: Finished difference Result 22437 states and 34819 transitions. [2019-10-02 14:09:48,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:09:48,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 294 [2019-10-02 14:09:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:48,623 INFO L225 Difference]: With dead ends: 22437 [2019-10-02 14:09:48,623 INFO L226 Difference]: Without dead ends: 11460 [2019-10-02 14:09:48,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1740, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:09:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11460 states. [2019-10-02 14:09:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 11401. [2019-10-02 14:09:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2019-10-02 14:09:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 17293 transitions. [2019-10-02 14:09:49,177 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 17293 transitions. Word has length 294 [2019-10-02 14:09:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:49,178 INFO L475 AbstractCegarLoop]: Abstraction has 11401 states and 17293 transitions. [2019-10-02 14:09:49,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:09:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 17293 transitions. [2019-10-02 14:09:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 14:09:49,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:49,206 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:49,206 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:49,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash 568504412, now seen corresponding path program 1 times [2019-10-02 14:09:49,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:49,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:49,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:09:49,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:09:49,571 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:09:49,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:50,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:09:50,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:09:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:09:50,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:09:50,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:09:50,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:09:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:09:50,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:09:50,549 INFO L87 Difference]: Start difference. First operand 11401 states and 17293 transitions. Second operand 25 states. [2019-10-02 14:10:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:24,245 INFO L93 Difference]: Finished difference Result 29988 states and 45688 transitions. [2019-10-02 14:10:24,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:10:24,245 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 294 [2019-10-02 14:10:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:24,308 INFO L225 Difference]: With dead ends: 29988 [2019-10-02 14:10:24,309 INFO L226 Difference]: Without dead ends: 16089 [2019-10-02 14:10:24,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9535 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:10:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2019-10-02 14:10:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 13928. [2019-10-02 14:10:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13928 states. [2019-10-02 14:10:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13928 states to 13928 states and 21001 transitions. [2019-10-02 14:10:25,012 INFO L78 Accepts]: Start accepts. Automaton has 13928 states and 21001 transitions. Word has length 294 [2019-10-02 14:10:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:25,013 INFO L475 AbstractCegarLoop]: Abstraction has 13928 states and 21001 transitions. [2019-10-02 14:10:25,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:10:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 13928 states and 21001 transitions. [2019-10-02 14:10:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 14:10:25,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:25,032 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:25,033 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1205526933, now seen corresponding path program 1 times [2019-10-02 14:10:25,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:25,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:10:25,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:10:25,677 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:10:25,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:26,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:10:26,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:10:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:10:26,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:10:26,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 14:10:26,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:10:26,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:10:26,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:10:26,483 INFO L87 Difference]: Start difference. First operand 13928 states and 21001 transitions. Second operand 29 states. [2019-10-02 14:10:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:59,704 INFO L93 Difference]: Finished difference Result 50622 states and 77990 transitions. [2019-10-02 14:10:59,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-10-02 14:10:59,704 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 295 [2019-10-02 14:10:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:59,841 INFO L225 Difference]: With dead ends: 50622 [2019-10-02 14:10:59,841 INFO L226 Difference]: Without dead ends: 32302 [2019-10-02 14:10:59,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15335 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2506, Invalid=39314, Unknown=0, NotChecked=0, Total=41820 [2019-10-02 14:10:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32302 states. [2019-10-02 14:11:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32302 to 28237. [2019-10-02 14:11:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2019-10-02 14:11:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 42628 transitions. [2019-10-02 14:11:01,493 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 42628 transitions. Word has length 295 [2019-10-02 14:11:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:01,494 INFO L475 AbstractCegarLoop]: Abstraction has 28237 states and 42628 transitions. [2019-10-02 14:11:01,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:11:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 42628 transitions. [2019-10-02 14:11:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 14:11:01,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:01,513 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:01,513 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1128210583, now seen corresponding path program 1 times [2019-10-02 14:11:01,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:01,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:01,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:11:01,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:01,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:11:01,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:11:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:11:01,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:11:01,717 INFO L87 Difference]: Start difference. First operand 28237 states and 42628 transitions. Second operand 9 states. [2019-10-02 14:11:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:02,418 INFO L93 Difference]: Finished difference Result 52171 states and 80088 transitions. [2019-10-02 14:11:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:11:02,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2019-10-02 14:11:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:02,501 INFO L225 Difference]: With dead ends: 52171 [2019-10-02 14:11:02,501 INFO L226 Difference]: Without dead ends: 29242 [2019-10-02 14:11:02,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:11:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29242 states. [2019-10-02 14:11:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29242 to 28985. [2019-10-02 14:11:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28985 states. [2019-10-02 14:11:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28985 states to 28985 states and 43811 transitions. [2019-10-02 14:11:03,700 INFO L78 Accepts]: Start accepts. Automaton has 28985 states and 43811 transitions. Word has length 297 [2019-10-02 14:11:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:03,700 INFO L475 AbstractCegarLoop]: Abstraction has 28985 states and 43811 transitions. [2019-10-02 14:11:03,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:11:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28985 states and 43811 transitions. [2019-10-02 14:11:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 14:11:03,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:03,722 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:03,722 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash -222990385, now seen corresponding path program 1 times [2019-10-02 14:11:03,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:03,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:03,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:03,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:03,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:11:03,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:03,902 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:05,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 3337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:11:05,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 14:11:06,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:06,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 14:11:06,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:11:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:11:06,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:11:06,013 INFO L87 Difference]: Start difference. First operand 28985 states and 43811 transitions. Second operand 10 states. [2019-10-02 14:11:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:09,607 INFO L93 Difference]: Finished difference Result 87902 states and 133270 transitions. [2019-10-02 14:11:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:11:09,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2019-10-02 14:11:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:09,792 INFO L225 Difference]: With dead ends: 87902 [2019-10-02 14:11:09,793 INFO L226 Difference]: Without dead ends: 58735 [2019-10-02 14:11:09,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:11:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58735 states. [2019-10-02 14:11:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58735 to 58123. [2019-10-02 14:11:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58123 states. [2019-10-02 14:11:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58123 states to 58123 states and 87910 transitions. [2019-10-02 14:11:11,808 INFO L78 Accepts]: Start accepts. Automaton has 58123 states and 87910 transitions. Word has length 297 [2019-10-02 14:11:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:11,809 INFO L475 AbstractCegarLoop]: Abstraction has 58123 states and 87910 transitions. [2019-10-02 14:11:11,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:11:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 58123 states and 87910 transitions. [2019-10-02 14:11:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 14:11:11,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:11,843 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:11,843 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:11,843 INFO L82 PathProgramCache]: Analyzing trace with hash -545684943, now seen corresponding path program 1 times [2019-10-02 14:11:11,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:11,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:11,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:11:12,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:12,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:11:12,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:11:12,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:11:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:11:12,099 INFO L87 Difference]: Start difference. First operand 58123 states and 87910 transitions. Second operand 13 states. [2019-10-02 14:11:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:17,446 INFO L93 Difference]: Finished difference Result 166256 states and 259326 transitions. [2019-10-02 14:11:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:11:17,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 296 [2019-10-02 14:11:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:17,793 INFO L225 Difference]: With dead ends: 166256 [2019-10-02 14:11:17,793 INFO L226 Difference]: Without dead ends: 114568 [2019-10-02 14:11:17,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:11:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114568 states. [2019-10-02 14:11:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114568 to 113618. [2019-10-02 14:11:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113618 states. [2019-10-02 14:11:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113618 states to 113618 states and 170287 transitions. [2019-10-02 14:11:24,971 INFO L78 Accepts]: Start accepts. Automaton has 113618 states and 170287 transitions. Word has length 296 [2019-10-02 14:11:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:24,972 INFO L475 AbstractCegarLoop]: Abstraction has 113618 states and 170287 transitions. [2019-10-02 14:11:24,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:11:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 113618 states and 170287 transitions. [2019-10-02 14:11:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 14:11:25,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:25,017 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:25,017 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:25,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2064831227, now seen corresponding path program 1 times [2019-10-02 14:11:25,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:25,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:25,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:11:25,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:25,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:11:25,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:11:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:11:25,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:11:25,183 INFO L87 Difference]: Start difference. First operand 113618 states and 170287 transitions. Second operand 3 states. [2019-10-02 14:11:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:31,152 INFO L93 Difference]: Finished difference Result 234071 states and 352917 transitions. [2019-10-02 14:11:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:11:31,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-10-02 14:11:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:31,517 INFO L225 Difference]: With dead ends: 234071 [2019-10-02 14:11:31,517 INFO L226 Difference]: Without dead ends: 120542 [2019-10-02 14:11:31,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:11:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120542 states. [2019-10-02 14:11:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120542 to 120502. [2019-10-02 14:11:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120502 states. [2019-10-02 14:11:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120502 states to 120502 states and 182487 transitions. [2019-10-02 14:11:36,016 INFO L78 Accepts]: Start accepts. Automaton has 120502 states and 182487 transitions. Word has length 299 [2019-10-02 14:11:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:36,016 INFO L475 AbstractCegarLoop]: Abstraction has 120502 states and 182487 transitions. [2019-10-02 14:11:36,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:11:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 120502 states and 182487 transitions. [2019-10-02 14:11:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 14:11:36,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:36,104 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:36,104 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 840988020, now seen corresponding path program 1 times [2019-10-02 14:11:36,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:11:36,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:36,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:11:36,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:11:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:11:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:11:36,300 INFO L87 Difference]: Start difference. First operand 120502 states and 182487 transitions. Second operand 9 states. [2019-10-02 14:11:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:43,498 INFO L93 Difference]: Finished difference Result 222203 states and 340917 transitions. [2019-10-02 14:11:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:11:43,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 299 [2019-10-02 14:11:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:43,880 INFO L225 Difference]: With dead ends: 222203 [2019-10-02 14:11:43,880 INFO L226 Difference]: Without dead ends: 124522 [2019-10-02 14:11:44,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:11:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124522 states. [2019-10-02 14:11:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124522 to 123712. [2019-10-02 14:11:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123712 states. [2019-10-02 14:11:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123712 states to 123712 states and 187445 transitions. [2019-10-02 14:11:48,449 INFO L78 Accepts]: Start accepts. Automaton has 123712 states and 187445 transitions. Word has length 299 [2019-10-02 14:11:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:48,450 INFO L475 AbstractCegarLoop]: Abstraction has 123712 states and 187445 transitions. [2019-10-02 14:11:48,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:11:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 123712 states and 187445 transitions. [2019-10-02 14:11:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 14:11:48,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:48,541 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:48,542 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1599633739, now seen corresponding path program 1 times [2019-10-02 14:11:48,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:48,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:48,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:11:51,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:51,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:11:51,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:11:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:11:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:11:51,942 INFO L87 Difference]: Start difference. First operand 123712 states and 187445 transitions. Second operand 5 states. [2019-10-02 14:11:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:54,820 INFO L93 Difference]: Finished difference Result 225140 states and 342141 transitions. [2019-10-02 14:11:54,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:11:54,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 299 [2019-10-02 14:11:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:55,185 INFO L225 Difference]: With dead ends: 225140 [2019-10-02 14:11:55,186 INFO L226 Difference]: Without dead ends: 123941 [2019-10-02 14:11:55,369 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:11:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123941 states. [2019-10-02 14:12:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123941 to 123764. [2019-10-02 14:12:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123764 states. [2019-10-02 14:12:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123764 states to 123764 states and 187283 transitions. [2019-10-02 14:12:02,929 INFO L78 Accepts]: Start accepts. Automaton has 123764 states and 187283 transitions. Word has length 299 [2019-10-02 14:12:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:02,930 INFO L475 AbstractCegarLoop]: Abstraction has 123764 states and 187283 transitions. [2019-10-02 14:12:02,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:12:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 123764 states and 187283 transitions. [2019-10-02 14:12:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 14:12:03,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:03,482 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:03,483 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2009890869, now seen corresponding path program 1 times [2019-10-02 14:12:03,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:03,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:03,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:12:03,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:12:03,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:12:03,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:12:03,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:12:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:12:03,725 INFO L87 Difference]: Start difference. First operand 123764 states and 187283 transitions. Second operand 11 states. [2019-10-02 14:12:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:11,951 INFO L93 Difference]: Finished difference Result 243062 states and 362393 transitions. [2019-10-02 14:12:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:12:11,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-10-02 14:12:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:12,344 INFO L225 Difference]: With dead ends: 243062 [2019-10-02 14:12:12,344 INFO L226 Difference]: Without dead ends: 138794 [2019-10-02 14:12:12,517 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:12:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138794 states. [2019-10-02 14:12:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138794 to 126521. [2019-10-02 14:12:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126521 states. [2019-10-02 14:12:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126521 states to 126521 states and 193004 transitions. [2019-10-02 14:12:22,832 INFO L78 Accepts]: Start accepts. Automaton has 126521 states and 193004 transitions. Word has length 298 [2019-10-02 14:12:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:22,833 INFO L475 AbstractCegarLoop]: Abstraction has 126521 states and 193004 transitions. [2019-10-02 14:12:22,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:12:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 126521 states and 193004 transitions. [2019-10-02 14:12:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-02 14:12:22,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:22,894 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:22,895 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1519875987, now seen corresponding path program 1 times [2019-10-02 14:12:22,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:22,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:22,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:22,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:22,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:12:23,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:12:23,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:12:23,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:12:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:12:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:12:23,077 INFO L87 Difference]: Start difference. First operand 126521 states and 193004 transitions. Second operand 3 states. [2019-10-02 14:12:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:27,601 INFO L93 Difference]: Finished difference Result 266981 states and 410975 transitions. [2019-10-02 14:12:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:12:27,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-10-02 14:12:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:28,028 INFO L225 Difference]: With dead ends: 266981 [2019-10-02 14:12:28,028 INFO L226 Difference]: Without dead ends: 140549 [2019-10-02 14:12:32,890 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:12:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140549 states. [2019-10-02 14:12:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140549 to 140451. [2019-10-02 14:12:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140451 states. [2019-10-02 14:12:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140451 states to 140451 states and 217549 transitions. [2019-10-02 14:12:37,824 INFO L78 Accepts]: Start accepts. Automaton has 140451 states and 217549 transitions. Word has length 348 [2019-10-02 14:12:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:37,824 INFO L475 AbstractCegarLoop]: Abstraction has 140451 states and 217549 transitions. [2019-10-02 14:12:37,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:12:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 140451 states and 217549 transitions. [2019-10-02 14:12:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 14:12:37,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:37,939 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:37,940 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:37,940 INFO L82 PathProgramCache]: Analyzing trace with hash 492636867, now seen corresponding path program 1 times [2019-10-02 14:12:37,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:37,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:12:38,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:12:38,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:12:38,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:12:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:12:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:12:38,683 INFO L87 Difference]: Start difference. First operand 140451 states and 217549 transitions. Second operand 3 states. [2019-10-02 14:12:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:44,139 INFO L93 Difference]: Finished difference Result 306937 states and 481665 transitions. [2019-10-02 14:12:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:12:44,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-10-02 14:12:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:49,876 INFO L225 Difference]: With dead ends: 306937 [2019-10-02 14:12:49,876 INFO L226 Difference]: Without dead ends: 166575 [2019-10-02 14:12:50,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:12:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166575 states. [2019-10-02 14:12:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166575 to 166563. [2019-10-02 14:12:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166563 states. [2019-10-02 14:12:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166563 states to 166563 states and 263437 transitions. [2019-10-02 14:12:56,717 INFO L78 Accepts]: Start accepts. Automaton has 166563 states and 263437 transitions. Word has length 334 [2019-10-02 14:12:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:56,717 INFO L475 AbstractCegarLoop]: Abstraction has 166563 states and 263437 transitions. [2019-10-02 14:12:56,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:12:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 166563 states and 263437 transitions. [2019-10-02 14:12:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 14:12:56,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:56,912 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:56,912 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 556478199, now seen corresponding path program 1 times [2019-10-02 14:12:56,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:56,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:12:57,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:12:57,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:12:57,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:12:57,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:12:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:12:57,074 INFO L87 Difference]: Start difference. First operand 166563 states and 263437 transitions. Second operand 7 states. [2019-10-02 14:13:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:03,803 INFO L93 Difference]: Finished difference Result 333145 states and 529269 transitions. [2019-10-02 14:13:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:13:03,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2019-10-02 14:13:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:04,344 INFO L225 Difference]: With dead ends: 333145 [2019-10-02 14:13:04,344 INFO L226 Difference]: Without dead ends: 166671 [2019-10-02 14:13:10,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:13:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166671 states. [2019-10-02 14:13:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166671 to 166547. [2019-10-02 14:13:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166547 states. [2019-10-02 14:13:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166547 states to 166547 states and 263386 transitions. [2019-10-02 14:13:16,896 INFO L78 Accepts]: Start accepts. Automaton has 166547 states and 263386 transitions. Word has length 350 [2019-10-02 14:13:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:16,897 INFO L475 AbstractCegarLoop]: Abstraction has 166547 states and 263386 transitions. [2019-10-02 14:13:16,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:13:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 166547 states and 263386 transitions. [2019-10-02 14:13:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 14:13:17,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:17,099 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:17,100 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1883628822, now seen corresponding path program 1 times [2019-10-02 14:13:17,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:17,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:13:17,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:17,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:13:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:17,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 3686 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:13:17,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 14:13:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:13:18,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 14:13:18,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:13:18,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:13:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:13:18,033 INFO L87 Difference]: Start difference. First operand 166547 states and 263386 transitions. Second operand 10 states. [2019-10-02 14:13:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:29,797 INFO L93 Difference]: Finished difference Result 276851 states and 428171 transitions. [2019-10-02 14:13:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:13:29,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 350 [2019-10-02 14:13:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:30,281 INFO L225 Difference]: With dead ends: 276851 [2019-10-02 14:13:30,282 INFO L226 Difference]: Without dead ends: 167167 [2019-10-02 14:13:30,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:13:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167167 states. [2019-10-02 14:13:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167167 to 167041. [2019-10-02 14:13:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167041 states. [2019-10-02 14:13:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167041 states to 167041 states and 261725 transitions. [2019-10-02 14:13:37,342 INFO L78 Accepts]: Start accepts. Automaton has 167041 states and 261725 transitions. Word has length 350 [2019-10-02 14:13:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:37,342 INFO L475 AbstractCegarLoop]: Abstraction has 167041 states and 261725 transitions. [2019-10-02 14:13:37,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:13:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 167041 states and 261725 transitions. [2019-10-02 14:13:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 14:13:37,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:37,575 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:37,575 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2009563707, now seen corresponding path program 1 times [2019-10-02 14:13:37,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:13:37,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:37,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:37,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:37,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:37,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:37,715 INFO L87 Difference]: Start difference. First operand 167041 states and 261725 transitions. Second operand 3 states. [2019-10-02 14:13:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:49,930 INFO L93 Difference]: Finished difference Result 383261 states and 610316 transitions. [2019-10-02 14:13:49,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:49,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-10-02 14:13:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:50,623 INFO L225 Difference]: With dead ends: 383261 [2019-10-02 14:13:50,623 INFO L226 Difference]: Without dead ends: 217084 [2019-10-02 14:13:50,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217084 states. [2019-10-02 14:14:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217084 to 217006. [2019-10-02 14:14:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217006 states. [2019-10-02 14:14:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217006 states to 217006 states and 348176 transitions. [2019-10-02 14:14:00,959 INFO L78 Accepts]: Start accepts. Automaton has 217006 states and 348176 transitions. Word has length 324 [2019-10-02 14:14:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:00,960 INFO L475 AbstractCegarLoop]: Abstraction has 217006 states and 348176 transitions. [2019-10-02 14:14:00,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 217006 states and 348176 transitions. [2019-10-02 14:14:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-10-02 14:14:01,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:01,369 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:01,369 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:01,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1222887068, now seen corresponding path program 1 times [2019-10-02 14:14:01,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:01,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:01,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:01,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 14:14:01,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:01,600 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:01,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:02,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 3736 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:14:02,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 14:14:02,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:14:02,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 14:14:02,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:14:02,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:14:02,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:14:02,405 INFO L87 Difference]: Start difference. First operand 217006 states and 348176 transitions. Second operand 13 states. [2019-10-02 14:14:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:15,148 INFO L93 Difference]: Finished difference Result 334661 states and 522602 transitions. [2019-10-02 14:14:15,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:14:15,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 368 [2019-10-02 14:14:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:15,886 INFO L225 Difference]: With dead ends: 334661 [2019-10-02 14:14:15,886 INFO L226 Difference]: Without dead ends: 225313 [2019-10-02 14:14:16,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:14:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225313 states. [2019-10-02 14:14:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225313 to 224233. [2019-10-02 14:14:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224233 states. [2019-10-02 14:14:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224233 states to 224233 states and 359658 transitions. [2019-10-02 14:14:34,650 INFO L78 Accepts]: Start accepts. Automaton has 224233 states and 359658 transitions. Word has length 368 [2019-10-02 14:14:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:34,650 INFO L475 AbstractCegarLoop]: Abstraction has 224233 states and 359658 transitions. [2019-10-02 14:14:34,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:14:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 224233 states and 359658 transitions. [2019-10-02 14:14:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 14:14:35,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:35,093 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:35,093 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -783036924, now seen corresponding path program 1 times [2019-10-02 14:14:35,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:35,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:35,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:14:35,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:35,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:35,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:35,252 INFO L87 Difference]: Start difference. First operand 224233 states and 359658 transitions. Second operand 3 states. [2019-10-02 14:14:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:53,065 INFO L93 Difference]: Finished difference Result 540699 states and 878970 transitions. [2019-10-02 14:14:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:53,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-10-02 14:14:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:53,962 INFO L225 Difference]: With dead ends: 540699 [2019-10-02 14:14:53,963 INFO L226 Difference]: Without dead ends: 321655 [2019-10-02 14:14:54,283 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321655 states. [2019-10-02 14:15:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321655 to 321643. [2019-10-02 14:15:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321643 states. [2019-10-02 14:15:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321643 states to 321643 states and 524057 transitions. [2019-10-02 14:15:19,812 INFO L78 Accepts]: Start accepts. Automaton has 321643 states and 524057 transitions. Word has length 324 [2019-10-02 14:15:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:19,812 INFO L475 AbstractCegarLoop]: Abstraction has 321643 states and 524057 transitions. [2019-10-02 14:15:19,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 321643 states and 524057 transitions. [2019-10-02 14:15:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 14:15:20,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:20,646 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:20,646 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2117288709, now seen corresponding path program 1 times [2019-10-02 14:15:20,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:20,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:15:20,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:20,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:20,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:20,764 INFO L87 Difference]: Start difference. First operand 321643 states and 524057 transitions. Second operand 3 states. [2019-10-02 14:15:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:48,079 INFO L93 Difference]: Finished difference Result 818522 states and 1352179 transitions. [2019-10-02 14:15:48,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-02 14:15:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:50,719 INFO L225 Difference]: With dead ends: 818522 [2019-10-02 14:15:50,720 INFO L226 Difference]: Without dead ends: 504436 [2019-10-02 14:15:51,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504436 states. [2019-10-02 14:16:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504436 to 504424. [2019-10-02 14:16:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504424 states. [2019-10-02 14:16:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504424 states to 504424 states and 833281 transitions. [2019-10-02 14:16:40,294 INFO L78 Accepts]: Start accepts. Automaton has 504424 states and 833281 transitions. Word has length 326 [2019-10-02 14:16:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:40,295 INFO L475 AbstractCegarLoop]: Abstraction has 504424 states and 833281 transitions. [2019-10-02 14:16:40,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 504424 states and 833281 transitions. [2019-10-02 14:16:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 14:16:42,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:42,017 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:42,017 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:42,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 865034052, now seen corresponding path program 1 times [2019-10-02 14:16:42,017 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:42,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:42,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:16:43,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:43,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:43,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:43,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:43,127 INFO L87 Difference]: Start difference. First operand 504424 states and 833281 transitions. Second operand 3 states. [2019-10-02 14:17:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:26,145 INFO L93 Difference]: Finished difference Result 944010 states and 1548631 transitions. [2019-10-02 14:17:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:17:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-02 14:17:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:29,251 INFO L225 Difference]: With dead ends: 944010 [2019-10-02 14:17:29,251 INFO L226 Difference]: Without dead ends: 835072 [2019-10-02 14:17:29,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:17:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835072 states. [2019-10-02 14:18:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835072 to 835060. [2019-10-02 14:18:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835060 states.