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_spec8_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:46:19,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:46:19,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:46:19,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:46:19,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:46:19,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:46:19,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:46:20,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:46:20,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:46:20,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:46:20,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:46:20,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:46:20,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:46:20,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:46:20,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:46:20,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:46:20,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:46:20,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:46:20,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:46:20,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:46:20,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:46:20,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:46:20,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:46:20,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:46:20,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:46:20,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:46:20,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:46:20,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:46:20,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:46:20,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:46:20,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:46:20,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:46:20,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:46:20,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:46:20,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:46:20,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:46:20,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:46:20,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:46:20,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:46:20,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:46:20,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:46:20,030 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-09-08 05:46:20,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:46:20,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:46:20,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:46:20,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:46:20,047 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:46:20,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:46:20,047 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:46:20,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:46:20,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:46:20,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:46:20,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:46:20,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:46:20,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:46:20,049 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:46:20,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:46:20,049 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:46:20,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:46:20,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:46:20,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:46:20,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:46:20,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:46:20,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:46:20,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:46:20,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:46:20,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:46:20,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:46:20,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:46:20,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:46:20,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:46:20,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:46:20,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:46:20,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:46:20,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:46:20,107 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:46:20,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product32.cil.c [2019-09-08 05:46:20,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fbba1a4/c45b75ca8441455598aec83fae919bc3/FLAG725582440 [2019-09-08 05:46:20,795 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:46:20,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product32.cil.c [2019-09-08 05:46:20,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fbba1a4/c45b75ca8441455598aec83fae919bc3/FLAG725582440 [2019-09-08 05:46:21,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fbba1a4/c45b75ca8441455598aec83fae919bc3 [2019-09-08 05:46:21,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:46:21,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:46:21,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:46:21,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:46:21,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:46:21,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:46:21" (1/1) ... [2019-09-08 05:46:21,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0774e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:21, skipping insertion in model container [2019-09-08 05:46:21,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:46:21" (1/1) ... [2019-09-08 05:46:21,050 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:46:21,139 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:46:21,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:46:21,929 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:46:22,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:46:22,193 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:46:22,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22 WrapperNode [2019-09-08 05:46:22,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:46:22,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:46:22,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:46:22,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:46:22,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... [2019-09-08 05:46:22,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:46:22,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:46:22,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:46:22,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:46:22,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:46:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:46:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:46:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:46:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:46:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:46:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:46:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:46:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:46:22,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:46:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:46:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:46:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:46:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:46:22,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:46:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:46:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:46:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:46:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:46:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:46:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:46:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:46:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:46:22,482 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:46:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:46:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:46:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:46:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:46:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:46:22,484 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:46:22,485 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:46:22,485 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:46:22,485 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:46:22,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:46:22,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:46:22,486 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:46:22,486 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:46:22,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:46:22,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:46:22,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:46:22,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:46:22,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:46:22,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:46:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:46:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:46:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:46:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:46:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:46:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:46:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:46:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:46:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:46:22,491 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:46:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:46:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:46:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:46:22,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:46:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:46:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:46:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:46:22,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:46:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:46:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:46:22,494 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:46:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:46:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:46:22,495 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:46:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:46:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:46:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:46:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:46:22,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:46:22,497 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:46:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:46:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:46:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:46:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:46:22,498 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:46:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:46:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:46:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:46:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:46:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:46:22,499 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:46:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:46:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:46:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:46:22,500 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:46:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:46:22,501 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:46:22,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:46:22,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:46:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:46:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:46:22,502 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:46:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:46:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:46:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:46:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:46:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:46:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:46:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:46:22,504 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:46:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:46:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:46:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:46:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:46:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:46:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:46:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:46:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:46:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:46:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:46:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:46:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:46:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:46:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:46:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:46:22,517 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:46:22,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:46:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:46:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:46:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:46:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:46:22,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:46:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:46:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:46:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:46:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:46:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:46:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:46:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:46:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:46:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:46:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:46:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:46:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:46:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:46:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:46:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:46:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:46:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:46:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:46:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:46:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:46:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:46:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:46:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:46:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:46:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:46:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:46:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:46:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:46:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:46:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:46:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:46:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:46:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:46:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:46:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:46:22,528 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:46:22,528 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:46:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:46:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:46:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:46:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:46:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:46:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:46:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:46:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:46:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:46:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:46:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:46:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:46:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:46:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:46:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:46:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:46:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:46:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:46:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:46:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:46:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:46:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:46:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:46:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:46:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:46:24,706 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:46:24,706 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:46:24,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:46:24 BoogieIcfgContainer [2019-09-08 05:46:24,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:46:24,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:46:24,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:46:24,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:46:24,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:46:21" (1/3) ... [2019-09-08 05:46:24,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e027c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:46:24, skipping insertion in model container [2019-09-08 05:46:24,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:46:22" (2/3) ... [2019-09-08 05:46:24,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e027c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:46:24, skipping insertion in model container [2019-09-08 05:46:24,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:46:24" (3/3) ... [2019-09-08 05:46:24,717 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product32.cil.c [2019-09-08 05:46:24,729 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:46:24,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:46:24,769 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:46:24,831 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:46:24,832 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:46:24,832 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:46:24,833 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:46:24,834 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:46:24,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:46:24,834 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:46:24,834 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:46:24,835 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:46:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states. [2019-09-08 05:46:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:46:24,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:24,920 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:24,925 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1870939894, now seen corresponding path program 1 times [2019-09-08 05:46:24,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:24,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:24,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:24,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:46:25,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:25,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:46:25,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:46:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:46:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:46:25,740 INFO L87 Difference]: Start difference. First operand 641 states. Second operand 2 states. [2019-09-08 05:46:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:25,821 INFO L93 Difference]: Finished difference Result 912 states and 1235 transitions. [2019-09-08 05:46:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:46:25,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-08 05:46:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:25,849 INFO L225 Difference]: With dead ends: 912 [2019-09-08 05:46:25,849 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 05:46:25,856 INFO L628 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-09-08 05:46:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 05:46:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 05:46:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 05:46:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 796 transitions. [2019-09-08 05:46:25,960 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 796 transitions. Word has length 167 [2019-09-08 05:46:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:25,963 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 796 transitions. [2019-09-08 05:46:25,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:46:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 796 transitions. [2019-09-08 05:46:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:46:25,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:25,968 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:25,969 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash 749800882, now seen corresponding path program 1 times [2019-09-08 05:46:25,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:46:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:26,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:26,255 INFO L87 Difference]: Start difference. First operand 584 states and 796 transitions. Second operand 3 states. [2019-09-08 05:46:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:26,328 INFO L93 Difference]: Finished difference Result 895 states and 1200 transitions. [2019-09-08 05:46:26,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:26,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:46:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:26,342 INFO L225 Difference]: With dead ends: 895 [2019-09-08 05:46:26,343 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 05:46:26,347 INFO L628 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-09-08 05:46:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 05:46:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 586. [2019-09-08 05:46:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-08 05:46:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 798 transitions. [2019-09-08 05:46:26,408 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 798 transitions. Word has length 168 [2019-09-08 05:46:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:26,409 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 798 transitions. [2019-09-08 05:46:26,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 798 transitions. [2019-09-08 05:46:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 05:46:26,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:26,417 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:26,417 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash -307093278, now seen corresponding path program 1 times [2019-09-08 05:46:26,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:26,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:26,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:46:26,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:26,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:26,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:26,689 INFO L87 Difference]: Start difference. First operand 586 states and 798 transitions. Second operand 3 states. [2019-09-08 05:46:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:26,726 INFO L93 Difference]: Finished difference Result 1150 states and 1597 transitions. [2019-09-08 05:46:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:26,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 05:46:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:26,734 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 05:46:26,735 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 05:46:26,737 INFO L628 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-09-08 05:46:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 05:46:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 628. [2019-09-08 05:46:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 05:46:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 870 transitions. [2019-09-08 05:46:26,767 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 870 transitions. Word has length 178 [2019-09-08 05:46:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:26,768 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 870 transitions. [2019-09-08 05:46:26,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 870 transitions. [2019-09-08 05:46:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 05:46:26,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:26,773 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:26,773 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1018259140, now seen corresponding path program 1 times [2019-09-08 05:46:26,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:26,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:26,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:26,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:26,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:46:26,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:26,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:26,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:26,932 INFO L87 Difference]: Start difference. First operand 628 states and 870 transitions. Second operand 3 states. [2019-09-08 05:46:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:26,978 INFO L93 Difference]: Finished difference Result 1273 states and 1808 transitions. [2019-09-08 05:46:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:26,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 05:46:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:26,985 INFO L225 Difference]: With dead ends: 1273 [2019-09-08 05:46:26,985 INFO L226 Difference]: Without dead ends: 710 [2019-09-08 05:46:26,987 INFO L628 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-09-08 05:46:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-08 05:46:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 709. [2019-09-08 05:46:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-08 05:46:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1008 transitions. [2019-09-08 05:46:27,021 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1008 transitions. Word has length 179 [2019-09-08 05:46:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:27,022 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1008 transitions. [2019-09-08 05:46:27,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1008 transitions. [2019-09-08 05:46:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 05:46:27,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:27,026 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:27,026 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash 826212994, now seen corresponding path program 1 times [2019-09-08 05:46:27,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:46:27,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:27,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:27,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:27,285 INFO L87 Difference]: Start difference. First operand 709 states and 1008 transitions. Second operand 3 states. [2019-09-08 05:46:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:27,329 INFO L93 Difference]: Finished difference Result 1510 states and 2212 transitions. [2019-09-08 05:46:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:27,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 05:46:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:27,338 INFO L225 Difference]: With dead ends: 1510 [2019-09-08 05:46:27,338 INFO L226 Difference]: Without dead ends: 866 [2019-09-08 05:46:27,341 INFO L628 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-09-08 05:46:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-08 05:46:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 865. [2019-09-08 05:46:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-08 05:46:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1272 transitions. [2019-09-08 05:46:27,402 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1272 transitions. Word has length 180 [2019-09-08 05:46:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:27,403 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1272 transitions. [2019-09-08 05:46:27,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1272 transitions. [2019-09-08 05:46:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 05:46:27,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:27,410 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:27,410 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash -384196708, now seen corresponding path program 1 times [2019-09-08 05:46:27,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:27,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:46:27,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:27,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:27,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:27,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:27,663 INFO L87 Difference]: Start difference. First operand 865 states and 1272 transitions. Second operand 3 states. [2019-09-08 05:46:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:27,734 INFO L93 Difference]: Finished difference Result 1966 states and 2984 transitions. [2019-09-08 05:46:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:27,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 05:46:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:27,743 INFO L225 Difference]: With dead ends: 1966 [2019-09-08 05:46:27,743 INFO L226 Difference]: Without dead ends: 1166 [2019-09-08 05:46:27,749 INFO L628 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-09-08 05:46:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-08 05:46:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1165. [2019-09-08 05:46:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-09-08 05:46:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1776 transitions. [2019-09-08 05:46:27,811 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1776 transitions. Word has length 181 [2019-09-08 05:46:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:27,814 INFO L475 AbstractCegarLoop]: Abstraction has 1165 states and 1776 transitions. [2019-09-08 05:46:27,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1776 transitions. [2019-09-08 05:46:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 05:46:27,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:27,823 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:27,824 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:27,824 INFO L82 PathProgramCache]: Analyzing trace with hash 726848663, now seen corresponding path program 1 times [2019-09-08 05:46:27,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:27,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:28,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:28,134 INFO L87 Difference]: Start difference. First operand 1165 states and 1776 transitions. Second operand 3 states. [2019-09-08 05:46:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:28,205 INFO L93 Difference]: Finished difference Result 1601 states and 2368 transitions. [2019-09-08 05:46:28,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:28,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 05:46:28,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:28,215 INFO L225 Difference]: With dead ends: 1601 [2019-09-08 05:46:28,216 INFO L226 Difference]: Without dead ends: 1306 [2019-09-08 05:46:28,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-09-08 05:46:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-08 05:46:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1305. [2019-09-08 05:46:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-09-08 05:46:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1973 transitions. [2019-09-08 05:46:28,305 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1973 transitions. Word has length 184 [2019-09-08 05:46:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:28,306 INFO L475 AbstractCegarLoop]: Abstraction has 1305 states and 1973 transitions. [2019-09-08 05:46:28,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1973 transitions. [2019-09-08 05:46:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:46:28,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:28,318 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:46:28,319 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash 512730866, now seen corresponding path program 1 times [2019-09-08 05:46:28,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:28,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:28,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:46:28,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:28,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:46:28,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:46:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:46:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:46:28,610 INFO L87 Difference]: Start difference. First operand 1305 states and 1973 transitions. Second operand 6 states. [2019-09-08 05:46:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:29,414 INFO L93 Difference]: Finished difference Result 2958 states and 4439 transitions. [2019-09-08 05:46:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:46:29,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 329 [2019-09-08 05:46:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:29,441 INFO L225 Difference]: With dead ends: 2958 [2019-09-08 05:46:29,441 INFO L226 Difference]: Without dead ends: 2561 [2019-09-08 05:46:29,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:46:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2019-09-08 05:46:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2550. [2019-09-08 05:46:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2019-09-08 05:46:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3896 transitions. [2019-09-08 05:46:29,573 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3896 transitions. Word has length 329 [2019-09-08 05:46:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:29,574 INFO L475 AbstractCegarLoop]: Abstraction has 2550 states and 3896 transitions. [2019-09-08 05:46:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:46:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3896 transitions. [2019-09-08 05:46:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 05:46:29,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:29,592 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:46:29,592 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -603308041, now seen corresponding path program 1 times [2019-09-08 05:46:29,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:29,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:29,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:29,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:29,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:46:29,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:29,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:46:29,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:46:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:46:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:46:29,903 INFO L87 Difference]: Start difference. First operand 2550 states and 3896 transitions. Second operand 11 states. [2019-09-08 05:46:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:30,442 INFO L93 Difference]: Finished difference Result 3341 states and 4945 transitions. [2019-09-08 05:46:30,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:46:30,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 330 [2019-09-08 05:46:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:30,459 INFO L225 Difference]: With dead ends: 3341 [2019-09-08 05:46:30,459 INFO L226 Difference]: Without dead ends: 2524 [2019-09-08 05:46:30,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:46:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-08 05:46:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2520. [2019-09-08 05:46:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2520 states. [2019-09-08 05:46:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3845 transitions. [2019-09-08 05:46:30,585 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3845 transitions. Word has length 330 [2019-09-08 05:46:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:30,585 INFO L475 AbstractCegarLoop]: Abstraction has 2520 states and 3845 transitions. [2019-09-08 05:46:30,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:46:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3845 transitions. [2019-09-08 05:46:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 05:46:30,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:30,603 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:46:30,603 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash 882423034, now seen corresponding path program 1 times [2019-09-08 05:46:30,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:30,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:30,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:30,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:30,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:46:30,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:30,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:30,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:30,924 INFO L87 Difference]: Start difference. First operand 2520 states and 3845 transitions. Second operand 3 states. [2019-09-08 05:46:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:31,121 INFO L93 Difference]: Finished difference Result 6129 states and 9587 transitions. [2019-09-08 05:46:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:31,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-09-08 05:46:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:31,144 INFO L225 Difference]: With dead ends: 6129 [2019-09-08 05:46:31,145 INFO L226 Difference]: Without dead ends: 3674 [2019-09-08 05:46:31,154 INFO L628 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-09-08 05:46:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-09-08 05:46:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3672. [2019-09-08 05:46:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3672 states. [2019-09-08 05:46:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5781 transitions. [2019-09-08 05:46:31,344 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5781 transitions. Word has length 371 [2019-09-08 05:46:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:31,345 INFO L475 AbstractCegarLoop]: Abstraction has 3672 states and 5781 transitions. [2019-09-08 05:46:31,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5781 transitions. [2019-09-08 05:46:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 05:46:31,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:31,366 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:46:31,366 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:31,367 INFO L82 PathProgramCache]: Analyzing trace with hash 788904095, now seen corresponding path program 1 times [2019-09-08 05:46:31,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:31,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:31,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:31,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:31,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 05:46:31,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:31,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:31,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:31,582 INFO L87 Difference]: Start difference. First operand 3672 states and 5781 transitions. Second operand 3 states. [2019-09-08 05:46:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:31,834 INFO L93 Difference]: Finished difference Result 9617 states and 15427 transitions. [2019-09-08 05:46:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:31,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-09-08 05:46:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:31,870 INFO L225 Difference]: With dead ends: 9617 [2019-09-08 05:46:31,870 INFO L226 Difference]: Without dead ends: 6010 [2019-09-08 05:46:31,882 INFO L628 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-09-08 05:46:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2019-09-08 05:46:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 6008. [2019-09-08 05:46:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6008 states. [2019-09-08 05:46:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6008 states to 6008 states and 9653 transitions. [2019-09-08 05:46:32,174 INFO L78 Accepts]: Start accepts. Automaton has 6008 states and 9653 transitions. Word has length 357 [2019-09-08 05:46:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:32,175 INFO L475 AbstractCegarLoop]: Abstraction has 6008 states and 9653 transitions. [2019-09-08 05:46:32,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6008 states and 9653 transitions. [2019-09-08 05:46:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 05:46:32,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:32,210 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:46:32,210 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:32,210 INFO L82 PathProgramCache]: Analyzing trace with hash 535304145, now seen corresponding path program 1 times [2019-09-08 05:46:32,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:32,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:32,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:32,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:32,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:46:32,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:46:32,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:46:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:33,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 3895 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:46:33,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:46:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:46:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:46:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:46:34,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:46:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:46:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:46:34,030 INFO L87 Difference]: Start difference. First operand 6008 states and 9653 transitions. Second operand 29 states. [2019-09-08 05:47:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:20,343 INFO L93 Difference]: Finished difference Result 23256 states and 37198 transitions. [2019-09-08 05:47:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 05:47:20,345 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 338 [2019-09-08 05:47:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:20,450 INFO L225 Difference]: With dead ends: 23256 [2019-09-08 05:47:20,450 INFO L226 Difference]: Without dead ends: 17087 [2019-09-08 05:47:20,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10450 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-09-08 05:47:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17087 states. [2019-09-08 05:47:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17087 to 16657. [2019-09-08 05:47:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16657 states. [2019-09-08 05:47:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16657 states to 16657 states and 26434 transitions. [2019-09-08 05:47:21,771 INFO L78 Accepts]: Start accepts. Automaton has 16657 states and 26434 transitions. Word has length 338 [2019-09-08 05:47:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:21,773 INFO L475 AbstractCegarLoop]: Abstraction has 16657 states and 26434 transitions. [2019-09-08 05:47:21,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:47:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16657 states and 26434 transitions. [2019-09-08 05:47:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 05:47:21,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:21,871 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:47:21,872 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash 912307473, now seen corresponding path program 1 times [2019-09-08 05:47:21,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:21,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:21,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:21,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:22,318 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2019-09-08 05:47:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:47:22,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:22,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:47:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:47:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:22,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 3897 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:47:23,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:47:23,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:47:23,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:47:23,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:47:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:47:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:47:23,285 INFO L87 Difference]: Start difference. First operand 16657 states and 26434 transitions. Second operand 23 states. [2019-09-08 05:47:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:27,387 INFO L93 Difference]: Finished difference Result 34080 states and 54944 transitions. [2019-09-08 05:47:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:47:27,388 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 340 [2019-09-08 05:47:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:27,462 INFO L225 Difference]: With dead ends: 34080 [2019-09-08 05:47:27,462 INFO L226 Difference]: Without dead ends: 17296 [2019-09-08 05:47:27,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 05:47:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17296 states. [2019-09-08 05:47:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17296 to 17234. [2019-09-08 05:47:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17234 states. [2019-09-08 05:47:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17234 states to 17234 states and 27389 transitions. [2019-09-08 05:47:28,458 INFO L78 Accepts]: Start accepts. Automaton has 17234 states and 27389 transitions. Word has length 340 [2019-09-08 05:47:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:28,459 INFO L475 AbstractCegarLoop]: Abstraction has 17234 states and 27389 transitions. [2019-09-08 05:47:28,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:47:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17234 states and 27389 transitions. [2019-09-08 05:47:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 05:47:28,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:28,569 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:47:28,570 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash -253738839, now seen corresponding path program 1 times [2019-09-08 05:47:28,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:28,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:28,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:28,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:47:28,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:28,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:47:28,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:47:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:47:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:47:28,802 INFO L87 Difference]: Start difference. First operand 17234 states and 27389 transitions. Second operand 5 states. [2019-09-08 05:47:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:29,926 INFO L93 Difference]: Finished difference Result 23649 states and 36459 transitions. [2019-09-08 05:47:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:47:29,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2019-09-08 05:47:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:29,992 INFO L225 Difference]: With dead ends: 23649 [2019-09-08 05:47:29,992 INFO L226 Difference]: Without dead ends: 16619 [2019-09-08 05:47:30,014 INFO L628 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-09-08 05:47:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16619 states. [2019-09-08 05:47:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16619 to 16517. [2019-09-08 05:47:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16517 states. [2019-09-08 05:47:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16517 states to 16517 states and 26320 transitions. [2019-09-08 05:47:30,777 INFO L78 Accepts]: Start accepts. Automaton has 16517 states and 26320 transitions. Word has length 343 [2019-09-08 05:47:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:30,778 INFO L475 AbstractCegarLoop]: Abstraction has 16517 states and 26320 transitions. [2019-09-08 05:47:30,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:47:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16517 states and 26320 transitions. [2019-09-08 05:47:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 05:47:30,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:30,841 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:47:30,842 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1689573514, now seen corresponding path program 1 times [2019-09-08 05:47:30,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:30,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:30,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:30,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:30,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:47:31,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:31,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:47:31,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:31,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 3900 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:47:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:47:32,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:47:32,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:47:32,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:47:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:47:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:47:32,157 INFO L87 Difference]: Start difference. First operand 16517 states and 26320 transitions. Second operand 25 states. [2019-09-08 05:48:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:14,400 INFO L93 Difference]: Finished difference Result 40128 states and 63309 transitions. [2019-09-08 05:48:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:48:14,401 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 343 [2019-09-08 05:48:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:14,509 INFO L225 Difference]: With dead ends: 40128 [2019-09-08 05:48:14,509 INFO L226 Difference]: Without dead ends: 21445 [2019-09-08 05:48:14,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9618 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:48:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21445 states. [2019-09-08 05:48:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21445 to 20099. [2019-09-08 05:48:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20099 states. [2019-09-08 05:48:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20099 states to 20099 states and 31512 transitions. [2019-09-08 05:48:15,553 INFO L78 Accepts]: Start accepts. Automaton has 20099 states and 31512 transitions. Word has length 343 [2019-09-08 05:48:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:15,554 INFO L475 AbstractCegarLoop]: Abstraction has 20099 states and 31512 transitions. [2019-09-08 05:48:15,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:48:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 20099 states and 31512 transitions. [2019-09-08 05:48:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 05:48:15,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:15,604 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:15,604 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash 448866927, now seen corresponding path program 1 times [2019-09-08 05:48:15,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:48:16,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:48:16,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:48:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:16,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 3901 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:48:16,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:48:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:48:17,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:48:17,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:48:17,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:48:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:48:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:48:17,271 INFO L87 Difference]: Start difference. First operand 20099 states and 31512 transitions. Second operand 25 states. [2019-09-08 05:48:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:58,336 INFO L93 Difference]: Finished difference Result 48627 states and 75764 transitions. [2019-09-08 05:48:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:48:58,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 344 [2019-09-08 05:48:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:58,473 INFO L225 Difference]: With dead ends: 48627 [2019-09-08 05:48:58,474 INFO L226 Difference]: Without dead ends: 25285 [2019-09-08 05:48:58,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9628 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:48:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25285 states. [2019-09-08 05:48:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25285 to 23066. [2019-09-08 05:48:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23066 states. [2019-09-08 05:48:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23066 states to 23066 states and 35781 transitions. [2019-09-08 05:48:59,542 INFO L78 Accepts]: Start accepts. Automaton has 23066 states and 35781 transitions. Word has length 344 [2019-09-08 05:48:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:59,543 INFO L475 AbstractCegarLoop]: Abstraction has 23066 states and 35781 transitions. [2019-09-08 05:48:59,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:48:59,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23066 states and 35781 transitions. [2019-09-08 05:48:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 05:48:59,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:59,594 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:59,595 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash -838030255, now seen corresponding path program 1 times [2019-09-08 05:48:59,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:59,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:59,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:48:59,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:48:59,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:48:59,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:49:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:00,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 3902 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:49:00,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:49:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:49:00,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:49:00,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 05:49:00,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:49:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:49:00,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:49:00,977 INFO L87 Difference]: Start difference. First operand 23066 states and 35781 transitions. Second operand 14 states. [2019-09-08 05:49:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:13,726 INFO L93 Difference]: Finished difference Result 78368 states and 135697 transitions. [2019-09-08 05:49:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:49:13,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 346 [2019-09-08 05:49:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:14,001 INFO L225 Difference]: With dead ends: 78368 [2019-09-08 05:49:14,001 INFO L226 Difference]: Without dead ends: 55382 [2019-09-08 05:49:14,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 05:49:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55382 states. [2019-09-08 05:49:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55382 to 53208. [2019-09-08 05:49:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53208 states. [2019-09-08 05:49:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53208 states to 53208 states and 92417 transitions. [2019-09-08 05:49:18,996 INFO L78 Accepts]: Start accepts. Automaton has 53208 states and 92417 transitions. Word has length 346 [2019-09-08 05:49:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:18,997 INFO L475 AbstractCegarLoop]: Abstraction has 53208 states and 92417 transitions. [2019-09-08 05:49:18,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:49:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 53208 states and 92417 transitions. [2019-09-08 05:49:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 05:49:19,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:19,050 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:49:19,050 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2044275887, now seen corresponding path program 1 times [2019-09-08 05:49:19,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:19,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:19,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:49:19,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:49:19,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:49:19,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:20,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 3903 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:49:20,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:49:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:49:20,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:49:20,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-09-08 05:49:20,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 05:49:20,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 05:49:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:49:20,472 INFO L87 Difference]: Start difference. First operand 53208 states and 92417 transitions. Second operand 31 states. [2019-09-08 05:49:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:27,712 INFO L93 Difference]: Finished difference Result 116989 states and 236026 transitions. [2019-09-08 05:49:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 05:49:27,713 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 347 [2019-09-08 05:49:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:28,076 INFO L225 Difference]: With dead ends: 116989 [2019-09-08 05:49:28,076 INFO L226 Difference]: Without dead ends: 59539 [2019-09-08 05:49:28,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=3929, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 05:49:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59539 states. [2019-09-08 05:49:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59539 to 57093. [2019-09-08 05:49:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57093 states. [2019-09-08 05:49:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57093 states to 57093 states and 97148 transitions. [2019-09-08 05:49:34,156 INFO L78 Accepts]: Start accepts. Automaton has 57093 states and 97148 transitions. Word has length 347 [2019-09-08 05:49:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:34,156 INFO L475 AbstractCegarLoop]: Abstraction has 57093 states and 97148 transitions. [2019-09-08 05:49:34,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 05:49:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57093 states and 97148 transitions. [2019-09-08 05:49:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 05:49:34,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:34,212 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:49:34,213 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:34,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1537763490, now seen corresponding path program 1 times [2019-09-08 05:49:34,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:34,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:34,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:34,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:34,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:49:34,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:49:34,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:49:34,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:35,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 4073 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:49:35,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:49:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-08 05:49:35,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:49:35,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-09-08 05:49:35,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:49:35,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:49:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:49:35,197 INFO L87 Difference]: Start difference. First operand 57093 states and 97148 transitions. Second operand 9 states. [2019-09-08 05:49:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:44,529 INFO L93 Difference]: Finished difference Result 178645 states and 314464 transitions. [2019-09-08 05:49:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:49:44,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 393 [2019-09-08 05:49:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:45,001 INFO L225 Difference]: With dead ends: 178645 [2019-09-08 05:49:45,001 INFO L226 Difference]: Without dead ends: 129499 [2019-09-08 05:49:45,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:49:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129499 states. [2019-09-08 05:49:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129499 to 125050. [2019-09-08 05:49:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125050 states. [2019-09-08 05:49:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125050 states to 125050 states and 217395 transitions. [2019-09-08 05:49:50,871 INFO L78 Accepts]: Start accepts. Automaton has 125050 states and 217395 transitions. Word has length 393 [2019-09-08 05:49:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:50,871 INFO L475 AbstractCegarLoop]: Abstraction has 125050 states and 217395 transitions. [2019-09-08 05:49:50,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:49:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 125050 states and 217395 transitions. [2019-09-08 05:49:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 05:49:50,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:50,995 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:49:50,995 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1633157865, now seen corresponding path program 1 times [2019-09-08 05:49:50,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:50,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:49:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:49:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:49:51,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:49:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:49:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:49:51,250 INFO L87 Difference]: Start difference. First operand 125050 states and 217395 transitions. Second operand 3 states. [2019-09-08 05:50:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:00,022 INFO L93 Difference]: Finished difference Result 267363 states and 466034 transitions. [2019-09-08 05:50:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:50:00,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 05:50:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:00,605 INFO L225 Difference]: With dead ends: 267363 [2019-09-08 05:50:00,605 INFO L226 Difference]: Without dead ends: 142468 [2019-09-08 05:50:00,874 INFO L628 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-09-08 05:50:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142468 states. [2019-09-08 05:50:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142468 to 142460. [2019-09-08 05:50:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142460 states. [2019-09-08 05:50:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142460 states to 142460 states and 248308 transitions. [2019-09-08 05:50:11,509 INFO L78 Accepts]: Start accepts. Automaton has 142460 states and 248308 transitions. Word has length 387 [2019-09-08 05:50:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:11,509 INFO L475 AbstractCegarLoop]: Abstraction has 142460 states and 248308 transitions. [2019-09-08 05:50:11,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:50:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 142460 states and 248308 transitions. [2019-09-08 05:50:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-08 05:50:11,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:11,758 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:50:11,758 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1536685130, now seen corresponding path program 1 times [2019-09-08 05:50:11,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:11,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:11,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-08 05:50:12,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:50:12,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:50:12,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:50:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:50:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:50:12,103 INFO L87 Difference]: Start difference. First operand 142460 states and 248308 transitions. Second operand 8 states. [2019-09-08 05:50:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:31,383 INFO L93 Difference]: Finished difference Result 428096 states and 778518 transitions. [2019-09-08 05:50:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:50:31,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 439 [2019-09-08 05:50:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:32,707 INFO L225 Difference]: With dead ends: 428096 [2019-09-08 05:50:32,708 INFO L226 Difference]: Without dead ends: 285774 [2019-09-08 05:50:33,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:50:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285774 states. [2019-09-08 05:50:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285774 to 204425. [2019-09-08 05:50:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204425 states. [2019-09-08 05:50:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204425 states to 204425 states and 372835 transitions. [2019-09-08 05:50:54,956 INFO L78 Accepts]: Start accepts. Automaton has 204425 states and 372835 transitions. Word has length 439 [2019-09-08 05:50:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:54,957 INFO L475 AbstractCegarLoop]: Abstraction has 204425 states and 372835 transitions. [2019-09-08 05:50:54,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:50:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 204425 states and 372835 transitions. [2019-09-08 05:50:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-08 05:50:55,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:55,509 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:50:55,509 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -285026235, now seen corresponding path program 1 times [2019-09-08 05:50:55,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:55,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:55,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:50:55,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:50:55,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:50:55,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:50:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:50:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:50:55,757 INFO L87 Difference]: Start difference. First operand 204425 states and 372835 transitions. Second operand 8 states. [2019-09-08 05:51:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:10,873 INFO L93 Difference]: Finished difference Result 408752 states and 750251 transitions. [2019-09-08 05:51:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:51:10,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 438 [2019-09-08 05:51:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:11,933 INFO L225 Difference]: With dead ends: 408752 [2019-09-08 05:51:11,934 INFO L226 Difference]: Without dead ends: 204545 [2019-09-08 05:51:12,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:51:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204545 states. [2019-09-08 05:51:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204545 to 204545. [2019-09-08 05:51:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204545 states. [2019-09-08 05:51:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204545 states to 204545 states and 373059 transitions. [2019-09-08 05:51:31,095 INFO L78 Accepts]: Start accepts. Automaton has 204545 states and 373059 transitions. Word has length 438 [2019-09-08 05:51:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:31,096 INFO L475 AbstractCegarLoop]: Abstraction has 204545 states and 373059 transitions. [2019-09-08 05:51:31,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:51:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 204545 states and 373059 transitions. [2019-09-08 05:51:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-08 05:51:31,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:31,652 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:51:31,652 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash -664059462, now seen corresponding path program 1 times [2019-09-08 05:51:31,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:31,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 05:51:31,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:51:31,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:51:31,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:51:31,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:51:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:51:31,940 INFO L87 Difference]: Start difference. First operand 204545 states and 373059 transitions. Second operand 8 states. [2019-09-08 05:52:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:06,754 INFO L93 Difference]: Finished difference Result 614779 states and 1181299 transitions. [2019-09-08 05:52:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:52:06,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 429 [2019-09-08 05:52:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:08,915 INFO L225 Difference]: With dead ends: 614779 [2019-09-08 05:52:08,916 INFO L226 Difference]: Without dead ends: 410436 [2019-09-08 05:52:09,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:52:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410436 states. [2019-09-08 05:52:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410436 to 287766. [2019-09-08 05:52:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287766 states. [2019-09-08 05:52:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287766 states to 287766 states and 568850 transitions. [2019-09-08 05:52:46,294 INFO L78 Accepts]: Start accepts. Automaton has 287766 states and 568850 transitions. Word has length 429 [2019-09-08 05:52:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:46,295 INFO L475 AbstractCegarLoop]: Abstraction has 287766 states and 568850 transitions. [2019-09-08 05:52:46,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:52:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 287766 states and 568850 transitions. [2019-09-08 05:52:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 05:52:47,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:47,403 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-09-08 05:52:47,403 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -859173311, now seen corresponding path program 1 times [2019-09-08 05:52:47,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:47,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:47,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:47,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:47,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:52:47,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:52:47,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:52:47,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:52:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:52:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:52:47,641 INFO L87 Difference]: Start difference. First operand 287766 states and 568850 transitions. Second operand 7 states. [2019-09-08 05:53:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:09,518 INFO L93 Difference]: Finished difference Result 575532 states and 1143977 transitions. [2019-09-08 05:53:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:53:09,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 391 [2019-09-08 05:53:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:12,009 INFO L225 Difference]: With dead ends: 575532 [2019-09-08 05:53:12,009 INFO L226 Difference]: Without dead ends: 288054 [2019-09-08 05:53:12,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:53:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288054 states. [2019-09-08 05:53:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288054 to 259076. [2019-09-08 05:53:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259076 states. [2019-09-08 05:53:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259076 states to 259076 states and 519320 transitions. [2019-09-08 05:53:41,269 INFO L78 Accepts]: Start accepts. Automaton has 259076 states and 519320 transitions. Word has length 391 [2019-09-08 05:53:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:41,270 INFO L475 AbstractCegarLoop]: Abstraction has 259076 states and 519320 transitions. [2019-09-08 05:53:41,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:53:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 259076 states and 519320 transitions. [2019-09-08 05:53:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 05:53:42,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:42,261 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:53:42,261 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1075753789, now seen corresponding path program 1 times [2019-09-08 05:53:42,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:42,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 05:53:42,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:53:42,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:53:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:44,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 4141 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:53:44,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:53:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 05:53:44,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:53:44,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 05:53:44,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:53:44,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:53:44,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:53:44,561 INFO L87 Difference]: Start difference. First operand 259076 states and 519320 transitions. Second operand 10 states. [2019-09-08 05:54:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:03,230 INFO L93 Difference]: Finished difference Result 367059 states and 707653 transitions. [2019-09-08 05:54:03,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:54:03,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 395 [2019-09-08 05:54:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:04,445 INFO L225 Difference]: With dead ends: 367059 [2019-09-08 05:54:04,445 INFO L226 Difference]: Without dead ends: 262495 [2019-09-08 05:54:04,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:54:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262495 states. [2019-09-08 05:54:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262495 to 262127. [2019-09-08 05:54:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262127 states. [2019-09-08 05:54:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262127 states to 262127 states and 523653 transitions. [2019-09-08 05:54:34,461 INFO L78 Accepts]: Start accepts. Automaton has 262127 states and 523653 transitions. Word has length 395 [2019-09-08 05:54:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:34,462 INFO L475 AbstractCegarLoop]: Abstraction has 262127 states and 523653 transitions. [2019-09-08 05:54:34,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:54:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 262127 states and 523653 transitions. [2019-09-08 05:54:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-09-08 05:54:35,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:35,604 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:54:35,604 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 131671540, now seen corresponding path program 1 times [2019-09-08 05:54:35,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:35,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:35,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 05:54:37,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:54:37,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:54:37,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:54:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:54:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:54:37,449 INFO L87 Difference]: Start difference. First operand 262127 states and 523653 transitions. Second operand 10 states. [2019-09-08 05:54:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:54,837 INFO L93 Difference]: Finished difference Result 365579 states and 733096 transitions. [2019-09-08 05:54:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:54:54,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 415 [2019-09-08 05:54:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:55,950 INFO L225 Difference]: With dead ends: 365579 [2019-09-08 05:54:55,951 INFO L226 Difference]: Without dead ends: 265127 [2019-09-08 05:54:56,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:54:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265127 states. [2019-09-08 05:55:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265127 to 262727. [2019-09-08 05:55:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262727 states. [2019-09-08 05:55:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262727 states to 262727 states and 524341 transitions. [2019-09-08 05:55:24,680 INFO L78 Accepts]: Start accepts. Automaton has 262727 states and 524341 transitions. Word has length 415 [2019-09-08 05:55:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:55:24,680 INFO L475 AbstractCegarLoop]: Abstraction has 262727 states and 524341 transitions. [2019-09-08 05:55:24,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:55:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 262727 states and 524341 transitions. [2019-09-08 05:55:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-08 05:55:25,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:55:25,662 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:55:25,662 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:55:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:55:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1057917521, now seen corresponding path program 1 times [2019-09-08 05:55:25,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:55:25,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:55:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 05:55:27,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:55:27,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:55:27,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:27,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 4251 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:55:27,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:55:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 05:55:28,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:55:28,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [27] total 30 [2019-09-08 05:55:28,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 05:55:28,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 05:55:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:55:28,007 INFO L87 Difference]: Start difference. First operand 262727 states and 524341 transitions. Second operand 30 states.