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_spec6_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:31:15,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:31:15,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:31:15,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:31:15,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:31:15,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:31:15,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:31:15,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:31:15,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:31:15,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:31:15,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:31:15,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:31:15,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:31:15,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:31:15,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:31:15,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:31:15,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:31:15,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:31:15,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:31:16,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:31:16,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:31:16,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:31:16,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:31:16,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:31:16,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:31:16,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:31:16,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:31:16,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:31:16,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:31:16,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:31:16,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:31:16,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:31:16,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:31:16,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:31:16,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:31:16,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:31:16,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:31:16,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:31:16,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:31:16,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:31:16,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:31:16,032 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:31:16,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:31:16,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:31:16,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:31:16,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:31:16,061 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:31:16,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:31:16,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:31:16,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:31:16,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:31:16,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:31:16,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:31:16,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:31:16,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:31:16,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:31:16,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:31:16,065 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:31:16,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:31:16,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:31:16,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:31:16,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:31:16,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:31:16,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:31:16,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:31:16,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:31:16,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:31:16,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:31:16,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:31:16,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:31:16,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:31:16,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:31:16,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:31:16,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:31:16,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:31:16,149 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:31:16,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product35.cil.c [2019-09-08 05:31:16,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9d4ffca/8f5d058744c34e9c954e3a1a058d178d/FLAGf009121d1 [2019-09-08 05:31:16,925 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:31:16,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product35.cil.c [2019-09-08 05:31:16,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9d4ffca/8f5d058744c34e9c954e3a1a058d178d/FLAGf009121d1 [2019-09-08 05:31:17,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9d4ffca/8f5d058744c34e9c954e3a1a058d178d [2019-09-08 05:31:17,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:31:17,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:31:17,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:31:17,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:31:17,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:31:17,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:31:17" (1/1) ... [2019-09-08 05:31:17,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443fb1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:17, skipping insertion in model container [2019-09-08 05:31:17,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:31:17" (1/1) ... [2019-09-08 05:31:17,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:31:17,210 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:31:17,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:31:18,017 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:31:18,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:31:18,236 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:31:18,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18 WrapperNode [2019-09-08 05:31:18,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:31:18,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:31:18,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:31:18,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:31:18,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (1/1) ... [2019-09-08 05:31:18,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:31:18,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:31:18,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:31:18,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:31:18,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (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:31:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:31:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:31:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:31:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:31:18,515 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:31:18,515 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:31:18,515 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:31:18,515 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:31:18,515 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:31:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:31:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:31:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:31:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:31:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:31:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:31:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:31:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:31:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:31:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:31:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:31:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:31:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:31:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:31:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:31:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:31:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:31:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:31:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:31:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:31:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:31:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:31:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:31:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:31:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:31:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:31:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:31:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:31:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:31:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:31:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:31:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:31:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:31:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:31:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:31:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:31:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:31:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:31:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:31:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:31:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:31:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:31:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:31:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:31:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:31:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:31:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:31:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:31:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:31:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:31:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:31:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:31:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:31:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:31:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:31:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:31:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:31:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:31:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:31:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:31:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:31:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:31:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:31:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:31:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:31:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:31:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:31:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:31:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:31:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:31:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:31:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:31:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:31:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:31:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:31:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:31:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:31:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:31:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:31:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:31:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:31:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:31:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:31:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:31:18,534 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:31:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:31:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:31:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:31:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:31:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:31:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:31:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:31:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:31:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:31:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:31:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:31:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:31:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:31:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:31:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:31:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:31:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:31:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:31:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:31:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:31:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:31:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:31:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:31:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:31:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:31:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:31:18,539 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:31:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:31:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:31:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:31:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:31:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:31:18,540 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:31:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:31:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:31:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:31:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:31:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:31:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:31:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:31:18,543 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:31:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:31:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:31:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:31:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:31:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:31:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:31:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:31:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:31:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:31:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:31:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:31:18,545 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:31:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:31:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:31:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:31:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:31:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:31:18,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:31:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:31:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:31:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:31:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:31:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:31:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:31:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:31:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:31:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:31:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:31:18,550 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:31:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:31:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:31:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:31:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:31:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:31:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:31:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:31:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:31:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:31:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:31:18,552 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:31:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:31:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:31:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:31:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:31:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:31:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:31:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:31:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:31:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:31:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:31:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:31:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:31:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:31:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:31:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:31:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:31:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:31:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:31:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:31:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:31:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:31:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:31:18,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:31:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:31:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:31:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:31:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:31:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:31:18,557 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:31:18,558 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:31:18,559 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:31:18,559 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:31:18,559 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:31:18,559 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:31:18,559 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:31:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:31:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:31:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:31:18,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:31:20,670 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:31:20,670 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:31:20,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:31:20 BoogieIcfgContainer [2019-09-08 05:31:20,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:31:20,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:31:20,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:31:20,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:31:20,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:31:17" (1/3) ... [2019-09-08 05:31:20,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2feb7bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:31:20, skipping insertion in model container [2019-09-08 05:31:20,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:31:18" (2/3) ... [2019-09-08 05:31:20,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2feb7bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:31:20, skipping insertion in model container [2019-09-08 05:31:20,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:31:20" (3/3) ... [2019-09-08 05:31:20,683 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product35.cil.c [2019-09-08 05:31:20,702 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:31:20,713 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:31:20,731 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:31:20,776 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:31:20,777 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:31:20,777 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:31:20,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:31:20,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:31:20,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:31:20,777 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:31:20,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:31:20,778 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:31:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states. [2019-09-08 05:31:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:31:20,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:20,856 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:20,859 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:20,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -711590193, now seen corresponding path program 1 times [2019-09-08 05:31:20,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:20,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:21,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:21,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:31:21,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:31:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:31:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:31:21,596 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 2 states. [2019-09-08 05:31:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:21,694 INFO L93 Difference]: Finished difference Result 1057 states and 1422 transitions. [2019-09-08 05:31:21,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:31:21,698 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-09-08 05:31:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:21,738 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 05:31:21,738 INFO L226 Difference]: Without dead ends: 662 [2019-09-08 05:31:21,752 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:31:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-08 05:31:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2019-09-08 05:31:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 05:31:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 896 transitions. [2019-09-08 05:31:21,869 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 896 transitions. Word has length 198 [2019-09-08 05:31:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:21,871 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 896 transitions. [2019-09-08 05:31:21,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:31:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 896 transitions. [2019-09-08 05:31:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 05:31:21,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:21,878 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:21,879 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1780281315, now seen corresponding path program 1 times [2019-09-08 05:31:21,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:21,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:21,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:21,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:22,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:31:22,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:31:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:31:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:31:22,124 INFO L87 Difference]: Start difference. First operand 662 states and 896 transitions. Second operand 3 states. [2019-09-08 05:31:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:22,222 INFO L93 Difference]: Finished difference Result 1040 states and 1386 transitions. [2019-09-08 05:31:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:31:22,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-08 05:31:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:22,229 INFO L225 Difference]: With dead ends: 1040 [2019-09-08 05:31:22,230 INFO L226 Difference]: Without dead ends: 665 [2019-09-08 05:31:22,233 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:31:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-08 05:31:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 664. [2019-09-08 05:31:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 05:31:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 898 transitions. [2019-09-08 05:31:22,305 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 898 transitions. Word has length 199 [2019-09-08 05:31:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:22,308 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 898 transitions. [2019-09-08 05:31:22,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:31:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 898 transitions. [2019-09-08 05:31:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:31:22,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:22,317 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:22,317 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1355702484, now seen corresponding path program 1 times [2019-09-08 05:31:22,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:22,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:22,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:31:22,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:31:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:31:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:31:22,636 INFO L87 Difference]: Start difference. First operand 664 states and 898 transitions. Second operand 3 states. [2019-09-08 05:31:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:22,700 INFO L93 Difference]: Finished difference Result 1308 states and 1800 transitions. [2019-09-08 05:31:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:31:22,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-08 05:31:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:22,707 INFO L225 Difference]: With dead ends: 1308 [2019-09-08 05:31:22,707 INFO L226 Difference]: Without dead ends: 709 [2019-09-08 05:31:22,711 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:31:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-08 05:31:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 708. [2019-09-08 05:31:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-08 05:31:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 973 transitions. [2019-09-08 05:31:22,759 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 973 transitions. Word has length 211 [2019-09-08 05:31:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:22,762 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 973 transitions. [2019-09-08 05:31:22,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:31:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 973 transitions. [2019-09-08 05:31:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 05:31:22,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:22,772 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:22,773 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash -211848516, now seen corresponding path program 1 times [2019-09-08 05:31:22,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:22,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:23,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:23,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:31:23,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:31:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:31:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:31:23,006 INFO L87 Difference]: Start difference. First operand 708 states and 973 transitions. Second operand 3 states. [2019-09-08 05:31:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:23,056 INFO L93 Difference]: Finished difference Result 1437 states and 2020 transitions. [2019-09-08 05:31:23,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:31:23,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 05:31:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:23,064 INFO L225 Difference]: With dead ends: 1437 [2019-09-08 05:31:23,064 INFO L226 Difference]: Without dead ends: 794 [2019-09-08 05:31:23,067 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:31:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-08 05:31:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 793. [2019-09-08 05:31:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-09-08 05:31:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1117 transitions. [2019-09-08 05:31:23,103 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1117 transitions. Word has length 212 [2019-09-08 05:31:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:23,104 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1117 transitions. [2019-09-08 05:31:23,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:31:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1117 transitions. [2019-09-08 05:31:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 05:31:23,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:23,111 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:31:23,111 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash 945796238, now seen corresponding path program 1 times [2019-09-08 05:31:23,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:23,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:23,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:23,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:31:23,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:23,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:31:23,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:31:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:31:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:31:23,588 INFO L87 Difference]: Start difference. First operand 793 states and 1117 transitions. Second operand 11 states. [2019-09-08 05:31:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:30,804 INFO L93 Difference]: Finished difference Result 3998 states and 5634 transitions. [2019-09-08 05:31:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:31:30,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 215 [2019-09-08 05:31:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:30,860 INFO L225 Difference]: With dead ends: 3998 [2019-09-08 05:31:30,860 INFO L226 Difference]: Without dead ends: 3636 [2019-09-08 05:31:30,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:31:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2019-09-08 05:31:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3615. [2019-09-08 05:31:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2019-09-08 05:31:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4990 transitions. [2019-09-08 05:31:31,040 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4990 transitions. Word has length 215 [2019-09-08 05:31:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:31,041 INFO L475 AbstractCegarLoop]: Abstraction has 3615 states and 4990 transitions. [2019-09-08 05:31:31,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:31:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4990 transitions. [2019-09-08 05:31:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 05:31:31,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:31,047 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:31,047 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1962065818, now seen corresponding path program 1 times [2019-09-08 05:31:31,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:31,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:31,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:31:31,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:31,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:31:31,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:31:31,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:31:31,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:31:31,465 INFO L87 Difference]: Start difference. First operand 3615 states and 4990 transitions. Second operand 20 states. [2019-09-08 05:31:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:32,120 INFO L93 Difference]: Finished difference Result 6763 states and 9435 transitions. [2019-09-08 05:31:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 05:31:32,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 216 [2019-09-08 05:31:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:32,149 INFO L225 Difference]: With dead ends: 6763 [2019-09-08 05:31:32,150 INFO L226 Difference]: Without dead ends: 3561 [2019-09-08 05:31:32,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:31:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-09-08 05:31:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3559. [2019-09-08 05:31:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-09-08 05:31:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 4906 transitions. [2019-09-08 05:31:32,363 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 4906 transitions. Word has length 216 [2019-09-08 05:31:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:32,364 INFO L475 AbstractCegarLoop]: Abstraction has 3559 states and 4906 transitions. [2019-09-08 05:31:32,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:31:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 4906 transitions. [2019-09-08 05:31:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 05:31:32,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:32,370 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:32,370 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 652440013, now seen corresponding path program 1 times [2019-09-08 05:31:32,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:32,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:32,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:31:32,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:32,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:31:32,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:31:32,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:31:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:31:32,723 INFO L87 Difference]: Start difference. First operand 3559 states and 4906 transitions. Second operand 6 states. [2019-09-08 05:31:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:33,492 INFO L93 Difference]: Finished difference Result 10284 states and 14335 transitions. [2019-09-08 05:31:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:31:33,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-08 05:31:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:33,549 INFO L225 Difference]: With dead ends: 10284 [2019-09-08 05:31:33,549 INFO L226 Difference]: Without dead ends: 7205 [2019-09-08 05:31:33,567 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:31:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7205 states. [2019-09-08 05:31:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7205 to 7134. [2019-09-08 05:31:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2019-09-08 05:31:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 9944 transitions. [2019-09-08 05:31:33,988 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 9944 transitions. Word has length 225 [2019-09-08 05:31:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:33,992 INFO L475 AbstractCegarLoop]: Abstraction has 7134 states and 9944 transitions. [2019-09-08 05:31:33,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:31:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 9944 transitions. [2019-09-08 05:31:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 05:31:34,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:34,006 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:34,007 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1875015399, now seen corresponding path program 1 times [2019-09-08 05:31:34,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:34,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:34,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:31:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:31:34,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:31:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:31:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:31:34,420 INFO L87 Difference]: Start difference. First operand 7134 states and 9944 transitions. Second operand 5 states. [2019-09-08 05:31:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:36,413 INFO L93 Difference]: Finished difference Result 26811 states and 38225 transitions. [2019-09-08 05:31:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:31:36,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 226 [2019-09-08 05:31:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:36,582 INFO L225 Difference]: With dead ends: 26811 [2019-09-08 05:31:36,582 INFO L226 Difference]: Without dead ends: 20570 [2019-09-08 05:31:36,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:31:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-09-08 05:31:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20474. [2019-09-08 05:31:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20474 states. [2019-09-08 05:31:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20474 states to 20474 states and 28979 transitions. [2019-09-08 05:31:38,336 INFO L78 Accepts]: Start accepts. Automaton has 20474 states and 28979 transitions. Word has length 226 [2019-09-08 05:31:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:38,337 INFO L475 AbstractCegarLoop]: Abstraction has 20474 states and 28979 transitions. [2019-09-08 05:31:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:31:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20474 states and 28979 transitions. [2019-09-08 05:31:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 05:31:38,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:38,350 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:38,351 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1288239280, now seen corresponding path program 1 times [2019-09-08 05:31:38,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:38,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:31:38,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:38,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:31:38,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:31:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:31:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:31:38,625 INFO L87 Difference]: Start difference. First operand 20474 states and 28979 transitions. Second operand 13 states. [2019-09-08 05:31:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:39,788 INFO L93 Difference]: Finished difference Result 39131 states and 55106 transitions. [2019-09-08 05:31:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:31:39,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 226 [2019-09-08 05:31:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:39,892 INFO L225 Difference]: With dead ends: 39131 [2019-09-08 05:31:39,892 INFO L226 Difference]: Without dead ends: 20398 [2019-09-08 05:31:39,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:31:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20398 states. [2019-09-08 05:31:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20398 to 20346. [2019-09-08 05:31:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20346 states. [2019-09-08 05:31:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20346 states to 20346 states and 28588 transitions. [2019-09-08 05:31:40,902 INFO L78 Accepts]: Start accepts. Automaton has 20346 states and 28588 transitions. Word has length 226 [2019-09-08 05:31:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:40,904 INFO L475 AbstractCegarLoop]: Abstraction has 20346 states and 28588 transitions. [2019-09-08 05:31:40,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:31:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20346 states and 28588 transitions. [2019-09-08 05:31:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 05:31:40,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:40,921 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:31:40,922 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash -410017553, now seen corresponding path program 1 times [2019-09-08 05:31:40,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:40,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:40,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:41,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:31:41,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:31:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:31:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:31:41,151 INFO L87 Difference]: Start difference. First operand 20346 states and 28588 transitions. Second operand 3 states. [2019-09-08 05:31:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:42,126 INFO L93 Difference]: Finished difference Result 41287 states and 58317 transitions. [2019-09-08 05:31:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:31:42,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-08 05:31:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:42,215 INFO L225 Difference]: With dead ends: 41287 [2019-09-08 05:31:42,216 INFO L226 Difference]: Without dead ends: 21006 [2019-09-08 05:31:42,264 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:31:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21006 states. [2019-09-08 05:31:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21006 to 21002. [2019-09-08 05:31:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21002 states. [2019-09-08 05:31:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21002 states to 21002 states and 29782 transitions. [2019-09-08 05:31:43,031 INFO L78 Accepts]: Start accepts. Automaton has 21002 states and 29782 transitions. Word has length 247 [2019-09-08 05:31:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:43,031 INFO L475 AbstractCegarLoop]: Abstraction has 21002 states and 29782 transitions. [2019-09-08 05:31:43,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:31:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21002 states and 29782 transitions. [2019-09-08 05:31:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:31:43,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:43,052 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:31:43,052 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1218248198, now seen corresponding path program 1 times [2019-09-08 05:31:43,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:43,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:43,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:43,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:43,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:31:43,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:43,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:31:43,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:31:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:31:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:31:43,516 INFO L87 Difference]: Start difference. First operand 21002 states and 29782 transitions. Second operand 8 states. [2019-09-08 05:31:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:50,205 INFO L93 Difference]: Finished difference Result 63372 states and 91336 transitions. [2019-09-08 05:31:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:31:50,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 263 [2019-09-08 05:31:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:50,387 INFO L225 Difference]: With dead ends: 63372 [2019-09-08 05:31:50,388 INFO L226 Difference]: Without dead ends: 42435 [2019-09-08 05:31:50,449 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:31:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42435 states. [2019-09-08 05:31:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42435 to 23486. [2019-09-08 05:31:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23486 states. [2019-09-08 05:31:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23486 states to 23486 states and 34650 transitions. [2019-09-08 05:31:52,016 INFO L78 Accepts]: Start accepts. Automaton has 23486 states and 34650 transitions. Word has length 263 [2019-09-08 05:31:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:52,016 INFO L475 AbstractCegarLoop]: Abstraction has 23486 states and 34650 transitions. [2019-09-08 05:31:52,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:31:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 23486 states and 34650 transitions. [2019-09-08 05:31:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 05:31:52,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:52,060 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:52,060 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:52,061 INFO L82 PathProgramCache]: Analyzing trace with hash 921020179, now seen corresponding path program 1 times [2019-09-08 05:31:52,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:52,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:52,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:52,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:52,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:31:52,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:31:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:31:52,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:31:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:31:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:31:52,299 INFO L87 Difference]: Start difference. First operand 23486 states and 34650 transitions. Second operand 8 states. [2019-09-08 05:31:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:59,685 INFO L93 Difference]: Finished difference Result 71360 states and 108188 transitions. [2019-09-08 05:31:59,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:31:59,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-09-08 05:31:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:59,889 INFO L225 Difference]: With dead ends: 71360 [2019-09-08 05:31:59,889 INFO L226 Difference]: Without dead ends: 47939 [2019-09-08 05:31:59,940 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:31:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47939 states. [2019-09-08 05:32:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47939 to 28574. [2019-09-08 05:32:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28574 states. [2019-09-08 05:32:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28574 states to 28574 states and 45226 transitions. [2019-09-08 05:32:01,328 INFO L78 Accepts]: Start accepts. Automaton has 28574 states and 45226 transitions. Word has length 249 [2019-09-08 05:32:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:01,329 INFO L475 AbstractCegarLoop]: Abstraction has 28574 states and 45226 transitions. [2019-09-08 05:32:01,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:32:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28574 states and 45226 transitions. [2019-09-08 05:32:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:32:01,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:01,424 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:32:01,424 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash 942377406, now seen corresponding path program 1 times [2019-09-08 05:32:01,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:01,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:32:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:32:01,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:32:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:32:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:32:01,666 INFO L87 Difference]: Start difference. First operand 28574 states and 45226 transitions. Second operand 8 states. [2019-09-08 05:32:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:08,795 INFO L93 Difference]: Finished difference Result 87608 states and 144368 transitions. [2019-09-08 05:32:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:32:08,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 265 [2019-09-08 05:32:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:09,011 INFO L225 Difference]: With dead ends: 87608 [2019-09-08 05:32:09,011 INFO L226 Difference]: Without dead ends: 59099 [2019-09-08 05:32:09,073 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:32:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59099 states. [2019-09-08 05:32:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59099 to 38878. [2019-09-08 05:32:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-09-08 05:32:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 67918 transitions. [2019-09-08 05:32:12,468 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 67918 transitions. Word has length 265 [2019-09-08 05:32:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:12,468 INFO L475 AbstractCegarLoop]: Abstraction has 38878 states and 67918 transitions. [2019-09-08 05:32:12,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:32:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 67918 transitions. [2019-09-08 05:32:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 05:32:12,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:12,622 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:32:12,623 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1412125534, now seen corresponding path program 1 times [2019-09-08 05:32:12,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:12,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:12,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:12,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:32:12,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:12,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:32:12,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:32:12,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:32:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:32:12,788 INFO L87 Difference]: Start difference. First operand 38878 states and 67918 transitions. Second operand 3 states. [2019-09-08 05:32:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:13,925 INFO L93 Difference]: Finished difference Result 87807 states and 160087 transitions. [2019-09-08 05:32:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:32:13,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-08 05:32:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:14,494 INFO L225 Difference]: With dead ends: 87807 [2019-09-08 05:32:14,494 INFO L226 Difference]: Without dead ends: 48994 [2019-09-08 05:32:14,564 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:32:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48994 states. [2019-09-08 05:32:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48994 to 48990. [2019-09-08 05:32:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48990 states. [2019-09-08 05:32:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48990 states to 48990 states and 91982 transitions. [2019-09-08 05:32:16,279 INFO L78 Accepts]: Start accepts. Automaton has 48990 states and 91982 transitions. Word has length 255 [2019-09-08 05:32:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:16,279 INFO L475 AbstractCegarLoop]: Abstraction has 48990 states and 91982 transitions. [2019-09-08 05:32:16,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:32:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 48990 states and 91982 transitions. [2019-09-08 05:32:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 05:32:16,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:16,436 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:32:16,437 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:16,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2035236661, now seen corresponding path program 1 times [2019-09-08 05:32:16,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:16,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:16,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:32:18,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:18,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:32:18,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:32:18,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:32:18,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:32:18,678 INFO L87 Difference]: Start difference. First operand 48990 states and 91982 transitions. Second operand 11 states. [2019-09-08 05:32:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:21,361 INFO L93 Difference]: Finished difference Result 82477 states and 140965 transitions. [2019-09-08 05:32:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:32:21,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 254 [2019-09-08 05:32:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:21,681 INFO L225 Difference]: With dead ends: 82477 [2019-09-08 05:32:21,681 INFO L226 Difference]: Without dead ends: 67700 [2019-09-08 05:32:21,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:32:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67700 states. [2019-09-08 05:32:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67700 to 67072. [2019-09-08 05:32:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67072 states. [2019-09-08 05:32:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67072 states to 67072 states and 118859 transitions. [2019-09-08 05:32:25,330 INFO L78 Accepts]: Start accepts. Automaton has 67072 states and 118859 transitions. Word has length 254 [2019-09-08 05:32:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:25,331 INFO L475 AbstractCegarLoop]: Abstraction has 67072 states and 118859 transitions. [2019-09-08 05:32:25,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:32:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 67072 states and 118859 transitions. [2019-09-08 05:32:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 05:32:25,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:25,462 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 05:32:25,462 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash 318822940, now seen corresponding path program 1 times [2019-09-08 05:32:25,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:25,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:32:25,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:25,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:32:25,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:32:25,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:32:25,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:32:25,662 INFO L87 Difference]: Start difference. First operand 67072 states and 118859 transitions. Second operand 6 states. [2019-09-08 05:32:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:30,850 INFO L93 Difference]: Finished difference Result 134157 states and 238017 transitions. [2019-09-08 05:32:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:32:30,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2019-09-08 05:32:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:31,130 INFO L225 Difference]: With dead ends: 134157 [2019-09-08 05:32:31,130 INFO L226 Difference]: Without dead ends: 67150 [2019-09-08 05:32:31,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:32:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67150 states. [2019-09-08 05:32:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67150 to 67148. [2019-09-08 05:32:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67148 states. [2019-09-08 05:32:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67148 states to 67148 states and 118941 transitions. [2019-09-08 05:32:34,191 INFO L78 Accepts]: Start accepts. Automaton has 67148 states and 118941 transitions. Word has length 272 [2019-09-08 05:32:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:34,192 INFO L475 AbstractCegarLoop]: Abstraction has 67148 states and 118941 transitions. [2019-09-08 05:32:34,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:32:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 67148 states and 118941 transitions. [2019-09-08 05:32:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:32:34,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:34,355 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-09-08 05:32:34,356 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash 304123362, now seen corresponding path program 1 times [2019-09-08 05:32:34,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:32:34,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:34,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:32:34,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:32:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:32:34,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:32:34,543 INFO L87 Difference]: Start difference. First operand 67148 states and 118941 transitions. Second operand 6 states. [2019-09-08 05:32:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:37,685 INFO L93 Difference]: Finished difference Result 134339 states and 239819 transitions. [2019-09-08 05:32:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:32:37,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-09-08 05:32:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:37,941 INFO L225 Difference]: With dead ends: 134339 [2019-09-08 05:32:37,942 INFO L226 Difference]: Without dead ends: 67268 [2019-09-08 05:32:38,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:32:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67268 states. [2019-09-08 05:32:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67268 to 67268. [2019-09-08 05:32:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67268 states. [2019-09-08 05:32:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67268 states to 67268 states and 118503 transitions. [2019-09-08 05:32:43,939 INFO L78 Accepts]: Start accepts. Automaton has 67268 states and 118503 transitions. Word has length 273 [2019-09-08 05:32:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:32:43,940 INFO L475 AbstractCegarLoop]: Abstraction has 67268 states and 118503 transitions. [2019-09-08 05:32:43,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:32:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 67268 states and 118503 transitions. [2019-09-08 05:32:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 05:32:44,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:32:44,099 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:32:44,099 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:32:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:32:44,099 INFO L82 PathProgramCache]: Analyzing trace with hash -66496748, now seen corresponding path program 1 times [2019-09-08 05:32:44,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:32:44,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:32:44,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:32:44,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:32:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:32:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 05:32:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:32:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:32:44,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:32:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:32:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:32:44,482 INFO L87 Difference]: Start difference. First operand 67268 states and 118503 transitions. Second operand 22 states. [2019-09-08 05:33:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:12,014 INFO L93 Difference]: Finished difference Result 210998 states and 376464 transitions. [2019-09-08 05:33:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 05:33:12,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 271 [2019-09-08 05:33:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:12,928 INFO L225 Difference]: With dead ends: 210998 [2019-09-08 05:33:12,928 INFO L226 Difference]: Without dead ends: 180499 [2019-09-08 05:33:13,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:33:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180499 states. [2019-09-08 05:33:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180499 to 176370. [2019-09-08 05:33:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176370 states. [2019-09-08 05:33:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176370 states to 176370 states and 316460 transitions. [2019-09-08 05:33:26,470 INFO L78 Accepts]: Start accepts. Automaton has 176370 states and 316460 transitions. Word has length 271 [2019-09-08 05:33:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:26,471 INFO L475 AbstractCegarLoop]: Abstraction has 176370 states and 316460 transitions. [2019-09-08 05:33:26,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:33:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 176370 states and 316460 transitions. [2019-09-08 05:33:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:33:26,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:26,730 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:33:26,730 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash -474109942, now seen corresponding path program 1 times [2019-09-08 05:33:26,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:26,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:26,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:33:26,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:26,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:33:26,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:33:26,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:33:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:33:26,908 INFO L87 Difference]: Start difference. First operand 176370 states and 316460 transitions. Second operand 6 states. [2019-09-08 05:33:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:33:39,385 INFO L93 Difference]: Finished difference Result 352409 states and 646320 transitions. [2019-09-08 05:33:39,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:33:39,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-09-08 05:33:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:33:40,262 INFO L225 Difference]: With dead ends: 352409 [2019-09-08 05:33:40,262 INFO L226 Difference]: Without dead ends: 176116 [2019-09-08 05:33:41,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:33:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176116 states. [2019-09-08 05:33:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176116 to 176114. [2019-09-08 05:33:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176114 states. [2019-09-08 05:33:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176114 states to 176114 states and 296937 transitions. [2019-09-08 05:33:55,116 INFO L78 Accepts]: Start accepts. Automaton has 176114 states and 296937 transitions. Word has length 273 [2019-09-08 05:33:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:33:55,117 INFO L475 AbstractCegarLoop]: Abstraction has 176114 states and 296937 transitions. [2019-09-08 05:33:55,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:33:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 176114 states and 296937 transitions. [2019-09-08 05:33:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 05:33:55,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:33:55,306 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:55,306 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:33:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:33:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1058160295, now seen corresponding path program 1 times [2019-09-08 05:33:55,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:33:55,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:33:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:55,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:33:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:33:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:33:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:33:55,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:33:55,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:33:55,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:33:55,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:33:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:33:55,630 INFO L87 Difference]: Start difference. First operand 176114 states and 296937 transitions. Second operand 18 states. [2019-09-08 05:34:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:29,680 INFO L93 Difference]: Finished difference Result 308685 states and 524146 transitions. [2019-09-08 05:34:29,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 05:34:29,680 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 257 [2019-09-08 05:34:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:30,614 INFO L225 Difference]: With dead ends: 308685 [2019-09-08 05:34:30,614 INFO L226 Difference]: Without dead ends: 187802 [2019-09-08 05:34:30,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 05:34:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187802 states. [2019-09-08 05:34:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187802 to 184535. [2019-09-08 05:34:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184535 states. [2019-09-08 05:34:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184535 states to 184535 states and 316706 transitions. [2019-09-08 05:34:46,676 INFO L78 Accepts]: Start accepts. Automaton has 184535 states and 316706 transitions. Word has length 257 [2019-09-08 05:34:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:34:46,677 INFO L475 AbstractCegarLoop]: Abstraction has 184535 states and 316706 transitions. [2019-09-08 05:34:46,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:34:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 184535 states and 316706 transitions. [2019-09-08 05:34:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 05:34:46,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:34:46,876 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:34:46,876 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:34:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:34:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash 770880922, now seen corresponding path program 1 times [2019-09-08 05:34:46,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:34:46,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:34:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:46,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:34:46,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:34:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:34:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:34:47,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:34:47,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:34:47,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:34:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:34:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:34:47,046 INFO L87 Difference]: Start difference. First operand 184535 states and 316706 transitions. Second operand 5 states. [2019-09-08 05:34:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:34:54,493 INFO L93 Difference]: Finished difference Result 293400 states and 488556 transitions. [2019-09-08 05:34:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:34:54,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2019-09-08 05:34:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:34:55,137 INFO L225 Difference]: With dead ends: 293400 [2019-09-08 05:34:55,137 INFO L226 Difference]: Without dead ends: 155088 [2019-09-08 05:34:55,449 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:34:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155088 states. [2019-09-08 05:35:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155088 to 154916. [2019-09-08 05:35:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154916 states. [2019-09-08 05:35:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154916 states to 154916 states and 265606 transitions. [2019-09-08 05:35:09,158 INFO L78 Accepts]: Start accepts. Automaton has 154916 states and 265606 transitions. Word has length 278 [2019-09-08 05:35:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:09,159 INFO L475 AbstractCegarLoop]: Abstraction has 154916 states and 265606 transitions. [2019-09-08 05:35:09,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:35:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 154916 states and 265606 transitions. [2019-09-08 05:35:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 05:35:09,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:09,342 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:35:09,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1969272279, now seen corresponding path program 1 times [2019-09-08 05:35:09,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 05:35:09,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:09,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:35:09,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:35:09,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:35:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:35:09,673 INFO L87 Difference]: Start difference. First operand 154916 states and 265606 transitions. Second operand 18 states. [2019-09-08 05:35:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:18,751 INFO L93 Difference]: Finished difference Result 263187 states and 441384 transitions. [2019-09-08 05:35:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:35:18,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 272 [2019-09-08 05:35:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:19,407 INFO L225 Difference]: With dead ends: 263187 [2019-09-08 05:35:19,408 INFO L226 Difference]: Without dead ends: 154490 [2019-09-08 05:35:19,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:35:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154490 states. [2019-09-08 05:35:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154490 to 154310. [2019-09-08 05:35:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154310 states. [2019-09-08 05:35:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154310 states to 154310 states and 262378 transitions. [2019-09-08 05:35:34,438 INFO L78 Accepts]: Start accepts. Automaton has 154310 states and 262378 transitions. Word has length 272 [2019-09-08 05:35:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:34,438 INFO L475 AbstractCegarLoop]: Abstraction has 154310 states and 262378 transitions. [2019-09-08 05:35:34,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:35:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 154310 states and 262378 transitions. [2019-09-08 05:35:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 05:35:34,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:34,613 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:34,613 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 652720342, now seen corresponding path program 1 times [2019-09-08 05:35:34,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:34,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:34,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:34,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:35:34,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:34,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:35:34,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:35:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:35:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:35:34,784 INFO L87 Difference]: Start difference. First operand 154310 states and 262378 transitions. Second operand 5 states. [2019-09-08 05:35:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:45,329 INFO L93 Difference]: Finished difference Result 211160 states and 355913 transitions. [2019-09-08 05:35:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:35:45,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-09-08 05:35:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:45,845 INFO L225 Difference]: With dead ends: 211160 [2019-09-08 05:35:45,845 INFO L226 Difference]: Without dead ends: 156189 [2019-09-08 05:35:45,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:35:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156189 states. [2019-09-08 05:35:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156189 to 154973. [2019-09-08 05:35:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154973 states. [2019-09-08 05:35:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154973 states to 154973 states and 262326 transitions. [2019-09-08 05:35:54,733 INFO L78 Accepts]: Start accepts. Automaton has 154973 states and 262326 transitions. Word has length 257 [2019-09-08 05:35:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:54,734 INFO L475 AbstractCegarLoop]: Abstraction has 154973 states and 262326 transitions. [2019-09-08 05:35:54,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:35:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 154973 states and 262326 transitions. [2019-09-08 05:35:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:35:54,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:54,921 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:35:54,921 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash 138789520, now seen corresponding path program 1 times [2019-09-08 05:35:54,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:54,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:54,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 05:35:55,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:55,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:35:55,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:35:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:35:55,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:35:55,252 INFO L87 Difference]: Start difference. First operand 154973 states and 262326 transitions. Second operand 18 states. [2019-09-08 05:36:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:19,072 INFO L93 Difference]: Finished difference Result 226179 states and 379803 transitions. [2019-09-08 05:36:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:36:19,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 273 [2019-09-08 05:36:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:19,669 INFO L225 Difference]: With dead ends: 226179 [2019-09-08 05:36:19,670 INFO L226 Difference]: Without dead ends: 157246 [2019-09-08 05:36:19,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:36:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157246 states. [2019-09-08 05:36:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157246 to 154973. [2019-09-08 05:36:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154973 states. [2019-09-08 05:36:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154973 states to 154973 states and 262326 transitions. [2019-09-08 05:36:33,576 INFO L78 Accepts]: Start accepts. Automaton has 154973 states and 262326 transitions. Word has length 273 [2019-09-08 05:36:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:33,577 INFO L475 AbstractCegarLoop]: Abstraction has 154973 states and 262326 transitions. [2019-09-08 05:36:33,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:36:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 154973 states and 262326 transitions. [2019-09-08 05:36:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 05:36:34,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:34,676 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:34,676 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash -452860669, now seen corresponding path program 1 times [2019-09-08 05:36:34,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:34,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:34,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:34,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:36:34,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:34,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:36:34,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:36:34,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:36:34,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:34,856 INFO L87 Difference]: Start difference. First operand 154973 states and 262326 transitions. Second operand 6 states. [2019-09-08 05:36:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:46,075 INFO L93 Difference]: Finished difference Result 310037 states and 526874 transitions. [2019-09-08 05:36:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:36:46,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2019-09-08 05:36:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:46,673 INFO L225 Difference]: With dead ends: 310037 [2019-09-08 05:36:46,673 INFO L226 Difference]: Without dead ends: 155153 [2019-09-08 05:36:46,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:36:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155153 states. [2019-09-08 05:36:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155153 to 155153. [2019-09-08 05:36:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155153 states. [2019-09-08 05:37:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155153 states to 155153 states and 262107 transitions. [2019-09-08 05:37:01,805 INFO L78 Accepts]: Start accepts. Automaton has 155153 states and 262107 transitions. Word has length 276 [2019-09-08 05:37:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:01,805 INFO L475 AbstractCegarLoop]: Abstraction has 155153 states and 262107 transitions. [2019-09-08 05:37:01,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:37:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 155153 states and 262107 transitions. [2019-09-08 05:37:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 05:37:01,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:01,997 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-09-08 05:37:01,998 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:01,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2007618975, now seen corresponding path program 1 times [2019-09-08 05:37:01,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:01,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:01,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:01,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:37:02,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:02,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:37:02,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:37:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:37:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:37:02,182 INFO L87 Difference]: Start difference. First operand 155153 states and 262107 transitions. Second operand 6 states. [2019-09-08 05:37:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:09,258 INFO L93 Difference]: Finished difference Result 310217 states and 533324 transitions. [2019-09-08 05:37:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:37:09,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 279 [2019-09-08 05:37:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:09,974 INFO L225 Difference]: With dead ends: 310217 [2019-09-08 05:37:09,974 INFO L226 Difference]: Without dead ends: 155153 [2019-09-08 05:37:10,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155153 states. [2019-09-08 05:37:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155153 to 155153. [2019-09-08 05:37:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155153 states. [2019-09-08 05:37:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155153 states to 155153 states and 257013 transitions. [2019-09-08 05:37:26,844 INFO L78 Accepts]: Start accepts. Automaton has 155153 states and 257013 transitions. Word has length 279 [2019-09-08 05:37:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:26,845 INFO L475 AbstractCegarLoop]: Abstraction has 155153 states and 257013 transitions. [2019-09-08 05:37:26,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:37:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 155153 states and 257013 transitions. [2019-09-08 05:37:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:37:27,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:27,044 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:37:27,044 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash 246034308, now seen corresponding path program 1 times [2019-09-08 05:37:27,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:27,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:37:27,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:37:27,202 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:37:27,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:27,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 3502 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:37:27,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:37:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 05:37:27,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:37:27,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:37:27,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:37:27,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:37:27,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:37:27,977 INFO L87 Difference]: Start difference. First operand 155153 states and 257013 transitions. Second operand 13 states. [2019-09-08 05:37:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:36,875 INFO L93 Difference]: Finished difference Result 310254 states and 513964 transitions. [2019-09-08 05:37:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:37:36,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2019-09-08 05:37:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:37,953 INFO L225 Difference]: With dead ends: 310254 [2019-09-08 05:37:37,954 INFO L226 Difference]: Without dead ends: 155157 [2019-09-08 05:37:39,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:37:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155157 states. [2019-09-08 05:37:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155157 to 155153. [2019-09-08 05:37:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155153 states. [2019-09-08 05:37:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155153 states to 155153 states and 257011 transitions. [2019-09-08 05:37:50,981 INFO L78 Accepts]: Start accepts. Automaton has 155153 states and 257011 transitions. Word has length 265 [2019-09-08 05:37:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:50,981 INFO L475 AbstractCegarLoop]: Abstraction has 155153 states and 257011 transitions. [2019-09-08 05:37:50,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:37:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 155153 states and 257011 transitions. [2019-09-08 05:37:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 05:37:51,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:51,548 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-08 05:37:51,549 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:51,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash -22159793, now seen corresponding path program 1 times [2019-09-08 05:37:51,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:51,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:51,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:51,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:51,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 05:37:51,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:51,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:37:51,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:37:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:37:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:37:51,784 INFO L87 Difference]: Start difference. First operand 155153 states and 257011 transitions. Second operand 6 states. [2019-09-08 05:38:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:02,894 INFO L93 Difference]: Finished difference Result 310313 states and 514398 transitions. [2019-09-08 05:38:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:38:02,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 301 [2019-09-08 05:38:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:03,634 INFO L225 Difference]: With dead ends: 310313 [2019-09-08 05:38:03,635 INFO L226 Difference]: Without dead ends: 155153 [2019-09-08 05:38:03,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:38:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155153 states. [2019-09-08 05:38:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155153 to 155153. [2019-09-08 05:38:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155153 states. [2019-09-08 05:38:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155153 states to 155153 states and 256963 transitions. [2019-09-08 05:38:12,168 INFO L78 Accepts]: Start accepts. Automaton has 155153 states and 256963 transitions. Word has length 301 [2019-09-08 05:38:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:12,169 INFO L475 AbstractCegarLoop]: Abstraction has 155153 states and 256963 transitions. [2019-09-08 05:38:12,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:38:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 155153 states and 256963 transitions. [2019-09-08 05:38:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:38:12,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:12,373 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:12,373 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1652501593, now seen corresponding path program 1 times [2019-09-08 05:38:12,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:12,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:12,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:38:13,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:13,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:38:13,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:38:13,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:38:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:38:13,270 INFO L87 Difference]: Start difference. First operand 155153 states and 256963 transitions. Second operand 7 states. [2019-09-08 05:38:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:25,240 INFO L93 Difference]: Finished difference Result 310228 states and 513833 transitions. [2019-09-08 05:38:25,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:38:25,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2019-09-08 05:38:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:25,972 INFO L225 Difference]: With dead ends: 310228 [2019-09-08 05:38:25,973 INFO L226 Difference]: Without dead ends: 155155 [2019-09-08 05:38:26,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:38:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155155 states. [2019-09-08 05:38:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155155 to 155153. [2019-09-08 05:38:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155153 states. [2019-09-08 05:38:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155153 states to 155153 states and 256962 transitions. [2019-09-08 05:38:34,888 INFO L78 Accepts]: Start accepts. Automaton has 155153 states and 256962 transitions. Word has length 284 [2019-09-08 05:38:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:34,888 INFO L475 AbstractCegarLoop]: Abstraction has 155153 states and 256962 transitions. [2019-09-08 05:38:34,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:38:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 155153 states and 256962 transitions. [2019-09-08 05:38:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-08 05:38:35,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:35,070 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:35,071 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1715321254, now seen corresponding path program 1 times [2019-09-08 05:38:35,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:35,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:35,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 05:38:35,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:38:35,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:38:35,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:35,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 3576 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:38:35,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:38:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 05:38:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:38:36,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 05:38:36,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:38:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:38:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:38:36,016 INFO L87 Difference]: Start difference. First operand 155153 states and 256962 transitions. Second operand 17 states. [2019-09-08 05:39:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:20,407 INFO L93 Difference]: Finished difference Result 624221 states and 1039777 transitions. [2019-09-08 05:39:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 05:39:20,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 287 [2019-09-08 05:39:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:22,315 INFO L225 Difference]: With dead ends: 624221 [2019-09-08 05:39:22,315 INFO L226 Difference]: Without dead ends: 469136 [2019-09-08 05:39:22,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:39:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469136 states. [2019-09-08 05:39:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469136 to 468416. [2019-09-08 05:39:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468416 states. [2019-09-08 05:39:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468416 states to 468416 states and 780753 transitions. [2019-09-08 05:39:59,910 INFO L78 Accepts]: Start accepts. Automaton has 468416 states and 780753 transitions. Word has length 287 [2019-09-08 05:39:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:59,910 INFO L475 AbstractCegarLoop]: Abstraction has 468416 states and 780753 transitions. [2019-09-08 05:39:59,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:39:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 468416 states and 780753 transitions. [2019-09-08 05:40:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-08 05:40:00,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:00,553 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-08 05:40:00,553 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 704714940, now seen corresponding path program 1 times [2019-09-08 05:40:00,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:00,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:00,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:00,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:00,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:40:01,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:40:01,916 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:40:01,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:02,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 3570 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:40:02,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:40:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:40:02,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:40:02,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:40:02,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:40:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:40:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:40:02,696 INFO L87 Difference]: Start difference. First operand 468416 states and 780753 transitions. Second operand 18 states. [2019-09-08 05:40:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:33,463 INFO L93 Difference]: Finished difference Result 828731 states and 1394184 transitions. [2019-09-08 05:40:33,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:40:33,464 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 287 [2019-09-08 05:40:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:34,860 INFO L225 Difference]: With dead ends: 828731 [2019-09-08 05:40:34,860 INFO L226 Difference]: Without dead ends: 360139 [2019-09-08 05:40:35,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:40:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360139 states. [2019-09-08 05:41:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360139 to 358071. [2019-09-08 05:41:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358071 states. [2019-09-08 05:41:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358071 states to 358071 states and 609584 transitions. [2019-09-08 05:41:10,341 INFO L78 Accepts]: Start accepts. Automaton has 358071 states and 609584 transitions. Word has length 287 [2019-09-08 05:41:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:10,341 INFO L475 AbstractCegarLoop]: Abstraction has 358071 states and 609584 transitions. [2019-09-08 05:41:10,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:41:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 358071 states and 609584 transitions. [2019-09-08 05:41:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 05:41:11,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:11,058 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:11,059 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash -198778819, now seen corresponding path program 1 times [2019-09-08 05:41:11,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:11,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:11,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 05:41:11,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:41:11,215 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:41:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:11,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:41:11,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:41:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:41:11,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:41:11,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:41:11,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:41:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:41:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:41:11,949 INFO L87 Difference]: Start difference. First operand 358071 states and 609584 transitions. Second operand 12 states. [2019-09-08 05:41:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:37,498 INFO L93 Difference]: Finished difference Result 623964 states and 1039149 transitions. [2019-09-08 05:41:37,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:41:37,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 290 [2019-09-08 05:41:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:38,935 INFO L225 Difference]: With dead ends: 623964 [2019-09-08 05:41:38,936 INFO L226 Difference]: Without dead ends: 311998 [2019-09-08 05:41:39,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:41:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311998 states.