java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec9_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:15:58,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:15:58,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:15:58,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:15:58,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:15:58,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:15:58,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:15:58,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:15:58,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:15:58,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:15:58,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:15:58,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:15:58,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:15:58,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:15:58,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:15:58,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:15:58,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:15:58,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:15:58,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:15:58,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:15:58,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:15:58,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:15:58,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:15:58,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:15:58,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:15:58,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:15:58,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:15:58,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:15:58,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:15:58,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:15:58,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:15:58,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:15:58,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:15:58,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:15:58,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:15:58,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:15:58,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:15:58,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:15:58,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:15:58,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:15:58,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:15:58,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:15:58,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:15:58,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:15:58,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:15:58,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:15:58,180 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:15:58,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:15:58,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:15:58,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:15:58,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:15:58,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:15:58,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:15:58,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:15:58,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:15:58,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:15:58,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:15:58,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:15:58,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:15:58,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:15:58,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:15:58,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:15:58,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:15:58,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:15:58,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:15:58,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:15:58,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:15:58,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:15:58,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:15:58,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:15:58,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:15:58,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:15:58,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:15:58,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:15:58,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:15:58,268 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:15:58,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_productSimulator.cil.c [2019-10-02 14:15:58,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eefdbbf53/4da7221aeab246ee9d54b4b1657e842a/FLAG48df0ae35 [2019-10-02 14:15:58,934 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:15:58,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_productSimulator.cil.c [2019-10-02 14:15:58,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eefdbbf53/4da7221aeab246ee9d54b4b1657e842a/FLAG48df0ae35 [2019-10-02 14:15:59,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eefdbbf53/4da7221aeab246ee9d54b4b1657e842a [2019-10-02 14:15:59,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:15:59,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:15:59,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:15:59,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:15:59,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:15:59,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:15:59" (1/1) ... [2019-10-02 14:15:59,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7201854e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:59, skipping insertion in model container [2019-10-02 14:15:59,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:15:59" (1/1) ... [2019-10-02 14:15:59,147 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:15:59,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:16:00,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:16:00,063 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:16:00,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:16:00,406 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:16:00,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00 WrapperNode [2019-10-02 14:16:00,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:16:00,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:16:00,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:16:00,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:16:00,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... [2019-10-02 14:16:00,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:16:00,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:16:00,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:16:00,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:16:00,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:16:00,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:16:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:16:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:16:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:16:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:16:00,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:16:00,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:16:00,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:16:00,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:16:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:16:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:16:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:16:00,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:16:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:16:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:16:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:16:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:16:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:16:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:16:00,789 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:16:00,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:16:00,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:16:00,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:16:00,790 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:16:00,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:16:00,790 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:16:00,791 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-02 14:16:00,791 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-02 14:16:00,791 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-02 14:16:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-02 14:16:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-02 14:16:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-02 14:16:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:16:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:16:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-02 14:16:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-02 14:16:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-02 14:16:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-02 14:16:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-02 14:16:00,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-02 14:16:00,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-02 14:16:00,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-02 14:16:00,794 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:16:00,794 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:16:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:16:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:16:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:16:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:16:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:16:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:16:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:16:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:16:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:16:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:16:00,796 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:16:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:16:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-02 14:16:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-02 14:16:00,797 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:16:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-02 14:16:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-02 14:16:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:16:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-02 14:16:00,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-02 14:16:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:16:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:16:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:16:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:16:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:16:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:16:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:16:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:16:00,801 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:16:00,801 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:16:00,802 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:16:00,802 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:16:00,802 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:16:00,802 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:16:00,803 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:16:00,803 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:16:00,803 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:16:00,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:16:00,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:16:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:16:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:16:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:16:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:16:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:16:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:16:00,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:16:00,807 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:16:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:16:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:16:00,808 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:16:00,809 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-02 14:16:00,809 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-02 14:16:00,809 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-02 14:16:00,809 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-02 14:16:00,809 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-02 14:16:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-02 14:16:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:16:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-02 14:16:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-02 14:16:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:16:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:16:00,811 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:16:00,811 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:16:00,811 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:16:00,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:16:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:16:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:16:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:16:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:16:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:16:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:16:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:16:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:16:00,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:16:00,815 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:16:00,815 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:16:00,816 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:16:00,816 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:16:00,816 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:16:00,817 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:16:00,818 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:16:00,818 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:16:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:16:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:16:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:16:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:16:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:16:00,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:16:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:16:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:16:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:16:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:16:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:16:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:16:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:16:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:16:00,828 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:16:00,828 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:16:00,828 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:16:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:16:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:16:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:16:00,836 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:16:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:16:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:16:00,837 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:16:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:16:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:16:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:16:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:16:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:16:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:16:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:16:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:16:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:16:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:16:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:16:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:16:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:16:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:16:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:16:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:16:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:16:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:16:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:16:00,841 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:16:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:16:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:16:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:16:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:16:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:16:00,842 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:16:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:16:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:16:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:16:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:16:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:16:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:16:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:16:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:16:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:16:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:16:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:16:00,845 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:16:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:16:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:16:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:16:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:16:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:16:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:16:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:16:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:16:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:16:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:16:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-02 14:16:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-02 14:16:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-02 14:16:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-02 14:16:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-02 14:16:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-02 14:16:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-02 14:16:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-02 14:16:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-02 14:16:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-02 14:16:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-02 14:16:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-02 14:16:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-02 14:16:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-02 14:16:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:16:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:16:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:16:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:16:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:16:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:16:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:16:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:16:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:16:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:16:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:16:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:16:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:16:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:16:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:16:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:16:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:16:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:16:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:16:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:16:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:16:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:16:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:16:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-02 14:16:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-02 14:16:00,859 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-02 14:16:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-02 14:16:00,860 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-02 14:16:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:16:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:16:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:16:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:16:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:16:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:16:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:16:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:16:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:16:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:16:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:16:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:16:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:16:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-02 14:16:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-02 14:16:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-02 14:16:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-02 14:16:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-02 14:16:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-02 14:16:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-02 14:16:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-02 14:16:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:16:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:16:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:16:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:16:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:16:00,899 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:16:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:16:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:16:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:16:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:16:00,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:16:00,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:16:00,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:16:03,744 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:16:03,745 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:16:03,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:16:03 BoogieIcfgContainer [2019-10-02 14:16:03,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:16:03,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:16:03,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:16:03,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:16:03,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:15:59" (1/3) ... [2019-10-02 14:16:03,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752b1ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:16:03, skipping insertion in model container [2019-10-02 14:16:03,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:16:00" (2/3) ... [2019-10-02 14:16:03,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752b1ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:16:03, skipping insertion in model container [2019-10-02 14:16:03,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:16:03" (3/3) ... [2019-10-02 14:16:03,757 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_productSimulator.cil.c [2019-10-02 14:16:03,768 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:16:03,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:16:03,800 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:16:03,852 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:16:03,853 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:16:03,853 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:16:03,853 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:16:03,853 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:16:03,854 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:16:03,854 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:16:03,854 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:16:03,854 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:16:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states. [2019-10-02 14:16:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 14:16:03,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:03,987 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:03,991 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 573423146, now seen corresponding path program 1 times [2019-10-02 14:16:04,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:04,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:04,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:04,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:04,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:16:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:04,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:16:04,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:16:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:16:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:16:04,821 INFO L87 Difference]: Start difference. First operand 818 states. Second operand 6 states. [2019-10-02 14:16:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:05,086 INFO L93 Difference]: Finished difference Result 1554 states and 2145 transitions. [2019-10-02 14:16:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:16:05,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-10-02 14:16:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:05,128 INFO L225 Difference]: With dead ends: 1554 [2019-10-02 14:16:05,128 INFO L226 Difference]: Without dead ends: 789 [2019-10-02 14:16:05,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:16:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-02 14:16:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2019-10-02 14:16:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-02 14:16:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1073 transitions. [2019-10-02 14:16:05,299 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1073 transitions. Word has length 170 [2019-10-02 14:16:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:05,306 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1073 transitions. [2019-10-02 14:16:05,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:16:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1073 transitions. [2019-10-02 14:16:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 14:16:05,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:05,324 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:05,324 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 612736889, now seen corresponding path program 1 times [2019-10-02 14:16:05,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:05,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:16:05,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:05,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:16:05,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:16:05,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:16:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:16:05,707 INFO L87 Difference]: Start difference. First operand 789 states and 1073 transitions. Second operand 4 states. [2019-10-02 14:16:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:06,587 INFO L93 Difference]: Finished difference Result 1541 states and 2131 transitions. [2019-10-02 14:16:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:16:06,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-10-02 14:16:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:06,597 INFO L225 Difference]: With dead ends: 1541 [2019-10-02 14:16:06,597 INFO L226 Difference]: Without dead ends: 788 [2019-10-02 14:16:06,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:16:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-02 14:16:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-10-02 14:16:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-02 14:16:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1063 transitions. [2019-10-02 14:16:06,642 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1063 transitions. Word has length 176 [2019-10-02 14:16:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:06,642 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1063 transitions. [2019-10-02 14:16:06,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:16:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1063 transitions. [2019-10-02 14:16:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 14:16:06,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:06,648 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:06,648 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash -928366809, now seen corresponding path program 1 times [2019-10-02 14:16:06,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:06,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:06,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:06,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:16:06,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:06,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:06,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:06,979 INFO L87 Difference]: Start difference. First operand 788 states and 1063 transitions. Second operand 3 states. [2019-10-02 14:16:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:07,212 INFO L93 Difference]: Finished difference Result 1534 states and 2090 transitions. [2019-10-02 14:16:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:07,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 14:16:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:07,221 INFO L225 Difference]: With dead ends: 1534 [2019-10-02 14:16:07,222 INFO L226 Difference]: Without dead ends: 787 [2019-10-02 14:16:07,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-02 14:16:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2019-10-02 14:16:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-10-02 14:16:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1059 transitions. [2019-10-02 14:16:07,289 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1059 transitions. Word has length 194 [2019-10-02 14:16:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:07,290 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1059 transitions. [2019-10-02 14:16:07,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1059 transitions. [2019-10-02 14:16:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 14:16:07,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:07,298 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:07,298 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -848638024, now seen corresponding path program 1 times [2019-10-02 14:16:07,299 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:07,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:07,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:07,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:16:07,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:07,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:16:07,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:16:07,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:16:07,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:16:07,565 INFO L87 Difference]: Start difference. First operand 787 states and 1059 transitions. Second operand 4 states. [2019-10-02 14:16:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:08,382 INFO L93 Difference]: Finished difference Result 1505 states and 2036 transitions. [2019-10-02 14:16:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:16:08,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-10-02 14:16:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:08,392 INFO L225 Difference]: With dead ends: 1505 [2019-10-02 14:16:08,392 INFO L226 Difference]: Without dead ends: 784 [2019-10-02 14:16:08,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:16:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-10-02 14:16:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-10-02 14:16:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-10-02 14:16:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1042 transitions. [2019-10-02 14:16:08,437 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1042 transitions. Word has length 195 [2019-10-02 14:16:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:08,438 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1042 transitions. [2019-10-02 14:16:08,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:16:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1042 transitions. [2019-10-02 14:16:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 14:16:08,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:08,444 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:08,445 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1998841435, now seen corresponding path program 1 times [2019-10-02 14:16:08,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:08,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:08,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 14:16:08,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:08,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:08,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:08,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:08,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:08,647 INFO L87 Difference]: Start difference. First operand 784 states and 1042 transitions. Second operand 3 states. [2019-10-02 14:16:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:08,711 INFO L93 Difference]: Finished difference Result 1221 states and 1603 transitions. [2019-10-02 14:16:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:08,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 14:16:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:08,718 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 14:16:08,719 INFO L226 Difference]: Without dead ends: 787 [2019-10-02 14:16:08,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-02 14:16:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 786. [2019-10-02 14:16:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-10-02 14:16:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1044 transitions. [2019-10-02 14:16:08,762 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1044 transitions. Word has length 222 [2019-10-02 14:16:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:08,763 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1044 transitions. [2019-10-02 14:16:08,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1044 transitions. [2019-10-02 14:16:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 14:16:08,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:08,767 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:08,767 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1395334039, now seen corresponding path program 1 times [2019-10-02 14:16:08,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:08,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:08,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 14:16:08,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:08,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:08,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:08,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:08,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:08,959 INFO L87 Difference]: Start difference. First operand 786 states and 1044 transitions. Second operand 3 states. [2019-10-02 14:16:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:09,076 INFO L93 Difference]: Finished difference Result 1510 states and 2044 transitions. [2019-10-02 14:16:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:09,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-02 14:16:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:09,084 INFO L225 Difference]: With dead ends: 1510 [2019-10-02 14:16:09,084 INFO L226 Difference]: Without dead ends: 841 [2019-10-02 14:16:09,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-02 14:16:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 840. [2019-10-02 14:16:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-10-02 14:16:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1132 transitions. [2019-10-02 14:16:09,131 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1132 transitions. Word has length 230 [2019-10-02 14:16:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:09,132 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1132 transitions. [2019-10-02 14:16:09,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1132 transitions. [2019-10-02 14:16:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 14:16:09,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:09,140 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:09,141 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash -424313440, now seen corresponding path program 1 times [2019-10-02 14:16:09,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:09,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 14:16:09,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:09,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:09,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:09,436 INFO L87 Difference]: Start difference. First operand 840 states and 1132 transitions. Second operand 3 states. [2019-10-02 14:16:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:09,512 INFO L93 Difference]: Finished difference Result 1413 states and 1904 transitions. [2019-10-02 14:16:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:09,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 14:16:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:09,522 INFO L225 Difference]: With dead ends: 1413 [2019-10-02 14:16:09,522 INFO L226 Difference]: Without dead ends: 992 [2019-10-02 14:16:09,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-10-02 14:16:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 991. [2019-10-02 14:16:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-10-02 14:16:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1343 transitions. [2019-10-02 14:16:09,590 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1343 transitions. Word has length 231 [2019-10-02 14:16:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:09,591 INFO L475 AbstractCegarLoop]: Abstraction has 991 states and 1343 transitions. [2019-10-02 14:16:09,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1343 transitions. [2019-10-02 14:16:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-10-02 14:16:09,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:09,604 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:09,605 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:09,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash 417129015, now seen corresponding path program 1 times [2019-10-02 14:16:09,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:09,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:09,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:09,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:09,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 14:16:10,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:10,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:16:10,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:16:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:16:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:16:10,034 INFO L87 Difference]: Start difference. First operand 991 states and 1343 transitions. Second operand 6 states. [2019-10-02 14:16:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:10,923 INFO L93 Difference]: Finished difference Result 2407 states and 3264 transitions. [2019-10-02 14:16:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:16:10,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 378 [2019-10-02 14:16:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:10,937 INFO L225 Difference]: With dead ends: 2407 [2019-10-02 14:16:10,937 INFO L226 Difference]: Without dead ends: 1881 [2019-10-02 14:16:10,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:16:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-10-02 14:16:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1870. [2019-10-02 14:16:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2019-10-02 14:16:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2561 transitions. [2019-10-02 14:16:11,036 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2561 transitions. Word has length 378 [2019-10-02 14:16:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:11,037 INFO L475 AbstractCegarLoop]: Abstraction has 1870 states and 2561 transitions. [2019-10-02 14:16:11,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:16:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2561 transitions. [2019-10-02 14:16:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-02 14:16:11,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:11,049 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:11,050 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1849311616, now seen corresponding path program 1 times [2019-10-02 14:16:11,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:11,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:11,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 14:16:11,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:11,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:16:11,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:16:11,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:16:11,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:16:11,493 INFO L87 Difference]: Start difference. First operand 1870 states and 2561 transitions. Second operand 13 states. [2019-10-02 14:16:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:12,155 INFO L93 Difference]: Finished difference Result 2973 states and 4015 transitions. [2019-10-02 14:16:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:16:12,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 379 [2019-10-02 14:16:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:12,170 INFO L225 Difference]: With dead ends: 2973 [2019-10-02 14:16:12,171 INFO L226 Difference]: Without dead ends: 1916 [2019-10-02 14:16:12,178 INFO L640 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-10-02 14:16:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2019-10-02 14:16:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1912. [2019-10-02 14:16:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-10-02 14:16:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2618 transitions. [2019-10-02 14:16:12,292 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2618 transitions. Word has length 379 [2019-10-02 14:16:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:12,293 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 2618 transitions. [2019-10-02 14:16:12,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:16:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2618 transitions. [2019-10-02 14:16:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-02 14:16:12,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:12,307 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:12,307 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:12,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1019360707, now seen corresponding path program 1 times [2019-10-02 14:16:12,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:12,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:16:12,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:12,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:12,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:12,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:12,622 INFO L87 Difference]: Start difference. First operand 1912 states and 2618 transitions. Second operand 3 states. [2019-10-02 14:16:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:12,795 INFO L93 Difference]: Finished difference Result 5430 states and 7564 transitions. [2019-10-02 14:16:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:12,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-10-02 14:16:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:12,821 INFO L225 Difference]: With dead ends: 5430 [2019-10-02 14:16:12,821 INFO L226 Difference]: Without dead ends: 3554 [2019-10-02 14:16:12,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-10-02 14:16:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3547. [2019-10-02 14:16:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2019-10-02 14:16:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4907 transitions. [2019-10-02 14:16:13,019 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4907 transitions. Word has length 392 [2019-10-02 14:16:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:13,020 INFO L475 AbstractCegarLoop]: Abstraction has 3547 states and 4907 transitions. [2019-10-02 14:16:13,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4907 transitions. [2019-10-02 14:16:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 14:16:13,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:13,041 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:13,042 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash 898900797, now seen corresponding path program 1 times [2019-10-02 14:16:13,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:13,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:16:13,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:13,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:13,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:13,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:13,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:13,328 INFO L87 Difference]: Start difference. First operand 3547 states and 4907 transitions. Second operand 3 states. [2019-10-02 14:16:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:13,625 INFO L93 Difference]: Finished difference Result 8601 states and 12117 transitions. [2019-10-02 14:16:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:13,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2019-10-02 14:16:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:13,660 INFO L225 Difference]: With dead ends: 8601 [2019-10-02 14:16:13,660 INFO L226 Difference]: Without dead ends: 5102 [2019-10-02 14:16:13,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2019-10-02 14:16:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5099. [2019-10-02 14:16:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2019-10-02 14:16:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7066 transitions. [2019-10-02 14:16:13,929 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7066 transitions. Word has length 394 [2019-10-02 14:16:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:13,929 INFO L475 AbstractCegarLoop]: Abstraction has 5099 states and 7066 transitions. [2019-10-02 14:16:13,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7066 transitions. [2019-10-02 14:16:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 14:16:13,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:13,949 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:13,950 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:13,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1508164640, now seen corresponding path program 1 times [2019-10-02 14:16:13,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:13,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:13,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:13,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:13,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 14:16:14,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:16:14,511 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:16:14,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:15,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 4230 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:16:15,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:16:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 14:16:15,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:16:15,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [24] total 33 [2019-10-02 14:16:16,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 14:16:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 14:16:16,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:16:16,001 INFO L87 Difference]: Start difference. First operand 5099 states and 7066 transitions. Second operand 33 states. [2019-10-02 14:17:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:30,497 INFO L93 Difference]: Finished difference Result 35045 states and 52777 transitions. [2019-10-02 14:17:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-10-02 14:17:30,497 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 362 [2019-10-02 14:17:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:30,727 INFO L225 Difference]: With dead ends: 35045 [2019-10-02 14:17:30,728 INFO L226 Difference]: Without dead ends: 29824 [2019-10-02 14:17:30,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15308 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3152, Invalid=40320, Unknown=0, NotChecked=0, Total=43472 [2019-10-02 14:17:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29824 states. [2019-10-02 14:17:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29824 to 28554. [2019-10-02 14:17:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28554 states. [2019-10-02 14:17:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28554 states to 28554 states and 42330 transitions. [2019-10-02 14:17:33,899 INFO L78 Accepts]: Start accepts. Automaton has 28554 states and 42330 transitions. Word has length 362 [2019-10-02 14:17:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:17:33,900 INFO L475 AbstractCegarLoop]: Abstraction has 28554 states and 42330 transitions. [2019-10-02 14:17:33,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 14:17:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 28554 states and 42330 transitions. [2019-10-02 14:17:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 14:17:33,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:17:33,965 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:17:33,966 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:17:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:17:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1045553805, now seen corresponding path program 1 times [2019-10-02 14:17:33,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:17:33,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:17:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:33,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-10-02 14:17:34,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:17:34,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:17:34,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:17:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:17:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:17:34,239 INFO L87 Difference]: Start difference. First operand 28554 states and 42330 transitions. Second operand 5 states. [2019-10-02 14:17:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:35,435 INFO L93 Difference]: Finished difference Result 51746 states and 76112 transitions. [2019-10-02 14:17:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:17:35,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 370 [2019-10-02 14:17:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:35,584 INFO L225 Difference]: With dead ends: 51746 [2019-10-02 14:17:35,584 INFO L226 Difference]: Without dead ends: 27356 [2019-10-02 14:17:35,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:17:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27356 states. [2019-10-02 14:17:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27356 to 27063. [2019-10-02 14:17:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27063 states. [2019-10-02 14:17:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27063 states to 27063 states and 39790 transitions. [2019-10-02 14:17:37,271 INFO L78 Accepts]: Start accepts. Automaton has 27063 states and 39790 transitions. Word has length 370 [2019-10-02 14:17:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:17:37,272 INFO L475 AbstractCegarLoop]: Abstraction has 27063 states and 39790 transitions. [2019-10-02 14:17:37,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:17:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27063 states and 39790 transitions. [2019-10-02 14:17:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-10-02 14:17:38,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:17:38,492 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:17:38,492 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:17:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:17:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash -109817058, now seen corresponding path program 1 times [2019-10-02 14:17:38,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:17:38,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:17:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:38,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 14:17:39,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:17:39,057 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:17:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:39,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 4235 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:17:39,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:17:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:17:40,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:17:40,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 27 [2019-10-02 14:17:40,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:17:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:17:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:17:40,307 INFO L87 Difference]: Start difference. First operand 27063 states and 39790 transitions. Second operand 27 states. [2019-10-02 14:17:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:44,951 INFO L93 Difference]: Finished difference Result 55781 states and 85666 transitions. [2019-10-02 14:17:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:17:44,951 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 367 [2019-10-02 14:17:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:45,110 INFO L225 Difference]: With dead ends: 55781 [2019-10-02 14:17:45,111 INFO L226 Difference]: Without dead ends: 28849 [2019-10-02 14:17:45,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:17:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28849 states. [2019-10-02 14:17:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28849 to 28533. [2019-10-02 14:17:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28533 states. [2019-10-02 14:17:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28533 states to 28533 states and 42927 transitions. [2019-10-02 14:17:47,067 INFO L78 Accepts]: Start accepts. Automaton has 28533 states and 42927 transitions. Word has length 367 [2019-10-02 14:17:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:17:47,068 INFO L475 AbstractCegarLoop]: Abstraction has 28533 states and 42927 transitions. [2019-10-02 14:17:47,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 14:17:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 28533 states and 42927 transitions. [2019-10-02 14:17:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 14:17:47,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:17:47,136 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:17:47,136 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:17:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:17:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1454682993, now seen corresponding path program 1 times [2019-10-02 14:17:47,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:17:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:17:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 14:17:48,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:17:48,083 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:17:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:48,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 4233 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:17:48,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:17:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:17:49,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:17:49,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [20] total 29 [2019-10-02 14:17:49,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:17:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:17:49,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:17:49,291 INFO L87 Difference]: Start difference. First operand 28533 states and 42927 transitions. Second operand 29 states. [2019-10-02 14:18:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:18:59,710 INFO L93 Difference]: Finished difference Result 86072 states and 133421 transitions. [2019-10-02 14:18:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-02 14:18:59,711 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 365 [2019-10-02 14:18:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:19:00,440 INFO L225 Difference]: With dead ends: 86072 [2019-10-02 14:19:00,441 INFO L226 Difference]: Without dead ends: 49859 [2019-10-02 14:19:00,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14619 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2445, Invalid=38561, Unknown=0, NotChecked=0, Total=41006 [2019-10-02 14:19:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49859 states. [2019-10-02 14:19:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49859 to 45686. [2019-10-02 14:19:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-10-02 14:19:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 69056 transitions. [2019-10-02 14:19:02,768 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 69056 transitions. Word has length 365 [2019-10-02 14:19:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:02,769 INFO L475 AbstractCegarLoop]: Abstraction has 45686 states and 69056 transitions. [2019-10-02 14:19:02,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:19:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 69056 transitions. [2019-10-02 14:19:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-02 14:19:02,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:02,812 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:02,812 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:02,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2013188855, now seen corresponding path program 1 times [2019-10-02 14:19:02,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:02,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:02,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-02 14:19:03,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:19:03,349 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:19:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:04,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 4237 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:19:04,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:19:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-02 14:19:05,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:19:05,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [20] total 29 [2019-10-02 14:19:05,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:19:05,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:19:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:19:05,141 INFO L87 Difference]: Start difference. First operand 45686 states and 69056 transitions. Second operand 29 states. [2019-10-02 14:20:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:18,409 INFO L93 Difference]: Finished difference Result 127764 states and 198294 transitions. [2019-10-02 14:20:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-02 14:20:18,409 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 369 [2019-10-02 14:20:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:20:18,782 INFO L225 Difference]: With dead ends: 127764 [2019-10-02 14:20:18,783 INFO L226 Difference]: Without dead ends: 67669 [2019-10-02 14:20:19,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14645 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2445, Invalid=38561, Unknown=0, NotChecked=0, Total=41006 [2019-10-02 14:20:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67669 states. [2019-10-02 14:20:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67669 to 59963. [2019-10-02 14:20:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59963 states. [2019-10-02 14:20:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59963 states to 59963 states and 90875 transitions. [2019-10-02 14:20:22,355 INFO L78 Accepts]: Start accepts. Automaton has 59963 states and 90875 transitions. Word has length 369 [2019-10-02 14:20:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:22,356 INFO L475 AbstractCegarLoop]: Abstraction has 59963 states and 90875 transitions. [2019-10-02 14:20:22,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:20:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 59963 states and 90875 transitions. [2019-10-02 14:20:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-10-02 14:20:22,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:22,399 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:22,399 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1538057215, now seen corresponding path program 1 times [2019-10-02 14:20:22,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:22,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 14:20:22,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:20:22,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:20:22,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:20:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:20:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:20:22,737 INFO L87 Difference]: Start difference. First operand 59963 states and 90875 transitions. Second operand 11 states. [2019-10-02 14:20:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:31,481 INFO L93 Difference]: Finished difference Result 149586 states and 232386 transitions. [2019-10-02 14:20:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:20:31,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 368 [2019-10-02 14:20:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:20:32,002 INFO L225 Difference]: With dead ends: 149586 [2019-10-02 14:20:32,002 INFO L226 Difference]: Without dead ends: 94107 [2019-10-02 14:20:32,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:20:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94107 states. [2019-10-02 14:20:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94107 to 92586. [2019-10-02 14:20:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92586 states. [2019-10-02 14:20:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92586 states to 92586 states and 145021 transitions. [2019-10-02 14:20:36,692 INFO L78 Accepts]: Start accepts. Automaton has 92586 states and 145021 transitions. Word has length 368 [2019-10-02 14:20:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:36,693 INFO L475 AbstractCegarLoop]: Abstraction has 92586 states and 145021 transitions. [2019-10-02 14:20:36,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:20:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 92586 states and 145021 transitions. [2019-10-02 14:20:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-02 14:20:36,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:36,757 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:36,757 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:36,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash 972010488, now seen corresponding path program 1 times [2019-10-02 14:20:36,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:36,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:36,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:20:40,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:20:40,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:20:40,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:20:40,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:20:40,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:20:40,447 INFO L87 Difference]: Start difference. First operand 92586 states and 145021 transitions. Second operand 3 states. [2019-10-02 14:20:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:43,554 INFO L93 Difference]: Finished difference Result 186102 states and 291772 transitions. [2019-10-02 14:20:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:20:43,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-10-02 14:20:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:20:44,028 INFO L225 Difference]: With dead ends: 186102 [2019-10-02 14:20:44,028 INFO L226 Difference]: Without dead ends: 93846 [2019-10-02 14:20:44,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:20:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93846 states. [2019-10-02 14:20:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93846 to 93834. [2019-10-02 14:20:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93834 states. [2019-10-02 14:20:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93834 states to 93834 states and 147091 transitions. [2019-10-02 14:20:49,149 INFO L78 Accepts]: Start accepts. Automaton has 93834 states and 147091 transitions. Word has length 415 [2019-10-02 14:20:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:49,149 INFO L475 AbstractCegarLoop]: Abstraction has 93834 states and 147091 transitions. [2019-10-02 14:20:49,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:20:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 93834 states and 147091 transitions. [2019-10-02 14:20:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-10-02 14:20:49,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:49,205 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:49,205 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 775831517, now seen corresponding path program 1 times [2019-10-02 14:20:49,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:49,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:49,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:20:49,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:20:49,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:20:49,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:20:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:20:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:20:49,442 INFO L87 Difference]: Start difference. First operand 93834 states and 147091 transitions. Second operand 3 states. [2019-10-02 14:20:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:53,542 INFO L93 Difference]: Finished difference Result 189750 states and 297862 transitions. [2019-10-02 14:20:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:20:53,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-10-02 14:20:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:20:53,997 INFO L225 Difference]: With dead ends: 189750 [2019-10-02 14:20:53,997 INFO L226 Difference]: Without dead ends: 96246 [2019-10-02 14:20:54,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:20:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96246 states. [2019-10-02 14:21:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96246 to 96234. [2019-10-02 14:21:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96234 states. [2019-10-02 14:21:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96234 states to 96234 states and 151087 transitions. [2019-10-02 14:21:02,940 INFO L78 Accepts]: Start accepts. Automaton has 96234 states and 151087 transitions. Word has length 418 [2019-10-02 14:21:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:21:02,941 INFO L475 AbstractCegarLoop]: Abstraction has 96234 states and 151087 transitions. [2019-10-02 14:21:02,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:21:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 96234 states and 151087 transitions. [2019-10-02 14:21:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-02 14:21:02,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:21:02,988 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:21:02,989 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:21:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:21:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 135624785, now seen corresponding path program 1 times [2019-10-02 14:21:02,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:21:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:21:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:02,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:21:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:21:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-02 14:21:03,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:21:03,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:21:03,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:21:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:21:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:03,254 INFO L87 Difference]: Start difference. First operand 96234 states and 151087 transitions. Second operand 3 states. [2019-10-02 14:21:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:21:09,815 INFO L93 Difference]: Finished difference Result 196758 states and 309514 transitions. [2019-10-02 14:21:09,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:21:09,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2019-10-02 14:21:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:10,213 INFO L225 Difference]: With dead ends: 196758 [2019-10-02 14:21:10,213 INFO L226 Difference]: Without dead ends: 100854 [2019-10-02 14:21:10,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100854 states. [2019-10-02 14:21:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100854 to 100842. [2019-10-02 14:21:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100842 states. [2019-10-02 14:21:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100842 states to 100842 states and 158695 transitions. [2019-10-02 14:21:17,977 INFO L78 Accepts]: Start accepts. Automaton has 100842 states and 158695 transitions. Word has length 430 [2019-10-02 14:21:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:21:17,977 INFO L475 AbstractCegarLoop]: Abstraction has 100842 states and 158695 transitions. [2019-10-02 14:21:17,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:21:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 100842 states and 158695 transitions. [2019-10-02 14:21:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-10-02 14:21:18,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:21:18,051 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:21:18,052 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:21:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:21:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 98524425, now seen corresponding path program 1 times [2019-10-02 14:21:18,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:21:18,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:21:18,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:18,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:21:18,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:21:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 14:21:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:21:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:21:18,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:21:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:21:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:18,330 INFO L87 Difference]: Start difference. First operand 100842 states and 158695 transitions. Second operand 3 states. [2019-10-02 14:21:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:21:25,198 INFO L93 Difference]: Finished difference Result 210198 states and 331714 transitions. [2019-10-02 14:21:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:21:25,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-10-02 14:21:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:25,633 INFO L225 Difference]: With dead ends: 210198 [2019-10-02 14:21:25,633 INFO L226 Difference]: Without dead ends: 109686 [2019-10-02 14:21:25,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109686 states. [2019-10-02 14:21:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109686 to 109674. [2019-10-02 14:21:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109674 states. [2019-10-02 14:21:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109674 states to 109674 states and 173191 transitions. [2019-10-02 14:21:30,869 INFO L78 Accepts]: Start accepts. Automaton has 109674 states and 173191 transitions. Word has length 421 [2019-10-02 14:21:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:21:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 109674 states and 173191 transitions. [2019-10-02 14:21:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:21:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 109674 states and 173191 transitions. [2019-10-02 14:21:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-02 14:21:30,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:21:30,963 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:21:30,964 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:21:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:21:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2084717555, now seen corresponding path program 1 times [2019-10-02 14:21:30,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:21:30,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:21:30,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:30,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:21:30,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:21:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 14:21:31,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:21:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:21:31,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:21:31,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:21:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:31,940 INFO L87 Difference]: Start difference. First operand 109674 states and 173191 transitions. Second operand 3 states. [2019-10-02 14:21:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:21:39,948 INFO L93 Difference]: Finished difference Result 235926 states and 373762 transitions. [2019-10-02 14:21:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:21:39,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2019-10-02 14:21:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:40,468 INFO L225 Difference]: With dead ends: 235926 [2019-10-02 14:21:40,469 INFO L226 Difference]: Without dead ends: 126582 [2019-10-02 14:21:40,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126582 states. [2019-10-02 14:21:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126582 to 126570. [2019-10-02 14:21:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126570 states. [2019-10-02 14:21:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126570 states to 126570 states and 200551 transitions. [2019-10-02 14:21:49,935 INFO L78 Accepts]: Start accepts. Automaton has 126570 states and 200551 transitions. Word has length 430 [2019-10-02 14:21:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:21:49,936 INFO L475 AbstractCegarLoop]: Abstraction has 126570 states and 200551 transitions. [2019-10-02 14:21:49,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:21:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 126570 states and 200551 transitions. [2019-10-02 14:21:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-02 14:21:50,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:21:50,083 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:21:50,084 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:21:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:21:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash 983016338, now seen corresponding path program 1 times [2019-10-02 14:21:50,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:21:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:21:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:21:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:21:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-02 14:21:50,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:21:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:21:50,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:21:50,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:21:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:50,370 INFO L87 Difference]: Start difference. First operand 126570 states and 200551 transitions. Second operand 3 states. [2019-10-02 14:21:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:21:56,479 INFO L93 Difference]: Finished difference Result 285078 states and 453922 transitions. [2019-10-02 14:21:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:21:56,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2019-10-02 14:21:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:57,013 INFO L225 Difference]: With dead ends: 285078 [2019-10-02 14:21:57,013 INFO L226 Difference]: Without dead ends: 158838 [2019-10-02 14:21:57,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:21:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158838 states. [2019-10-02 14:22:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158838 to 158826. [2019-10-02 14:22:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158826 states. [2019-10-02 14:22:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158826 states to 158826 states and 252967 transitions. [2019-10-02 14:22:10,359 INFO L78 Accepts]: Start accepts. Automaton has 158826 states and 252967 transitions. Word has length 422 [2019-10-02 14:22:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:22:10,360 INFO L475 AbstractCegarLoop]: Abstraction has 158826 states and 252967 transitions. [2019-10-02 14:22:10,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:22:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 158826 states and 252967 transitions. [2019-10-02 14:22:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-10-02 14:22:10,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:22:10,666 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:22:10,666 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:22:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:22:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1041261828, now seen corresponding path program 1 times [2019-10-02 14:22:10,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:22:10,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:22:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:10,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-02 14:22:10,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:22:10,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:22:10,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:22:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:22:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:22:10,921 INFO L87 Difference]: Start difference. First operand 158826 states and 252967 transitions. Second operand 6 states. [2019-10-02 14:22:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:22:18,503 INFO L93 Difference]: Finished difference Result 317430 states and 508054 transitions. [2019-10-02 14:22:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:22:18,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 430 [2019-10-02 14:22:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:22:19,139 INFO L225 Difference]: With dead ends: 317430 [2019-10-02 14:22:19,139 INFO L226 Difference]: Without dead ends: 158934 [2019-10-02 14:22:19,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:22:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158934 states. [2019-10-02 14:22:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158934 to 158934. [2019-10-02 14:22:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158934 states. [2019-10-02 14:22:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158934 states to 158934 states and 253099 transitions. [2019-10-02 14:22:33,751 INFO L78 Accepts]: Start accepts. Automaton has 158934 states and 253099 transitions. Word has length 430 [2019-10-02 14:22:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:22:33,751 INFO L475 AbstractCegarLoop]: Abstraction has 158934 states and 253099 transitions. [2019-10-02 14:22:33,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:22:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 158934 states and 253099 transitions. [2019-10-02 14:22:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-10-02 14:22:34,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:22:34,025 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:22:34,026 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:22:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:22:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1520494555, now seen corresponding path program 1 times [2019-10-02 14:22:34,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:22:34,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:22:34,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:34,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:34,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-02 14:22:35,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:22:35,096 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:22:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:35,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 4630 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:22:35,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:22:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 14:22:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:22:36,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 14:22:36,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:22:36,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:22:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:22:36,252 INFO L87 Difference]: Start difference. First operand 158934 states and 253099 transitions. Second operand 13 states. [2019-10-02 14:22:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:22:49,829 INFO L93 Difference]: Finished difference Result 317608 states and 506489 transitions. [2019-10-02 14:22:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:22:49,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 439 [2019-10-02 14:22:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:22:50,493 INFO L225 Difference]: With dead ends: 317608 [2019-10-02 14:22:50,493 INFO L226 Difference]: Without dead ends: 158955 [2019-10-02 14:22:50,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:22:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158955 states. [2019-10-02 14:22:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158955 to 158955. [2019-10-02 14:22:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158955 states. [2019-10-02 14:22:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158955 states to 158955 states and 252262 transitions. [2019-10-02 14:22:59,138 INFO L78 Accepts]: Start accepts. Automaton has 158955 states and 252262 transitions. Word has length 439 [2019-10-02 14:22:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:22:59,139 INFO L475 AbstractCegarLoop]: Abstraction has 158955 states and 252262 transitions. [2019-10-02 14:22:59,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:22:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 158955 states and 252262 transitions. [2019-10-02 14:22:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-10-02 14:22:59,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:22:59,492 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:22:59,492 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:22:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:22:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash 972240971, now seen corresponding path program 1 times [2019-10-02 14:22:59,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:22:59,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:22:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:23:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 14:23:00,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:23:00,863 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:23:01,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:23:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:23:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 4631 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:23:01,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:23:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-02 14:23:01,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:23:01,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2019-10-02 14:23:01,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:23:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:23:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:23:01,982 INFO L87 Difference]: Start difference. First operand 158955 states and 252262 transitions. Second operand 20 states. [2019-10-02 14:23:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:23:17,405 INFO L93 Difference]: Finished difference Result 318171 states and 505108 transitions. [2019-10-02 14:23:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 14:23:17,406 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 442 [2019-10-02 14:23:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:23:17,999 INFO L225 Difference]: With dead ends: 318171 [2019-10-02 14:23:17,999 INFO L226 Difference]: Without dead ends: 159317 [2019-10-02 14:23:18,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:23:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159317 states. [2019-10-02 14:23:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159317 to 158889. [2019-10-02 14:23:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158889 states. [2019-10-02 14:23:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158889 states to 158889 states and 252112 transitions. [2019-10-02 14:23:26,651 INFO L78 Accepts]: Start accepts. Automaton has 158889 states and 252112 transitions. Word has length 442 [2019-10-02 14:23:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:23:26,651 INFO L475 AbstractCegarLoop]: Abstraction has 158889 states and 252112 transitions. [2019-10-02 14:23:26,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:23:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 158889 states and 252112 transitions. [2019-10-02 14:23:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-02 14:23:26,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:23:26,909 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:23:26,910 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:23:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:23:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash 377948502, now seen corresponding path program 1 times [2019-10-02 14:23:26,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:23:26,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:23:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:23:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:23:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:23:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:23:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 14:23:27,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:23:27,353 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:23:27,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:23:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:23:28,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 4587 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:23:28,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:23:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 14:23:32,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:23:32,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4] total 24 [2019-10-02 14:23:32,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:23:32,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:23:32,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:23:32,643 INFO L87 Difference]: Start difference. First operand 158889 states and 252112 transitions. Second operand 24 states. [2019-10-02 14:23:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:23:38,766 INFO L93 Difference]: Finished difference Result 235559 states and 371723 transitions. [2019-10-02 14:23:38,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:23:38,767 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 427 [2019-10-02 14:23:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:23:39,347 INFO L225 Difference]: With dead ends: 235559 [2019-10-02 14:23:39,347 INFO L226 Difference]: Without dead ends: 158045 [2019-10-02 14:23:39,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:23:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158045 states. [2019-10-02 14:23:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158045 to 157317. [2019-10-02 14:23:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157317 states. [2019-10-02 14:23:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157317 states to 157317 states and 247877 transitions. [2019-10-02 14:23:47,730 INFO L78 Accepts]: Start accepts. Automaton has 157317 states and 247877 transitions. Word has length 427 [2019-10-02 14:23:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:23:47,731 INFO L475 AbstractCegarLoop]: Abstraction has 157317 states and 247877 transitions. [2019-10-02 14:23:47,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:23:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 157317 states and 247877 transitions. [2019-10-02 14:23:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-10-02 14:23:48,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:23:48,051 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:23:48,051 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:23:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:23:48,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1160186008, now seen corresponding path program 1 times [2019-10-02 14:23:48,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:23:48,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:23:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:23:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:23:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:23:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:23:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-02 14:23:49,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:23:49,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:23:49,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:23:49,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:23:49,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:23:49,286 INFO L87 Difference]: Start difference. First operand 157317 states and 247877 transitions. Second operand 5 states. [2019-10-02 14:23:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:23:58,363 INFO L93 Difference]: Finished difference Result 314052 states and 495024 transitions. [2019-10-02 14:23:58,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:23:58,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 436 [2019-10-02 14:23:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:23:58,994 INFO L225 Difference]: With dead ends: 314052 [2019-10-02 14:23:58,995 INFO L226 Difference]: Without dead ends: 157329 [2019-10-02 14:23:59,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:23:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157329 states. [2019-10-02 14:24:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157329 to 157317. [2019-10-02 14:24:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157317 states. [2019-10-02 14:24:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157317 states to 157317 states and 247109 transitions. [2019-10-02 14:24:12,341 INFO L78 Accepts]: Start accepts. Automaton has 157317 states and 247109 transitions. Word has length 436 [2019-10-02 14:24:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:24:12,342 INFO L475 AbstractCegarLoop]: Abstraction has 157317 states and 247109 transitions. [2019-10-02 14:24:12,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:24:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 157317 states and 247109 transitions. [2019-10-02 14:24:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-10-02 14:24:12,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:24:12,592 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:24:12,592 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:24:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:24:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1425720532, now seen corresponding path program 1 times [2019-10-02 14:24:12,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:24:12,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:24:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-02 14:24:12,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:24:12,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:24:12,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:24:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:24:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:24:12,829 INFO L87 Difference]: Start difference. First operand 157317 states and 247109 transitions. Second operand 5 states. [2019-10-02 14:24:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:24:19,271 INFO L93 Difference]: Finished difference Result 314052 states and 493488 transitions. [2019-10-02 14:24:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:24:19,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 443 [2019-10-02 14:24:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:24:19,836 INFO L225 Difference]: With dead ends: 314052 [2019-10-02 14:24:19,837 INFO L226 Difference]: Without dead ends: 157329 [2019-10-02 14:24:20,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:24:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157329 states. [2019-10-02 14:24:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157329 to 157317. [2019-10-02 14:24:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157317 states. [2019-10-02 14:24:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157317 states to 157317 states and 246341 transitions. [2019-10-02 14:24:35,554 INFO L78 Accepts]: Start accepts. Automaton has 157317 states and 246341 transitions. Word has length 443 [2019-10-02 14:24:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:24:35,554 INFO L475 AbstractCegarLoop]: Abstraction has 157317 states and 246341 transitions. [2019-10-02 14:24:35,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:24:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 157317 states and 246341 transitions. [2019-10-02 14:24:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-10-02 14:24:35,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:24:35,836 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:24:35,836 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:24:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:24:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -437740002, now seen corresponding path program 1 times [2019-10-02 14:24:35,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:24:35,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:24:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:35,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-02 14:24:36,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:24:36,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 14:24:36,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:24:36,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:24:36,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:24:36,179 INFO L87 Difference]: Start difference. First operand 157317 states and 246341 transitions. Second operand 14 states. [2019-10-02 14:24:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:24:41,231 INFO L93 Difference]: Finished difference Result 184518 states and 286763 transitions. [2019-10-02 14:24:41,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:24:41,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 436 [2019-10-02 14:24:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:24:41,906 INFO L225 Difference]: With dead ends: 184518 [2019-10-02 14:24:41,906 INFO L226 Difference]: Without dead ends: 152281 [2019-10-02 14:24:42,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:24:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152281 states. [2019-10-02 14:24:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152281 to 151592. [2019-10-02 14:24:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151592 states. [2019-10-02 14:24:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151592 states to 151592 states and 237607 transitions. [2019-10-02 14:24:49,866 INFO L78 Accepts]: Start accepts. Automaton has 151592 states and 237607 transitions. Word has length 436 [2019-10-02 14:24:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:24:49,866 INFO L475 AbstractCegarLoop]: Abstraction has 151592 states and 237607 transitions. [2019-10-02 14:24:49,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:24:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 151592 states and 237607 transitions. [2019-10-02 14:24:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-10-02 14:24:50,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:24:50,114 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:24:50,115 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:24:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:24:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash -753115455, now seen corresponding path program 1 times [2019-10-02 14:24:50,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:24:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:24:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:50,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:50,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-02 14:24:50,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:24:50,376 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:24:50,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:51,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 4605 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:24:51,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:24:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 14:24:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:24:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 14:24:51,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:24:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:24:51,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:24:51,403 INFO L87 Difference]: Start difference. First operand 151592 states and 237607 transitions. Second operand 8 states. [2019-10-02 14:25:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:25:07,035 INFO L93 Difference]: Finished difference Result 370840 states and 606312 transitions. [2019-10-02 14:25:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:25:07,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 435 [2019-10-02 14:25:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:25:08,205 INFO L225 Difference]: With dead ends: 370840 [2019-10-02 14:25:08,205 INFO L226 Difference]: Without dead ends: 289571 [2019-10-02 14:25:08,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:25:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289571 states. [2019-10-02 14:25:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289571 to 288324. [2019-10-02 14:25:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288324 states. [2019-10-02 14:25:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288324 states to 288324 states and 473602 transitions. [2019-10-02 14:25:32,672 INFO L78 Accepts]: Start accepts. Automaton has 288324 states and 473602 transitions. Word has length 435 [2019-10-02 14:25:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:25:32,672 INFO L475 AbstractCegarLoop]: Abstraction has 288324 states and 473602 transitions. [2019-10-02 14:25:32,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:25:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 288324 states and 473602 transitions. [2019-10-02 14:25:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2019-10-02 14:25:33,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:25:33,166 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:25:33,166 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:25:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:25:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1108174004, now seen corresponding path program 1 times [2019-10-02 14:25:33,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:25:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:25:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:25:33,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:25:33,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:25:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:25:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-02 14:25:33,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:25:33,543 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:25:33,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:25:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:25:34,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 4660 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:25:34,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:25:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-10-02 14:25:35,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:25:35,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 14:25:35,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:25:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:25:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:25:35,261 INFO L87 Difference]: Start difference. First operand 288324 states and 473602 transitions. Second operand 13 states. [2019-10-02 14:26:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:26:50,061 INFO L93 Difference]: Finished difference Result 1190771 states and 3087407 transitions. [2019-10-02 14:26:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:26:50,061 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 451 [2019-10-02 14:26:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted.