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_spec1_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:52:23,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:52:23,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:52:23,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:52:23,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:52:23,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:52:23,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:52:23,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:52:23,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:52:23,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:52:23,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:52:23,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:52:23,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:52:23,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:52:23,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:52:23,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:52:23,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:52:23,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:52:23,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:52:23,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:52:23,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:52:23,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:52:23,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:52:23,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:52:23,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:52:23,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:52:23,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:52:23,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:52:23,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:52:23,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:52:23,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:52:23,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:52:23,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:52:23,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:52:23,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:52:23,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:52:23,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:52:23,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:52:23,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:52:23,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:52:23,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:52:23,968 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 12:52:23,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:52:23,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:52:23,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:52:23,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:52:23,997 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:52:23,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:52:23,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:52:23,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:52:23,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:52:23,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:52:23,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:52:24,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:52:24,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:52:24,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:52:24,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:52:24,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:52:24,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:52:24,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:52:24,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:52:24,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:52:24,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:52:24,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:52:24,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:52:24,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:52:24,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:52:24,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:52:24,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:52:24,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:52:24,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:52:24,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:52:24,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:52:24,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:52:24,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:52:24,070 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:52:24,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product16.cil.c [2019-10-02 12:52:24,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cdbe93eb/d6ab9c0fff4e4f318695079676ddb204/FLAG611a3d579 [2019-10-02 12:52:24,813 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:52:24,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product16.cil.c [2019-10-02 12:52:24,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cdbe93eb/d6ab9c0fff4e4f318695079676ddb204/FLAG611a3d579 [2019-10-02 12:52:25,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cdbe93eb/d6ab9c0fff4e4f318695079676ddb204 [2019-10-02 12:52:25,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:52:25,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:52:25,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:52:25,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:52:25,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:52:25,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:52:25" (1/1) ... [2019-10-02 12:52:25,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1729396c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:25, skipping insertion in model container [2019-10-02 12:52:25,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:52:25" (1/1) ... [2019-10-02 12:52:25,038 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:52:25,123 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:52:25,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:52:25,899 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:52:26,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:52:26,115 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:52:26,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26 WrapperNode [2019-10-02 12:52:26,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:52:26,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:52:26,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:52:26,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:52:26,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (1/1) ... [2019-10-02 12:52:26,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:52:26,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:52:26,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:52:26,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:52:26,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (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 12:52:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:52:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:52:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:52:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:52:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:52:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:52:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:52:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:52:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:52:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:52:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:52:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:52:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:52:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:52:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:52:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:52:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:52:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:52:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:52:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:52:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:52:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:52:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:52:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:52:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:52:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:52:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:52:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:52:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:52:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:52:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:52:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:52:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:52:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:52:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:52:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:52:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:52:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:52:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:52:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:52:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:52:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:52:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:52:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:52:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:52:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:52:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:52:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:52:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:52:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:52:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:52:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:52:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:52:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:52:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:52:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:52:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:52:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:52:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:52:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:52:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:52:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:52:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:52:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:52:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:52:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:52:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:52:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:52:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:52:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:52:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:52:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:52:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:52:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:52:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:52:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:52:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:52:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:52:26,431 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:52:26,431 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:52:26,431 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:52:26,432 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:52:26,432 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:52:26,432 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:52:26,432 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:52:26,433 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:52:26,433 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:52:26,433 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:52:26,433 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:52:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:52:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:52:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:52:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:52:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:52:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:52:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:52:26,436 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:52:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:52:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:52:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:52:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:52:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:52:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:52:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:52:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:52:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:52:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:52:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:52:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:52:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:52:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:52:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:52:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:52:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:52:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:52:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:52:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:52:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:52:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:52:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:52:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:52:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:52:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:52:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:52:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:52:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:52:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:52:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:52:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:52:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:52:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:52:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:52:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:52:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:52:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:52:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:52:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:52:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:52:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:52:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:52:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:52:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:52:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:52:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:52:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:52:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:52:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:52:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:52:26,455 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:52:26,456 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:52:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:52:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:52:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:52:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:52:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:52:26,457 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:52:26,458 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:52:26,459 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:52:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:52:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:52:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:52:26,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:52:28,811 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:52:28,811 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:52:28,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:52:28 BoogieIcfgContainer [2019-10-02 12:52:28,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:52:28,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:52:28,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:52:28,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:52:28,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:52:25" (1/3) ... [2019-10-02 12:52:28,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:52:28, skipping insertion in model container [2019-10-02 12:52:28,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:26" (2/3) ... [2019-10-02 12:52:28,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:52:28, skipping insertion in model container [2019-10-02 12:52:28,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:52:28" (3/3) ... [2019-10-02 12:52:28,822 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product16.cil.c [2019-10-02 12:52:28,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:52:28,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:52:28,858 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:52:28,894 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:52:28,895 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:52:28,895 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:52:28,895 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:52:28,896 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:52:28,896 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:52:28,896 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:52:28,896 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:52:28,896 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:52:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states. [2019-10-02 12:52:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:52:28,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:28,947 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] [2019-10-02 12:52:28,950 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:28,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1028752379, now seen corresponding path program 1 times [2019-10-02 12:52:28,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:29,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:29,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:29,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:29,503 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 12:52:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:52:29,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:52:29,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:52:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:52:29,539 INFO L87 Difference]: Start difference. First operand 476 states. Second operand 2 states. [2019-10-02 12:52:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:29,632 INFO L93 Difference]: Finished difference Result 694 states and 913 transitions. [2019-10-02 12:52:29,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:52:29,633 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-10-02 12:52:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:29,657 INFO L225 Difference]: With dead ends: 694 [2019-10-02 12:52:29,657 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 12:52:29,670 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 12:52:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 12:52:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2019-10-02 12:52:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-10-02 12:52:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 601 transitions. [2019-10-02 12:52:29,805 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 601 transitions. Word has length 145 [2019-10-02 12:52:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:29,809 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 601 transitions. [2019-10-02 12:52:29,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:52:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 601 transitions. [2019-10-02 12:52:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:52:29,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:29,832 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] [2019-10-02 12:52:29,833 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash -711556920, now seen corresponding path program 1 times [2019-10-02 12:52:29,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:29,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:30,243 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 12:52:30,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:30,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:30,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:30,257 INFO L87 Difference]: Start difference. First operand 453 states and 601 transitions. Second operand 3 states. [2019-10-02 12:52:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:30,314 INFO L93 Difference]: Finished difference Result 677 states and 882 transitions. [2019-10-02 12:52:30,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:30,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-02 12:52:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:30,325 INFO L225 Difference]: With dead ends: 677 [2019-10-02 12:52:30,326 INFO L226 Difference]: Without dead ends: 456 [2019-10-02 12:52:30,332 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 12:52:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-02 12:52:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 455. [2019-10-02 12:52:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-02 12:52:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 603 transitions. [2019-10-02 12:52:30,391 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 603 transitions. Word has length 146 [2019-10-02 12:52:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:30,392 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 603 transitions. [2019-10-02 12:52:30,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 603 transitions. [2019-10-02 12:52:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:52:30,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:30,397 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] [2019-10-02 12:52:30,398 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1834454924, now seen corresponding path program 1 times [2019-10-02 12:52:30,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:30,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:30,593 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 12:52:30,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:30,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:30,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:30,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:30,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:30,597 INFO L87 Difference]: Start difference. First operand 455 states and 603 transitions. Second operand 3 states. [2019-10-02 12:52:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:30,634 INFO L93 Difference]: Finished difference Result 886 states and 1204 transitions. [2019-10-02 12:52:30,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:30,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-02 12:52:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:30,644 INFO L225 Difference]: With dead ends: 886 [2019-10-02 12:52:30,645 INFO L226 Difference]: Without dead ends: 496 [2019-10-02 12:52:30,646 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 12:52:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-10-02 12:52:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 495. [2019-10-02 12:52:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-10-02 12:52:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 672 transitions. [2019-10-02 12:52:30,685 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 672 transitions. Word has length 152 [2019-10-02 12:52:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:30,686 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 672 transitions. [2019-10-02 12:52:30,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 672 transitions. [2019-10-02 12:52:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:52:30,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:30,690 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] [2019-10-02 12:52:30,690 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 316559845, now seen corresponding path program 1 times [2019-10-02 12:52:30,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:30,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:30,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:52:31,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:31,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-10-02 12:52:31,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 12:52:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 12:52:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:52:31,790 INFO L87 Difference]: Start difference. First operand 495 states and 672 transitions. Second operand 31 states. [2019-10-02 12:52:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:36,750 INFO L93 Difference]: Finished difference Result 1423 states and 1968 transitions. [2019-10-02 12:52:36,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:52:36,750 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 153 [2019-10-02 12:52:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:36,760 INFO L225 Difference]: With dead ends: 1423 [2019-10-02 12:52:36,760 INFO L226 Difference]: Without dead ends: 964 [2019-10-02 12:52:36,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=3054, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 12:52:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-10-02 12:52:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 718. [2019-10-02 12:52:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-02 12:52:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1025 transitions. [2019-10-02 12:52:36,834 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1025 transitions. Word has length 153 [2019-10-02 12:52:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:36,836 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1025 transitions. [2019-10-02 12:52:36,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 12:52:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1025 transitions. [2019-10-02 12:52:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:52:36,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:36,844 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:52:36,844 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash 410280145, now seen corresponding path program 1 times [2019-10-02 12:52:36,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:36,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:36,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:52:37,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:52:37,844 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 12:52:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:38,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:52:38,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:52:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 12:52:38,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:52:38,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [31] total 35 [2019-10-02 12:52:38,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 12:52:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 12:52:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:52:38,666 INFO L87 Difference]: Start difference. First operand 718 states and 1025 transitions. Second operand 35 states. [2019-10-02 12:52:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:43,992 INFO L93 Difference]: Finished difference Result 1637 states and 2315 transitions. [2019-10-02 12:52:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 12:52:43,993 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 154 [2019-10-02 12:52:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:44,002 INFO L225 Difference]: With dead ends: 1637 [2019-10-02 12:52:44,002 INFO L226 Difference]: Without dead ends: 970 [2019-10-02 12:52:44,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=295, Invalid=3865, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 12:52:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-02 12:52:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 722. [2019-10-02 12:52:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-02 12:52:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1030 transitions. [2019-10-02 12:52:44,074 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1030 transitions. Word has length 154 [2019-10-02 12:52:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:44,075 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 1030 transitions. [2019-10-02 12:52:44,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 12:52:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1030 transitions. [2019-10-02 12:52:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:52:44,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:44,080 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:44,081 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2095426242, now seen corresponding path program 1 times [2019-10-02 12:52:44,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:52:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:52:44,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:52:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:52:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:52:44,962 INFO L87 Difference]: Start difference. First operand 722 states and 1030 transitions. Second operand 26 states. [2019-10-02 12:52:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:53,460 INFO L93 Difference]: Finished difference Result 2306 states and 3160 transitions. [2019-10-02 12:52:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:52:53,461 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 155 [2019-10-02 12:52:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:53,473 INFO L225 Difference]: With dead ends: 2306 [2019-10-02 12:52:53,473 INFO L226 Difference]: Without dead ends: 2094 [2019-10-02 12:52:53,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:52:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-10-02 12:52:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1611. [2019-10-02 12:52:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-10-02 12:52:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2289 transitions. [2019-10-02 12:52:53,582 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2289 transitions. Word has length 155 [2019-10-02 12:52:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:53,584 INFO L475 AbstractCegarLoop]: Abstraction has 1611 states and 2289 transitions. [2019-10-02 12:52:53,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:52:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2289 transitions. [2019-10-02 12:52:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:53,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:53,591 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:53,591 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash -523903257, now seen corresponding path program 1 times [2019-10-02 12:52:53,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:53,795 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 12:52:53,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:52:53,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:52:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:52:53,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:52:53,797 INFO L87 Difference]: Start difference. First operand 1611 states and 2289 transitions. Second operand 10 states. [2019-10-02 12:52:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:54,029 INFO L93 Difference]: Finished difference Result 2283 states and 3159 transitions. [2019-10-02 12:52:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:52:54,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-10-02 12:52:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:54,053 INFO L225 Difference]: With dead ends: 2283 [2019-10-02 12:52:54,053 INFO L226 Difference]: Without dead ends: 1642 [2019-10-02 12:52:54,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:52:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-10-02 12:52:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1637. [2019-10-02 12:52:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-10-02 12:52:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2328 transitions. [2019-10-02 12:52:54,189 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2328 transitions. Word has length 156 [2019-10-02 12:52:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:54,190 INFO L475 AbstractCegarLoop]: Abstraction has 1637 states and 2328 transitions. [2019-10-02 12:52:54,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:52:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2328 transitions. [2019-10-02 12:52:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:54,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:54,200 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:54,201 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1906791, now seen corresponding path program 1 times [2019-10-02 12:52:54,201 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:54,444 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 12:52:54,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:54,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:52:54,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:52:54,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:52:54,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:52:54,446 INFO L87 Difference]: Start difference. First operand 1637 states and 2328 transitions. Second operand 5 states. [2019-10-02 12:52:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:55,774 INFO L93 Difference]: Finished difference Result 4061 states and 5619 transitions. [2019-10-02 12:52:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:52:55,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-02 12:52:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:55,805 INFO L225 Difference]: With dead ends: 4061 [2019-10-02 12:52:55,806 INFO L226 Difference]: Without dead ends: 3414 [2019-10-02 12:52:55,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:52:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2019-10-02 12:52:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3181. [2019-10-02 12:52:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-10-02 12:52:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4395 transitions. [2019-10-02 12:52:56,068 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4395 transitions. Word has length 156 [2019-10-02 12:52:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:56,070 INFO L475 AbstractCegarLoop]: Abstraction has 3181 states and 4395 transitions. [2019-10-02 12:52:56,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:52:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4395 transitions. [2019-10-02 12:52:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:56,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:56,080 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:56,081 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2012010632, now seen corresponding path program 1 times [2019-10-02 12:52:56,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:52:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:56,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:52:56,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:52:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:52:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:52:56,283 INFO L87 Difference]: Start difference. First operand 3181 states and 4395 transitions. Second operand 9 states. [2019-10-02 12:52:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:56,710 INFO L93 Difference]: Finished difference Result 3627 states and 4964 transitions. [2019-10-02 12:52:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:52:56,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2019-10-02 12:52:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:56,718 INFO L225 Difference]: With dead ends: 3627 [2019-10-02 12:52:56,719 INFO L226 Difference]: Without dead ends: 1186 [2019-10-02 12:52:56,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:52:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-10-02 12:52:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2019-10-02 12:52:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-10-02 12:52:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1623 transitions. [2019-10-02 12:52:56,801 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1623 transitions. Word has length 156 [2019-10-02 12:52:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:56,802 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1623 transitions. [2019-10-02 12:52:56,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:52:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1623 transitions. [2019-10-02 12:52:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:56,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:56,806 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:56,806 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 938095298, now seen corresponding path program 2 times [2019-10-02 12:52:56,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:56,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:57,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:52:57,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:52:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:52:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:52:57,311 INFO L87 Difference]: Start difference. First operand 1184 states and 1623 transitions. Second operand 24 states. [2019-10-02 12:53:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:04,376 INFO L93 Difference]: Finished difference Result 4949 states and 6737 transitions. [2019-10-02 12:53:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:53:04,380 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2019-10-02 12:53:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:04,410 INFO L225 Difference]: With dead ends: 4949 [2019-10-02 12:53:04,411 INFO L226 Difference]: Without dead ends: 4352 [2019-10-02 12:53:04,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:53:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2019-10-02 12:53:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 3176. [2019-10-02 12:53:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-10-02 12:53:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 4387 transitions. [2019-10-02 12:53:04,669 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 4387 transitions. Word has length 156 [2019-10-02 12:53:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:04,669 INFO L475 AbstractCegarLoop]: Abstraction has 3176 states and 4387 transitions. [2019-10-02 12:53:04,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:53:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 4387 transitions. [2019-10-02 12:53:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:53:04,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:04,679 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:04,680 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash 765435768, now seen corresponding path program 2 times [2019-10-02 12:53:04,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:04,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:04,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:04,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:04,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:04,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:53:04,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:53:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:53:04,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:53:04,852 INFO L87 Difference]: Start difference. First operand 3176 states and 4387 transitions. Second operand 7 states. [2019-10-02 12:53:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:05,089 INFO L93 Difference]: Finished difference Result 3622 states and 4956 transitions. [2019-10-02 12:53:05,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:53:05,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-10-02 12:53:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:05,098 INFO L225 Difference]: With dead ends: 3622 [2019-10-02 12:53:05,098 INFO L226 Difference]: Without dead ends: 1186 [2019-10-02 12:53:05,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:53:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-10-02 12:53:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2019-10-02 12:53:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-10-02 12:53:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1622 transitions. [2019-10-02 12:53:05,186 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1622 transitions. Word has length 157 [2019-10-02 12:53:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:05,187 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1622 transitions. [2019-10-02 12:53:05,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:53:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1622 transitions. [2019-10-02 12:53:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:53:05,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:05,193 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:05,194 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:05,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1498051715, now seen corresponding path program 3 times [2019-10-02 12:53:05,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:05,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:05,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:05,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:05,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:53:05,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:53:05,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:53:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:53:05,798 INFO L87 Difference]: Start difference. First operand 1184 states and 1622 transitions. Second operand 26 states. [2019-10-02 12:53:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:12,771 INFO L93 Difference]: Finished difference Result 4956 states and 6744 transitions. [2019-10-02 12:53:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:53:12,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-10-02 12:53:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:12,797 INFO L225 Difference]: With dead ends: 4956 [2019-10-02 12:53:12,797 INFO L226 Difference]: Without dead ends: 4359 [2019-10-02 12:53:12,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:53:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2019-10-02 12:53:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 3181. [2019-10-02 12:53:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-10-02 12:53:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4392 transitions. [2019-10-02 12:53:13,011 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4392 transitions. Word has length 157 [2019-10-02 12:53:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:13,011 INFO L475 AbstractCegarLoop]: Abstraction has 3181 states and 4392 transitions. [2019-10-02 12:53:13,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:53:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4392 transitions. [2019-10-02 12:53:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:53:13,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:13,021 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:13,021 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash 944215511, now seen corresponding path program 3 times [2019-10-02 12:53:13,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:13,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:13,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:13,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:13,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:13,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:53:13,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:53:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:53:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:53:13,184 INFO L87 Difference]: Start difference. First operand 3181 states and 4392 transitions. Second operand 9 states. [2019-10-02 12:53:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:13,529 INFO L93 Difference]: Finished difference Result 3629 states and 4963 transitions. [2019-10-02 12:53:13,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:53:13,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:53:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:13,536 INFO L225 Difference]: With dead ends: 3629 [2019-10-02 12:53:13,536 INFO L226 Difference]: Without dead ends: 1188 [2019-10-02 12:53:13,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:53:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-10-02 12:53:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1184. [2019-10-02 12:53:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-10-02 12:53:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1621 transitions. [2019-10-02 12:53:13,603 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1621 transitions. Word has length 158 [2019-10-02 12:53:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:13,604 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1621 transitions. [2019-10-02 12:53:13,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:53:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1621 transitions. [2019-10-02 12:53:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:53:13,609 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:13,609 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:13,609 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -320669092, now seen corresponding path program 1 times [2019-10-02 12:53:13,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:13,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:13,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:13,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:13,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:14,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:14,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:53:14,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:53:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:53:14,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:53:14,047 INFO L87 Difference]: Start difference. First operand 1184 states and 1621 transitions. Second operand 24 states. [2019-10-02 12:53:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:21,523 INFO L93 Difference]: Finished difference Result 5461 states and 7527 transitions. [2019-10-02 12:53:21,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 12:53:21,524 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 158 [2019-10-02 12:53:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:21,546 INFO L225 Difference]: With dead ends: 5461 [2019-10-02 12:53:21,546 INFO L226 Difference]: Without dead ends: 4366 [2019-10-02 12:53:21,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 12:53:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2019-10-02 12:53:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 3178. [2019-10-02 12:53:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-10-02 12:53:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4389 transitions. [2019-10-02 12:53:21,780 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4389 transitions. Word has length 158 [2019-10-02 12:53:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:21,781 INFO L475 AbstractCegarLoop]: Abstraction has 3178 states and 4389 transitions. [2019-10-02 12:53:21,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:53:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4389 transitions. [2019-10-02 12:53:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:53:21,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:21,789 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:21,789 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 398445342, now seen corresponding path program 1 times [2019-10-02 12:53:21,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:21,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:21,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:21,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:53:21,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:53:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:53:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:53:21,936 INFO L87 Difference]: Start difference. First operand 3178 states and 4389 transitions. Second operand 7 states. [2019-10-02 12:53:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:22,159 INFO L93 Difference]: Finished difference Result 3628 states and 4963 transitions. [2019-10-02 12:53:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:53:22,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-10-02 12:53:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:22,167 INFO L225 Difference]: With dead ends: 3628 [2019-10-02 12:53:22,167 INFO L226 Difference]: Without dead ends: 1192 [2019-10-02 12:53:22,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:53:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-10-02 12:53:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1186. [2019-10-02 12:53:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-10-02 12:53:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1624 transitions. [2019-10-02 12:53:22,286 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1624 transitions. Word has length 159 [2019-10-02 12:53:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:22,286 INFO L475 AbstractCegarLoop]: Abstraction has 1186 states and 1624 transitions. [2019-10-02 12:53:22,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:53:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1624 transitions. [2019-10-02 12:53:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:53:22,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:22,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:22,291 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash 752988868, now seen corresponding path program 1 times [2019-10-02 12:53:22,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:22,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:53:22,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:22,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:53:22,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:53:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:53:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:53:22,571 INFO L87 Difference]: Start difference. First operand 1186 states and 1624 transitions. Second operand 18 states. [2019-10-02 12:53:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:26,336 INFO L93 Difference]: Finished difference Result 3157 states and 4247 transitions. [2019-10-02 12:53:26,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:53:26,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 159 [2019-10-02 12:53:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:26,345 INFO L225 Difference]: With dead ends: 3157 [2019-10-02 12:53:26,345 INFO L226 Difference]: Without dead ends: 2560 [2019-10-02 12:53:26,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:53:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2019-10-02 12:53:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2518. [2019-10-02 12:53:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-10-02 12:53:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3426 transitions. [2019-10-02 12:53:26,504 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3426 transitions. Word has length 159 [2019-10-02 12:53:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:26,505 INFO L475 AbstractCegarLoop]: Abstraction has 2518 states and 3426 transitions. [2019-10-02 12:53:26,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:53:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3426 transitions. [2019-10-02 12:53:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:53:26,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:26,511 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:26,511 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -677896266, now seen corresponding path program 1 times [2019-10-02 12:53:26,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:26,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:53:26,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:26,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:53:26,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:53:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:53:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:53:26,716 INFO L87 Difference]: Start difference. First operand 2518 states and 3426 transitions. Second operand 9 states. [2019-10-02 12:53:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:27,264 INFO L93 Difference]: Finished difference Result 4965 states and 6770 transitions. [2019-10-02 12:53:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:53:27,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-10-02 12:53:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:27,276 INFO L225 Difference]: With dead ends: 4965 [2019-10-02 12:53:27,277 INFO L226 Difference]: Without dead ends: 2522 [2019-10-02 12:53:27,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:53:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2019-10-02 12:53:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2518. [2019-10-02 12:53:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-10-02 12:53:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3425 transitions. [2019-10-02 12:53:27,522 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3425 transitions. Word has length 160 [2019-10-02 12:53:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:27,522 INFO L475 AbstractCegarLoop]: Abstraction has 2518 states and 3425 transitions. [2019-10-02 12:53:27,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:53:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3425 transitions. [2019-10-02 12:53:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:53:27,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:27,528 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:27,528 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash -649395976, now seen corresponding path program 1 times [2019-10-02 12:53:27,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:27,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:27,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:27,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:27,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:53:27,649 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 12:53:27,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:28,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 2371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:53:28,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:53:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:28,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:53:28,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:53:28,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:53:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:53:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:53:28,162 INFO L87 Difference]: Start difference. First operand 2518 states and 3425 transitions. Second operand 5 states. [2019-10-02 12:53:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:28,314 INFO L93 Difference]: Finished difference Result 4382 states and 5852 transitions. [2019-10-02 12:53:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:53:28,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-02 12:53:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:28,325 INFO L225 Difference]: With dead ends: 4382 [2019-10-02 12:53:28,325 INFO L226 Difference]: Without dead ends: 2588 [2019-10-02 12:53:28,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:53:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2019-10-02 12:53:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2581. [2019-10-02 12:53:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2019-10-02 12:53:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3528 transitions. [2019-10-02 12:53:28,493 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3528 transitions. Word has length 160 [2019-10-02 12:53:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:28,493 INFO L475 AbstractCegarLoop]: Abstraction has 2581 states and 3528 transitions. [2019-10-02 12:53:28,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:53:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3528 transitions. [2019-10-02 12:53:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:53:28,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:28,500 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:28,500 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:28,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1244659563, now seen corresponding path program 1 times [2019-10-02 12:53:28,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:28,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:28,599 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 12:53:28,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:28,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:28,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:28,601 INFO L87 Difference]: Start difference. First operand 2581 states and 3528 transitions. Second operand 3 states. [2019-10-02 12:53:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:28,734 INFO L93 Difference]: Finished difference Result 5306 states and 7387 transitions. [2019-10-02 12:53:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:28,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-02 12:53:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:28,747 INFO L225 Difference]: With dead ends: 5306 [2019-10-02 12:53:28,747 INFO L226 Difference]: Without dead ends: 2829 [2019-10-02 12:53:28,755 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 12:53:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-10-02 12:53:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2826. [2019-10-02 12:53:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-10-02 12:53:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3970 transitions. [2019-10-02 12:53:28,934 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3970 transitions. Word has length 166 [2019-10-02 12:53:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:28,934 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 3970 transitions. [2019-10-02 12:53:28,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3970 transitions. [2019-10-02 12:53:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:53:28,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:28,942 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:53:28,943 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1554148143, now seen corresponding path program 2 times [2019-10-02 12:53:28,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:28,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:28,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:28,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:28,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:29,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:29,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:53:29,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:53:29,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:53:29,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:53:29,064 INFO L87 Difference]: Start difference. First operand 2826 states and 3970 transitions. Second operand 6 states. [2019-10-02 12:53:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:29,232 INFO L93 Difference]: Finished difference Result 5501 states and 7739 transitions. [2019-10-02 12:53:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:53:29,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-10-02 12:53:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:29,250 INFO L225 Difference]: With dead ends: 5501 [2019-10-02 12:53:29,250 INFO L226 Difference]: Without dead ends: 2829 [2019-10-02 12:53:29,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:53:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-10-02 12:53:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2826. [2019-10-02 12:53:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2019-10-02 12:53:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3964 transitions. [2019-10-02 12:53:29,439 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3964 transitions. Word has length 167 [2019-10-02 12:53:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:29,439 INFO L475 AbstractCegarLoop]: Abstraction has 2826 states and 3964 transitions. [2019-10-02 12:53:29,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:53:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3964 transitions. [2019-10-02 12:53:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:53:29,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:29,448 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:29,448 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash -424318208, now seen corresponding path program 1 times [2019-10-02 12:53:29,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:29,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:29,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:53:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:29,550 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 12:53:29,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:29,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:29,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:29,552 INFO L87 Difference]: Start difference. First operand 2826 states and 3964 transitions. Second operand 3 states. [2019-10-02 12:53:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:29,737 INFO L93 Difference]: Finished difference Result 6003 states and 8638 transitions. [2019-10-02 12:53:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:29,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 12:53:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:29,751 INFO L225 Difference]: With dead ends: 6003 [2019-10-02 12:53:29,752 INFO L226 Difference]: Without dead ends: 3287 [2019-10-02 12:53:29,760 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 12:53:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2019-10-02 12:53:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 3284. [2019-10-02 12:53:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3284 states. [2019-10-02 12:53:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4787 transitions. [2019-10-02 12:53:29,962 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 4787 transitions. Word has length 167 [2019-10-02 12:53:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:29,962 INFO L475 AbstractCegarLoop]: Abstraction has 3284 states and 4787 transitions. [2019-10-02 12:53:29,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 4787 transitions. [2019-10-02 12:53:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:53:29,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:29,974 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:29,974 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -740180269, now seen corresponding path program 1 times [2019-10-02 12:53:29,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:29,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:29,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:30,075 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 12:53:30,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:30,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:30,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:30,080 INFO L87 Difference]: Start difference. First operand 3284 states and 4787 transitions. Second operand 3 states. [2019-10-02 12:53:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:30,235 INFO L93 Difference]: Finished difference Result 7335 states and 11014 transitions. [2019-10-02 12:53:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:30,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 12:53:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:30,255 INFO L225 Difference]: With dead ends: 7335 [2019-10-02 12:53:30,255 INFO L226 Difference]: Without dead ends: 4169 [2019-10-02 12:53:30,267 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 12:53:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2019-10-02 12:53:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4166. [2019-10-02 12:53:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-10-02 12:53:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 6340 transitions. [2019-10-02 12:53:30,606 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 6340 transitions. Word has length 168 [2019-10-02 12:53:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:30,606 INFO L475 AbstractCegarLoop]: Abstraction has 4166 states and 6340 transitions. [2019-10-02 12:53:30,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 6340 transitions. [2019-10-02 12:53:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:53:30,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:30,623 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:30,624 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2132595456, now seen corresponding path program 1 times [2019-10-02 12:53:30,624 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:30,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:30,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:30,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:30,749 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 12:53:30,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:30,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:30,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:30,751 INFO L87 Difference]: Start difference. First operand 4166 states and 6340 transitions. Second operand 3 states. [2019-10-02 12:53:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:31,055 INFO L93 Difference]: Finished difference Result 9891 states and 15508 transitions. [2019-10-02 12:53:31,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:31,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 12:53:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:31,074 INFO L225 Difference]: With dead ends: 9891 [2019-10-02 12:53:31,074 INFO L226 Difference]: Without dead ends: 5855 [2019-10-02 12:53:31,087 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 12:53:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-10-02 12:53:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5852. [2019-10-02 12:53:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2019-10-02 12:53:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 9273 transitions. [2019-10-02 12:53:31,462 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 9273 transitions. Word has length 169 [2019-10-02 12:53:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:31,462 INFO L475 AbstractCegarLoop]: Abstraction has 5852 states and 9273 transitions. [2019-10-02 12:53:31,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 9273 transitions. [2019-10-02 12:53:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:53:31,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:31,483 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:31,483 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:31,484 INFO L82 PathProgramCache]: Analyzing trace with hash -398253357, now seen corresponding path program 1 times [2019-10-02 12:53:31,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:31,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:31,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:31,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:31,596 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 12:53:31,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:31,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:31,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:31,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:31,598 INFO L87 Difference]: Start difference. First operand 5852 states and 9273 transitions. Second operand 3 states. [2019-10-02 12:53:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:32,019 INFO L93 Difference]: Finished difference Result 14785 states and 24094 transitions. [2019-10-02 12:53:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:32,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 12:53:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:32,050 INFO L225 Difference]: With dead ends: 14785 [2019-10-02 12:53:32,050 INFO L226 Difference]: Without dead ends: 9073 [2019-10-02 12:53:32,068 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 12:53:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-10-02 12:53:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 9070. [2019-10-02 12:53:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-10-02 12:53:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 14890 transitions. [2019-10-02 12:53:33,293 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 14890 transitions. Word has length 170 [2019-10-02 12:53:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:33,294 INFO L475 AbstractCegarLoop]: Abstraction has 9070 states and 14890 transitions. [2019-10-02 12:53:33,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 14890 transitions. [2019-10-02 12:53:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:53:33,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:33,324 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:33,324 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1180869376, now seen corresponding path program 1 times [2019-10-02 12:53:33,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:33,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:33,425 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 12:53:33,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:33,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:33,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:33,427 INFO L87 Difference]: Start difference. First operand 9070 states and 14890 transitions. Second operand 3 states. [2019-10-02 12:53:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:33,942 INFO L93 Difference]: Finished difference Result 24143 states and 40456 transitions. [2019-10-02 12:53:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:33,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 12:53:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:33,995 INFO L225 Difference]: With dead ends: 24143 [2019-10-02 12:53:33,995 INFO L226 Difference]: Without dead ends: 15219 [2019-10-02 12:53:34,023 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 12:53:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15219 states. [2019-10-02 12:53:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15219 to 15216. [2019-10-02 12:53:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15216 states. [2019-10-02 12:53:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15216 states to 15216 states and 25547 transitions. [2019-10-02 12:53:34,980 INFO L78 Accepts]: Start accepts. Automaton has 15216 states and 25547 transitions. Word has length 171 [2019-10-02 12:53:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:34,980 INFO L475 AbstractCegarLoop]: Abstraction has 15216 states and 25547 transitions. [2019-10-02 12:53:34,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 15216 states and 25547 transitions. [2019-10-02 12:53:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:53:35,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:35,004 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-02 12:53:35,004 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:35,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1635909509, now seen corresponding path program 1 times [2019-10-02 12:53:35,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:35,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:35,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:35,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:53:35,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:53:35,147 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 12:53:35,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:35,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 2435 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:53:35,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:53:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:53:35,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:53:35,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 12:53:35,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:53:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:53:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:53:35,668 INFO L87 Difference]: Start difference. First operand 15216 states and 25547 transitions. Second operand 6 states. [2019-10-02 12:53:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:36,165 INFO L93 Difference]: Finished difference Result 17898 states and 29283 transitions. [2019-10-02 12:53:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:53:36,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-10-02 12:53:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:36,203 INFO L225 Difference]: With dead ends: 17898 [2019-10-02 12:53:36,204 INFO L226 Difference]: Without dead ends: 16104 [2019-10-02 12:53:36,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:53:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-10-02 12:53:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16025. [2019-10-02 12:53:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16025 states. [2019-10-02 12:53:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16025 states to 16025 states and 26818 transitions. [2019-10-02 12:53:37,161 INFO L78 Accepts]: Start accepts. Automaton has 16025 states and 26818 transitions. Word has length 178 [2019-10-02 12:53:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:37,161 INFO L475 AbstractCegarLoop]: Abstraction has 16025 states and 26818 transitions. [2019-10-02 12:53:37,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:53:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 16025 states and 26818 transitions. [2019-10-02 12:53:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:53:37,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:37,185 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:37,185 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1175854803, now seen corresponding path program 1 times [2019-10-02 12:53:37,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:37,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:37,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:37,303 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 12:53:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:37,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:37,306 INFO L87 Difference]: Start difference. First operand 16025 states and 26818 transitions. Second operand 3 states. [2019-10-02 12:53:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:39,130 INFO L93 Difference]: Finished difference Result 44001 states and 74580 transitions. [2019-10-02 12:53:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:39,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 12:53:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:39,215 INFO L225 Difference]: With dead ends: 44001 [2019-10-02 12:53:39,215 INFO L226 Difference]: Without dead ends: 28592 [2019-10-02 12:53:39,257 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 12:53:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28592 states. [2019-10-02 12:53:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28592 to 28589. [2019-10-02 12:53:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28589 states. [2019-10-02 12:53:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28589 states to 28589 states and 48230 transitions. [2019-10-02 12:53:40,679 INFO L78 Accepts]: Start accepts. Automaton has 28589 states and 48230 transitions. Word has length 172 [2019-10-02 12:53:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:40,680 INFO L475 AbstractCegarLoop]: Abstraction has 28589 states and 48230 transitions. [2019-10-02 12:53:40,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28589 states and 48230 transitions. [2019-10-02 12:53:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:53:40,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:40,721 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:40,721 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash 965139200, now seen corresponding path program 1 times [2019-10-02 12:53:40,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:40,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:40,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:40,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:40,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:40,832 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 12:53:40,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:40,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:40,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:40,834 INFO L87 Difference]: Start difference. First operand 28589 states and 48230 transitions. Second operand 3 states. [2019-10-02 12:53:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:43,062 INFO L93 Difference]: Finished difference Result 79645 states and 134802 transitions. [2019-10-02 12:53:43,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:43,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-02 12:53:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:43,207 INFO L225 Difference]: With dead ends: 79645 [2019-10-02 12:53:43,207 INFO L226 Difference]: Without dead ends: 51806 [2019-10-02 12:53:43,278 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 12:53:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51806 states. [2019-10-02 12:53:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51806 to 51803. [2019-10-02 12:53:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51803 states. [2019-10-02 12:53:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51803 states to 51803 states and 86861 transitions. [2019-10-02 12:53:47,920 INFO L78 Accepts]: Start accepts. Automaton has 51803 states and 86861 transitions. Word has length 173 [2019-10-02 12:53:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:47,921 INFO L475 AbstractCegarLoop]: Abstraction has 51803 states and 86861 transitions. [2019-10-02 12:53:47,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 51803 states and 86861 transitions. [2019-10-02 12:53:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:53:47,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:47,967 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:47,967 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash -227044399, now seen corresponding path program 1 times [2019-10-02 12:53:47,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:47,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:47,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:48,069 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 12:53:48,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:48,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:48,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:48,071 INFO L87 Difference]: Start difference. First operand 51803 states and 86861 transitions. Second operand 3 states. [2019-10-02 12:53:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:52,116 INFO L93 Difference]: Finished difference Result 146509 states and 246954 transitions. [2019-10-02 12:53:52,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:52,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-02 12:53:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:52,363 INFO L225 Difference]: With dead ends: 146509 [2019-10-02 12:53:52,363 INFO L226 Difference]: Without dead ends: 95672 [2019-10-02 12:53:52,451 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 12:53:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95672 states. [2019-10-02 12:54:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95672 to 95669. [2019-10-02 12:54:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95669 states. [2019-10-02 12:54:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95669 states to 95669 states and 159920 transitions. [2019-10-02 12:54:00,577 INFO L78 Accepts]: Start accepts. Automaton has 95669 states and 159920 transitions. Word has length 174 [2019-10-02 12:54:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:00,578 INFO L475 AbstractCegarLoop]: Abstraction has 95669 states and 159920 transitions. [2019-10-02 12:54:00,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 95669 states and 159920 transitions. [2019-10-02 12:54:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:54:00,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:00,636 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:00,636 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash 933599936, now seen corresponding path program 1 times [2019-10-02 12:54:00,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:00,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:00,745 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 12:54:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:00,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:00,747 INFO L87 Difference]: Start difference. First operand 95669 states and 159920 transitions. Second operand 3 states. [2019-10-02 12:54:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:10,190 INFO L93 Difference]: Finished difference Result 180566 states and 299160 transitions. [2019-10-02 12:54:10,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:10,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 12:54:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:10,677 INFO L225 Difference]: With dead ends: 180566 [2019-10-02 12:54:10,677 INFO L226 Difference]: Without dead ends: 178772 [2019-10-02 12:54:10,728 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 12:54:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178772 states. [2019-10-02 12:54:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178772 to 178769. [2019-10-02 12:54:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178769 states. [2019-10-02 12:54:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178769 states to 178769 states and 293752 transitions. [2019-10-02 12:54:23,181 INFO L78 Accepts]: Start accepts. Automaton has 178769 states and 293752 transitions. Word has length 175 [2019-10-02 12:54:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:23,181 INFO L475 AbstractCegarLoop]: Abstraction has 178769 states and 293752 transitions. [2019-10-02 12:54:23,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 178769 states and 293752 transitions. [2019-10-02 12:54:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:54:23,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:23,252 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:23,252 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash 735418385, now seen corresponding path program 1 times [2019-10-02 12:54:23,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:23,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:23,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:23,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:23,562 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 12:54:23,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:23,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:23,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:23,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:23,564 INFO L87 Difference]: Start difference. First operand 178769 states and 293752 transitions. Second operand 3 states. [2019-10-02 12:54:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:35,563 INFO L93 Difference]: Finished difference Result 180858 states and 296457 transitions. [2019-10-02 12:54:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:35,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-02 12:54:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:36,161 INFO L225 Difference]: With dead ends: 180858 [2019-10-02 12:54:36,161 INFO L226 Difference]: Without dead ends: 179154 [2019-10-02 12:54:36,232 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 12:54:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179154 states. [2019-10-02 12:54:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179154 to 179148. [2019-10-02 12:54:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179148 states. [2019-10-02 12:54:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179148 states to 179148 states and 294218 transitions. [2019-10-02 12:54:46,837 INFO L78 Accepts]: Start accepts. Automaton has 179148 states and 294218 transitions. Word has length 176 [2019-10-02 12:54:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:46,837 INFO L475 AbstractCegarLoop]: Abstraction has 179148 states and 294218 transitions. [2019-10-02 12:54:46,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 179148 states and 294218 transitions. [2019-10-02 12:54:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:54:47,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:47,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:47,492 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1533520304, now seen corresponding path program 1 times [2019-10-02 12:54:47,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:47,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:47,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:47,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:47,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 12:54:47,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:47,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:54:47,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:54:47,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:54:47,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:47,638 INFO L87 Difference]: Start difference. First operand 179148 states and 294218 transitions. Second operand 5 states. [2019-10-02 12:54:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:59,286 INFO L93 Difference]: Finished difference Result 180156 states and 295462 transitions. [2019-10-02 12:54:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:54:59,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-10-02 12:54:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:59,841 INFO L225 Difference]: With dead ends: 180156 [2019-10-02 12:54:59,841 INFO L226 Difference]: Without dead ends: 178803 [2019-10-02 12:54:59,895 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 12:55:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178803 states. [2019-10-02 12:55:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178803 to 178391. [2019-10-02 12:55:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178391 states. [2019-10-02 12:55:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178391 states to 178391 states and 293220 transitions. [2019-10-02 12:55:10,317 INFO L78 Accepts]: Start accepts. Automaton has 178391 states and 293220 transitions. Word has length 279 [2019-10-02 12:55:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:10,317 INFO L475 AbstractCegarLoop]: Abstraction has 178391 states and 293220 transitions. [2019-10-02 12:55:10,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:55:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 178391 states and 293220 transitions. [2019-10-02 12:55:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:55:10,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:10,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:10,986 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1552551882, now seen corresponding path program 1 times [2019-10-02 12:55:10,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:10,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 12:55:15,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:15,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:55:15,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:55:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:55:15,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:55:15,019 INFO L87 Difference]: Start difference. First operand 178391 states and 293220 transitions. Second operand 11 states. [2019-10-02 12:55:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:27,153 INFO L93 Difference]: Finished difference Result 178956 states and 293912 transitions. [2019-10-02 12:55:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:55:27,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 280 [2019-10-02 12:55:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:27,638 INFO L225 Difference]: With dead ends: 178956 [2019-10-02 12:55:27,638 INFO L226 Difference]: Without dead ends: 178495 [2019-10-02 12:55:27,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 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 12:55:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178495 states. [2019-10-02 12:55:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178495 to 178196. [2019-10-02 12:55:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178196 states. [2019-10-02 12:55:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178196 states to 178196 states and 292946 transitions. [2019-10-02 12:55:40,522 INFO L78 Accepts]: Start accepts. Automaton has 178196 states and 292946 transitions. Word has length 280 [2019-10-02 12:55:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:40,523 INFO L475 AbstractCegarLoop]: Abstraction has 178196 states and 292946 transitions. [2019-10-02 12:55:40,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:55:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 178196 states and 292946 transitions. [2019-10-02 12:55:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 12:55:45,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:45,438 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:45,438 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -398912091, now seen corresponding path program 1 times [2019-10-02 12:55:45,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 12:55:45,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:45,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:55:45,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:55:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:55:45,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:55:45,636 INFO L87 Difference]: Start difference. First operand 178196 states and 292946 transitions. Second operand 7 states. [2019-10-02 12:56:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:05,653 INFO L93 Difference]: Finished difference Result 354993 states and 586409 transitions. [2019-10-02 12:56:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:56:05,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 342 [2019-10-02 12:56:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:06,762 INFO L225 Difference]: With dead ends: 354993 [2019-10-02 12:56:06,763 INFO L226 Difference]: Without dead ends: 354287 [2019-10-02 12:56:06,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:56:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354287 states. [2019-10-02 12:56:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354287 to 353725. [2019-10-02 12:56:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353725 states. [2019-10-02 12:56:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353725 states to 353725 states and 584875 transitions. [2019-10-02 12:56:40,704 INFO L78 Accepts]: Start accepts. Automaton has 353725 states and 584875 transitions. Word has length 342 [2019-10-02 12:56:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:40,704 INFO L475 AbstractCegarLoop]: Abstraction has 353725 states and 584875 transitions. [2019-10-02 12:56:40,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:56:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 353725 states and 584875 transitions. [2019-10-02 12:56:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-02 12:56:43,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:43,457 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:43,457 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash -74236452, now seen corresponding path program 1 times [2019-10-02 12:56:43,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:43,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:43,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:43,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 12:56:43,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:43,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:56:43,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:56:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:56:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:56:43,698 INFO L87 Difference]: Start difference. First operand 353725 states and 584875 transitions. Second operand 9 states. [2019-10-02 12:57:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:04,901 INFO L93 Difference]: Finished difference Result 354235 states and 585536 transitions. [2019-10-02 12:57:04,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:57:04,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 343 [2019-10-02 12:57:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:05,915 INFO L225 Difference]: With dead ends: 354235 [2019-10-02 12:57:05,915 INFO L226 Difference]: Without dead ends: 353809 [2019-10-02 12:57:06,022 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 12:57:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353809 states. [2019-10-02 12:57:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353809 to 353743. [2019-10-02 12:57:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353743 states. [2019-10-02 12:57:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353743 states to 353743 states and 584917 transitions. [2019-10-02 12:57:45,134 INFO L78 Accepts]: Start accepts. Automaton has 353743 states and 584917 transitions. Word has length 343 [2019-10-02 12:57:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:45,135 INFO L475 AbstractCegarLoop]: Abstraction has 353743 states and 584917 transitions. [2019-10-02 12:57:45,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:57:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 353743 states and 584917 transitions. [2019-10-02 12:57:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-02 12:57:46,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:46,567 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:46,567 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash 151989711, now seen corresponding path program 1 times [2019-10-02 12:57:46,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:46,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:46,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 12:57:46,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:46,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:57:46,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:57:46,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:57:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:57:46,749 INFO L87 Difference]: Start difference. First operand 353743 states and 584917 transitions. Second operand 7 states. [2019-10-02 12:58:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:31,905 INFO L93 Difference]: Finished difference Result 706920 states and 1174353 transitions. [2019-10-02 12:58:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:31,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2019-10-02 12:58:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:34,952 INFO L225 Difference]: With dead ends: 706920 [2019-10-02 12:58:34,952 INFO L226 Difference]: Without dead ends: 705718 [2019-10-02 12:58:35,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705718 states. [2019-10-02 12:59:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705718 to 705076. [2019-10-02 12:59:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705076 states. [2019-10-02 12:59:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705076 states to 705076 states and 1172159 transitions. [2019-10-02 12:59:47,050 INFO L78 Accepts]: Start accepts. Automaton has 705076 states and 1172159 transitions. Word has length 344 [2019-10-02 12:59:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:47,050 INFO L475 AbstractCegarLoop]: Abstraction has 705076 states and 1172159 transitions. [2019-10-02 12:59:47,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:59:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 705076 states and 1172159 transitions. [2019-10-02 13:00:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 13:00:04,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:04,576 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:04,576 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash 543077878, now seen corresponding path program 1 times [2019-10-02 13:00:04,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 13:00:04,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:04,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:00:04,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:00:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:00:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:00:04,802 INFO L87 Difference]: Start difference. First operand 705076 states and 1172159 transitions. Second operand 9 states. [2019-10-02 13:00:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:42,852 INFO L93 Difference]: Finished difference Result 705844 states and 1173172 transitions. [2019-10-02 13:00:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:00:42,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2019-10-02 13:00:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:45,965 INFO L225 Difference]: With dead ends: 705844 [2019-10-02 13:00:45,965 INFO L226 Difference]: Without dead ends: 705246 [2019-10-02 13:00:46,163 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 13:00:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705246 states. [2019-10-02 13:02:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705246 to 705178. [2019-10-02 13:02:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705178 states. [2019-10-02 13:02:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705178 states to 705178 states and 1172319 transitions. [2019-10-02 13:02:04,939 INFO L78 Accepts]: Start accepts. Automaton has 705178 states and 1172319 transitions. Word has length 345 [2019-10-02 13:02:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:04,939 INFO L475 AbstractCegarLoop]: Abstraction has 705178 states and 1172319 transitions. [2019-10-02 13:02:04,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:02:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 705178 states and 1172319 transitions. [2019-10-02 13:02:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-02 13:02:08,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:08,335 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:08,335 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1192402011, now seen corresponding path program 1 times [2019-10-02 13:02:08,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:08,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 13:02:09,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:09,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:02:09,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:02:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:02:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:02:09,758 INFO L87 Difference]: Start difference. First operand 705178 states and 1172319 transitions. Second operand 7 states.