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_spec3_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:06:44,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:06:44,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:06:44,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:06:44,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:06:44,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:06:44,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:06:44,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:06:44,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:06:44,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:06:44,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:06:44,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:06:44,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:06:44,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:06:44,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:06:44,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:06:44,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:06:44,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:06:44,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:06:44,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:06:44,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:06:44,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:06:44,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:06:44,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:06:44,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:06:44,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:06:44,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:06:44,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:06:44,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:06:44,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:06:44,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:06:44,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:06:44,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:06:44,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:06:44,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:06:44,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:06:44,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:06:44,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:06:44,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:06:44,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:06:44,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:06:44,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:06:44,862 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:06:44,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:06:44,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:06:44,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:06:44,866 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:06:44,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:06:44,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:06:44,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:06:44,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:06:44,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:06:44,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:06:44,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:06:44,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:06:44,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:06:44,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:06:44,870 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:06:44,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:06:44,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:06:44,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:06:44,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:06:44,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:06:44,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:06:44,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:06:44,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:06:44,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:06:44,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:06:44,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:06:44,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:06:44,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:06:44,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:06:44,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:06:44,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:06:44,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:06:44,959 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:06:44,960 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product30.cil.c [2019-09-08 05:06:45,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0492ecb96/d24ce95e4735424d9092a1913b17f087/FLAG87e30c11b [2019-09-08 05:06:45,705 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:06:45,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product30.cil.c [2019-09-08 05:06:45,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0492ecb96/d24ce95e4735424d9092a1913b17f087/FLAG87e30c11b [2019-09-08 05:06:45,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0492ecb96/d24ce95e4735424d9092a1913b17f087 [2019-09-08 05:06:45,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:06:45,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:06:45,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:06:45,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:06:45,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:06:45,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:06:45" (1/1) ... [2019-09-08 05:06:45,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df8f01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:45, skipping insertion in model container [2019-09-08 05:06:45,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:06:45" (1/1) ... [2019-09-08 05:06:46,006 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:06:46,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:06:46,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:06:46,915 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:06:47,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:06:47,215 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:06:47,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47 WrapperNode [2019-09-08 05:06:47,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:06:47,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:06:47,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:06:47,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:06:47,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... [2019-09-08 05:06:47,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:06:47,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:06:47,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:06:47,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:06:47,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:06:47,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:06:47,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:06:47,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:06:47,567 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:06:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-08 05:06:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:06:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:06:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:06:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:06:47,568 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:06:47,569 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:06:47,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:06:47,569 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:06:47,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:06:47,571 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:06:47,571 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:06:47,573 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:06:47,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:06:47,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:06:47,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:06:47,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:06:47,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:06:47,575 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:06:47,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:06:47,575 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:06:47,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:06:47,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:06:47,576 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:06:47,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:06:47,577 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:06:47,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:06:47,577 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:06:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:06:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:06:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:06:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:06:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:06:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:06:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:06:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:06:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:06:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:06:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:06:47,579 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:06:47,580 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:06:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:06:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:06:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:06:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:06:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:06:47,581 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:06:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:06:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:06:47,582 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:06:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:06:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:06:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:06:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:06:47,583 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:06:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:06:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:06:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:06:47,584 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:06:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:06:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:06:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:06:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:06:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:06:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:06:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:06:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:06:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:06:47,587 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:06:47,587 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:06:47,587 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:06:47,587 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:06:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:06:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:06:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 05:06:47,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 05:06:47,589 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:06:47,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:06:47,589 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:06:47,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:06:47,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:06:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:06:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:06:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:06:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:06:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:06:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:06:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:06:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:06:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:06:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:06:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:06:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:06:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:06:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:06:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:06:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:06:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:06:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:06:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:06:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:06:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:06:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:06:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:06:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:06:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:06:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:06:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:06:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:06:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:06:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:06:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:06:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:06:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-08 05:06:47,603 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:06:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:06:47,604 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:06:47,605 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:06:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:06:47,609 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:06:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:06:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:06:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:06:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:06:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:06:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:06:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:06:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:06:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:06:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:06:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:06:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:06:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:06:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:06:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:06:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:06:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:06:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:06:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:06:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:06:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:06:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:06:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:06:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:06:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:06:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:06:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:06:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:06:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:06:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:06:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:06:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:06:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:06:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:06:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:06:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:06:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:06:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:06:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:06:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:06:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:06:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:06:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:06:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:06:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:06:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:06:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:06:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:06:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:06:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:06:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:06:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:06:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:06:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:06:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:06:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:06:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:06:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:06:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:06:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 05:06:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:06:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:06:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:06:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:06:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:06:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 05:06:47,632 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:06:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:06:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:06:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:06:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:06:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:06:47,633 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:06:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:06:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:06:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:06:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:06:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:06:47,634 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:06:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:06:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:06:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:06:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:06:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:06:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:06:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:06:49,737 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:06:49,737 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:06:49,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:06:49 BoogieIcfgContainer [2019-09-08 05:06:49,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:06:49,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:06:49,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:06:49,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:06:49,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:06:45" (1/3) ... [2019-09-08 05:06:49,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524fc597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:06:49, skipping insertion in model container [2019-09-08 05:06:49,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:06:47" (2/3) ... [2019-09-08 05:06:49,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524fc597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:06:49, skipping insertion in model container [2019-09-08 05:06:49,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:06:49" (3/3) ... [2019-09-08 05:06:49,749 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product30.cil.c [2019-09-08 05:06:49,759 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:06:49,771 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:06:49,788 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:06:49,834 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:06:49,835 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:06:49,835 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:06:49,836 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:06:49,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:06:49,840 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:06:49,840 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:06:49,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:06:49,841 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:06:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states. [2019-09-08 05:06:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 05:06:49,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:49,911 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:49,913 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1721519425, now seen corresponding path program 1 times [2019-09-08 05:06:49,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:49,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:06:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:06:50,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:06:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:06:50,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:06:50,641 INFO L87 Difference]: Start difference. First operand 556 states. Second operand 2 states. [2019-09-08 05:06:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:50,774 INFO L93 Difference]: Finished difference Result 798 states and 1059 transitions. [2019-09-08 05:06:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:06:50,776 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-09-08 05:06:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:50,809 INFO L225 Difference]: With dead ends: 798 [2019-09-08 05:06:50,809 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 05:06:50,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:06:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 05:06:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-09-08 05:06:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 05:06:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 671 transitions. [2019-09-08 05:06:50,918 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 671 transitions. Word has length 195 [2019-09-08 05:06:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:50,920 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 671 transitions. [2019-09-08 05:06:50,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:06:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 671 transitions. [2019-09-08 05:06:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 05:06:50,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:50,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:50,935 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1479265370, now seen corresponding path program 1 times [2019-09-08 05:06:50,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:50,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:06:51,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:51,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:51,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:51,203 INFO L87 Difference]: Start difference. First operand 505 states and 671 transitions. Second operand 3 states. [2019-09-08 05:06:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:51,279 INFO L93 Difference]: Finished difference Result 781 states and 1022 transitions. [2019-09-08 05:06:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:51,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 05:06:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:51,285 INFO L225 Difference]: With dead ends: 781 [2019-09-08 05:06:51,285 INFO L226 Difference]: Without dead ends: 508 [2019-09-08 05:06:51,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-08 05:06:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2019-09-08 05:06:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-08 05:06:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 673 transitions. [2019-09-08 05:06:51,349 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 673 transitions. Word has length 196 [2019-09-08 05:06:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:51,350 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 673 transitions. [2019-09-08 05:06:51,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 673 transitions. [2019-09-08 05:06:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 05:06:51,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:51,355 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:51,355 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash 789958250, now seen corresponding path program 1 times [2019-09-08 05:06:51,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:51,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:51,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:06:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:51,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:51,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:51,577 INFO L87 Difference]: Start difference. First operand 507 states and 673 transitions. Second operand 3 states. [2019-09-08 05:06:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:51,624 INFO L93 Difference]: Finished difference Result 990 states and 1344 transitions. [2019-09-08 05:06:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:51,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-08 05:06:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:51,633 INFO L225 Difference]: With dead ends: 990 [2019-09-08 05:06:51,633 INFO L226 Difference]: Without dead ends: 548 [2019-09-08 05:06:51,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-09-08 05:06:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 547. [2019-09-08 05:06:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 05:06:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 742 transitions. [2019-09-08 05:06:51,670 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 742 transitions. Word has length 206 [2019-09-08 05:06:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:51,671 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 742 transitions. [2019-09-08 05:06:51,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 742 transitions. [2019-09-08 05:06:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 05:06:51,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:51,676 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:51,676 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash 688583183, now seen corresponding path program 1 times [2019-09-08 05:06:51,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:51,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:51,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:51,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:06:51,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:51,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:51,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:51,825 INFO L87 Difference]: Start difference. First operand 547 states and 742 transitions. Second operand 3 states. [2019-09-08 05:06:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:51,858 INFO L93 Difference]: Finished difference Result 1107 states and 1546 transitions. [2019-09-08 05:06:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:51,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 05:06:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:51,863 INFO L225 Difference]: With dead ends: 1107 [2019-09-08 05:06:51,864 INFO L226 Difference]: Without dead ends: 625 [2019-09-08 05:06:51,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-08 05:06:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 624. [2019-09-08 05:06:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 05:06:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 874 transitions. [2019-09-08 05:06:51,892 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 874 transitions. Word has length 207 [2019-09-08 05:06:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:51,893 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 874 transitions. [2019-09-08 05:06:51,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 874 transitions. [2019-09-08 05:06:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 05:06:51,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:51,899 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:51,900 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1758410390, now seen corresponding path program 1 times [2019-09-08 05:06:51,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:51,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:06:52,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:52,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:52,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:52,112 INFO L87 Difference]: Start difference. First operand 624 states and 874 transitions. Second operand 3 states. [2019-09-08 05:06:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:52,149 INFO L93 Difference]: Finished difference Result 1332 states and 1932 transitions. [2019-09-08 05:06:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:52,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 05:06:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:52,155 INFO L225 Difference]: With dead ends: 1332 [2019-09-08 05:06:52,155 INFO L226 Difference]: Without dead ends: 773 [2019-09-08 05:06:52,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-08 05:06:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 772. [2019-09-08 05:06:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-09-08 05:06:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1126 transitions. [2019-09-08 05:06:52,190 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1126 transitions. Word has length 208 [2019-09-08 05:06:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:52,190 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 1126 transitions. [2019-09-08 05:06:52,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1126 transitions. [2019-09-08 05:06:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:06:52,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:52,196 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:52,196 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1379207951, now seen corresponding path program 1 times [2019-09-08 05:06:52,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:52,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:52,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:06:52,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:52,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:52,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:52,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:52,342 INFO L87 Difference]: Start difference. First operand 772 states and 1126 transitions. Second operand 3 states. [2019-09-08 05:06:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:52,391 INFO L93 Difference]: Finished difference Result 1764 states and 2668 transitions. [2019-09-08 05:06:52,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:52,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 05:06:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:52,399 INFO L225 Difference]: With dead ends: 1764 [2019-09-08 05:06:52,400 INFO L226 Difference]: Without dead ends: 1057 [2019-09-08 05:06:52,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-09-08 05:06:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1056. [2019-09-08 05:06:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-09-08 05:06:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1606 transitions. [2019-09-08 05:06:52,446 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1606 transitions. Word has length 209 [2019-09-08 05:06:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:52,447 INFO L475 AbstractCegarLoop]: Abstraction has 1056 states and 1606 transitions. [2019-09-08 05:06:52,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1606 transitions. [2019-09-08 05:06:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 05:06:52,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:52,454 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:52,455 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:52,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1500956376, now seen corresponding path program 1 times [2019-09-08 05:06:52,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:52,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:52,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:06:52,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:06:52,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:06:53,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:06:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:53,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 2955 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:06:53,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:06:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 05:06:53,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:06:53,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-09-08 05:06:53,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:06:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:06:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:06:53,854 INFO L87 Difference]: Start difference. First operand 1056 states and 1606 transitions. Second operand 26 states. [2019-09-08 05:07:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:03,385 INFO L93 Difference]: Finished difference Result 3699 states and 5645 transitions. [2019-09-08 05:07:03,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 05:07:03,386 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-09-08 05:07:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:03,405 INFO L225 Difference]: With dead ends: 3699 [2019-09-08 05:07:03,405 INFO L226 Difference]: Without dead ends: 2679 [2019-09-08 05:07:03,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 05:07:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2019-09-08 05:07:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2639. [2019-09-08 05:07:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-09-08 05:07:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4003 transitions. [2019-09-08 05:07:03,565 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4003 transitions. Word has length 212 [2019-09-08 05:07:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:03,565 INFO L475 AbstractCegarLoop]: Abstraction has 2639 states and 4003 transitions. [2019-09-08 05:07:03,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:07:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4003 transitions. [2019-09-08 05:07:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 05:07:03,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:03,579 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:03,579 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:03,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1538912746, now seen corresponding path program 1 times [2019-09-08 05:07:03,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:03,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:03,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:03,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:07:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:07:03,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:07:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:07:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:04,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:07:04,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:07:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:07:04,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:07:04,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 05:07:04,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:07:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:07:04,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:07:04,462 INFO L87 Difference]: Start difference. First operand 2639 states and 4003 transitions. Second operand 16 states. [2019-09-08 05:07:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:06,705 INFO L93 Difference]: Finished difference Result 5305 states and 8110 transitions. [2019-09-08 05:07:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:07:06,706 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 214 [2019-09-08 05:07:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:06,723 INFO L225 Difference]: With dead ends: 5305 [2019-09-08 05:07:06,723 INFO L226 Difference]: Without dead ends: 2701 [2019-09-08 05:07:06,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:07:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-09-08 05:07:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2019-09-08 05:07:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-09-08 05:07:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 4105 transitions. [2019-09-08 05:07:06,886 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 4105 transitions. Word has length 214 [2019-09-08 05:07:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:06,886 INFO L475 AbstractCegarLoop]: Abstraction has 2701 states and 4105 transitions. [2019-09-08 05:07:06,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:07:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 4105 transitions. [2019-09-08 05:07:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 05:07:06,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:06,900 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:06,901 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1548070957, now seen corresponding path program 1 times [2019-09-08 05:07:06,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:06,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:07:07,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:07:07,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:07:07,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:07,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 2958 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:07:07,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:07:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:07:07,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:07:07,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-09-08 05:07:07,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:07:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:07:07,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:07:07,929 INFO L87 Difference]: Start difference. First operand 2701 states and 4105 transitions. Second operand 22 states. [2019-09-08 05:07:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:16,053 INFO L93 Difference]: Finished difference Result 5470 states and 8376 transitions. [2019-09-08 05:07:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 05:07:16,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2019-09-08 05:07:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:16,074 INFO L225 Difference]: With dead ends: 5470 [2019-09-08 05:07:16,074 INFO L226 Difference]: Without dead ends: 2830 [2019-09-08 05:07:16,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:07:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2019-09-08 05:07:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2785. [2019-09-08 05:07:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2019-09-08 05:07:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4237 transitions. [2019-09-08 05:07:16,297 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4237 transitions. Word has length 215 [2019-09-08 05:07:16,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:16,297 INFO L475 AbstractCegarLoop]: Abstraction has 2785 states and 4237 transitions. [2019-09-08 05:07:16,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:07:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4237 transitions. [2019-09-08 05:07:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 05:07:16,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:16,311 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:07:16,311 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash -365801470, now seen corresponding path program 1 times [2019-09-08 05:07:16,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:16,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:16,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:16,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 05:07:16,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:16,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:07:16,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:07:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:07:16,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:07:16,500 INFO L87 Difference]: Start difference. First operand 2785 states and 4237 transitions. Second operand 5 states. [2019-09-08 05:07:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:16,611 INFO L93 Difference]: Finished difference Result 3655 states and 5378 transitions. [2019-09-08 05:07:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:07:16,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-08 05:07:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:16,629 INFO L225 Difference]: With dead ends: 3655 [2019-09-08 05:07:16,630 INFO L226 Difference]: Without dead ends: 2448 [2019-09-08 05:07:16,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:07:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2019-09-08 05:07:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2446. [2019-09-08 05:07:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2019-09-08 05:07:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 3760 transitions. [2019-09-08 05:07:16,749 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 3760 transitions. Word has length 219 [2019-09-08 05:07:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:16,750 INFO L475 AbstractCegarLoop]: Abstraction has 2446 states and 3760 transitions. [2019-09-08 05:07:16,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:07:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3760 transitions. [2019-09-08 05:07:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 05:07:16,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:16,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:16,763 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:16,764 INFO L82 PathProgramCache]: Analyzing trace with hash -582791751, now seen corresponding path program 1 times [2019-09-08 05:07:16,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:16,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:16,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:07:17,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:17,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:07:17,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:07:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:07:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:07:17,076 INFO L87 Difference]: Start difference. First operand 2446 states and 3760 transitions. Second operand 16 states. [2019-09-08 05:07:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:17,436 INFO L93 Difference]: Finished difference Result 3360 states and 4979 transitions. [2019-09-08 05:07:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:07:17,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 216 [2019-09-08 05:07:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:17,452 INFO L225 Difference]: With dead ends: 3360 [2019-09-08 05:07:17,452 INFO L226 Difference]: Without dead ends: 2473 [2019-09-08 05:07:17,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:07:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-09-08 05:07:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2460. [2019-09-08 05:07:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2460 states. [2019-09-08 05:07:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3770 transitions. [2019-09-08 05:07:17,579 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3770 transitions. Word has length 216 [2019-09-08 05:07:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:17,579 INFO L475 AbstractCegarLoop]: Abstraction has 2460 states and 3770 transitions. [2019-09-08 05:07:17,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:07:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3770 transitions. [2019-09-08 05:07:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 05:07:17,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:17,590 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:17,591 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1262441468, now seen corresponding path program 1 times [2019-09-08 05:07:17,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:17,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:17,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:07:17,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:07:17,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:07:17,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:18,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 2959 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:07:18,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:07:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:07:18,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:07:18,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 05:07:18,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:07:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:07:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:07:18,436 INFO L87 Difference]: Start difference. First operand 2460 states and 3770 transitions. Second operand 12 states. [2019-09-08 05:07:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:22,481 INFO L93 Difference]: Finished difference Result 7069 states and 10826 transitions. [2019-09-08 05:07:22,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:07:22,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-09-08 05:07:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:22,509 INFO L225 Difference]: With dead ends: 7069 [2019-09-08 05:07:22,510 INFO L226 Difference]: Without dead ends: 4684 [2019-09-08 05:07:22,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:07:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-09-08 05:07:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4653. [2019-09-08 05:07:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4653 states. [2019-09-08 05:07:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 7060 transitions. [2019-09-08 05:07:22,740 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 7060 transitions. Word has length 216 [2019-09-08 05:07:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:22,741 INFO L475 AbstractCegarLoop]: Abstraction has 4653 states and 7060 transitions. [2019-09-08 05:07:22,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:07:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 7060 transitions. [2019-09-08 05:07:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 05:07:22,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:22,758 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:22,758 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash 120415888, now seen corresponding path program 1 times [2019-09-08 05:07:22,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:07:22,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:22,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 05:07:22,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:07:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:07:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:07:22,985 INFO L87 Difference]: Start difference. First operand 4653 states and 7060 transitions. Second operand 12 states. [2019-09-08 05:07:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:33,423 INFO L93 Difference]: Finished difference Result 22131 states and 30127 transitions. [2019-09-08 05:07:33,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:07:33,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 217 [2019-09-08 05:07:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:33,512 INFO L225 Difference]: With dead ends: 22131 [2019-09-08 05:07:33,512 INFO L226 Difference]: Without dead ends: 17819 [2019-09-08 05:07:33,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 05:07:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17819 states. [2019-09-08 05:07:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17819 to 17020. [2019-09-08 05:07:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2019-09-08 05:07:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 23246 transitions. [2019-09-08 05:07:35,051 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 23246 transitions. Word has length 217 [2019-09-08 05:07:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:35,053 INFO L475 AbstractCegarLoop]: Abstraction has 17020 states and 23246 transitions. [2019-09-08 05:07:35,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:07:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 23246 transitions. [2019-09-08 05:07:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 05:07:35,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:35,071 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:35,072 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 472127972, now seen corresponding path program 1 times [2019-09-08 05:07:35,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:07:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:35,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:07:35,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:07:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:07:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:07:35,362 INFO L87 Difference]: Start difference. First operand 17020 states and 23246 transitions. Second operand 18 states. [2019-09-08 05:07:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:36,012 INFO L93 Difference]: Finished difference Result 27709 states and 37173 transitions. [2019-09-08 05:07:36,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:07:36,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 218 [2019-09-08 05:07:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:36,061 INFO L225 Difference]: With dead ends: 27709 [2019-09-08 05:07:36,061 INFO L226 Difference]: Without dead ends: 12037 [2019-09-08 05:07:36,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:07:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12037 states. [2019-09-08 05:07:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12037 to 11085. [2019-09-08 05:07:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11085 states. [2019-09-08 05:07:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11085 states to 11085 states and 15454 transitions. [2019-09-08 05:07:36,710 INFO L78 Accepts]: Start accepts. Automaton has 11085 states and 15454 transitions. Word has length 218 [2019-09-08 05:07:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:36,711 INFO L475 AbstractCegarLoop]: Abstraction has 11085 states and 15454 transitions. [2019-09-08 05:07:36,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:07:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 11085 states and 15454 transitions. [2019-09-08 05:07:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 05:07:36,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:36,727 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:36,727 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:36,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1116114066, now seen corresponding path program 1 times [2019-09-08 05:07:36,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:36,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:36,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:07:37,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:37,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:07:37,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:07:37,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:07:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:07:37,027 INFO L87 Difference]: Start difference. First operand 11085 states and 15454 transitions. Second operand 8 states. [2019-09-08 05:07:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:38,723 INFO L93 Difference]: Finished difference Result 27563 states and 37220 transitions. [2019-09-08 05:07:38,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:07:38,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-09-08 05:07:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:38,814 INFO L225 Difference]: With dead ends: 27563 [2019-09-08 05:07:38,814 INFO L226 Difference]: Without dead ends: 20479 [2019-09-08 05:07:38,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:07:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20479 states. [2019-09-08 05:07:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20479 to 19972. [2019-09-08 05:07:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2019-09-08 05:07:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 27186 transitions. [2019-09-08 05:07:39,736 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 27186 transitions. Word has length 227 [2019-09-08 05:07:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:39,737 INFO L475 AbstractCegarLoop]: Abstraction has 19972 states and 27186 transitions. [2019-09-08 05:07:39,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:07:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 27186 transitions. [2019-09-08 05:07:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 05:07:39,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:39,756 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:39,757 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1064651066, now seen corresponding path program 1 times [2019-09-08 05:07:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:39,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:07:40,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:07:40,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:07:40,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:07:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:40,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:07:40,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:07:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:07:40,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:07:40,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-09-08 05:07:40,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:07:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:07:40,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:07:40,617 INFO L87 Difference]: Start difference. First operand 19972 states and 27186 transitions. Second operand 20 states. [2019-09-08 05:07:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:48,059 INFO L93 Difference]: Finished difference Result 40882 states and 55990 transitions. [2019-09-08 05:07:48,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 05:07:48,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 228 [2019-09-08 05:07:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:48,177 INFO L225 Difference]: With dead ends: 40882 [2019-09-08 05:07:48,177 INFO L226 Difference]: Without dead ends: 20990 [2019-09-08 05:07:48,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=2721, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 05:07:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20990 states. [2019-09-08 05:07:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20990 to 19873. [2019-09-08 05:07:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19873 states. [2019-09-08 05:07:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19873 states to 19873 states and 27062 transitions. [2019-09-08 05:07:50,954 INFO L78 Accepts]: Start accepts. Automaton has 19873 states and 27062 transitions. Word has length 228 [2019-09-08 05:07:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:50,955 INFO L475 AbstractCegarLoop]: Abstraction has 19873 states and 27062 transitions. [2019-09-08 05:07:50,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:07:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 19873 states and 27062 transitions. [2019-09-08 05:07:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 05:07:50,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:50,983 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:50,983 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1510254888, now seen corresponding path program 1 times [2019-09-08 05:07:50,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:50,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:07:51,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:07:51,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:07:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:51,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:07:51,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:07:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:07:51,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:07:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-09-08 05:07:51,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 05:07:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 05:07:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:07:51,996 INFO L87 Difference]: Start difference. First operand 19873 states and 27062 transitions. Second operand 30 states. [2019-09-08 05:07:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:59,859 INFO L93 Difference]: Finished difference Result 41144 states and 56353 transitions. [2019-09-08 05:07:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 05:07:59,865 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 229 [2019-09-08 05:07:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:59,947 INFO L225 Difference]: With dead ends: 41144 [2019-09-08 05:07:59,947 INFO L226 Difference]: Without dead ends: 21059 [2019-09-08 05:07:59,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=507, Invalid=4749, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 05:08:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21059 states. [2019-09-08 05:08:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21059 to 20255. [2019-09-08 05:08:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20255 states. [2019-09-08 05:08:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20255 states to 20255 states and 27574 transitions. [2019-09-08 05:08:01,103 INFO L78 Accepts]: Start accepts. Automaton has 20255 states and 27574 transitions. Word has length 229 [2019-09-08 05:08:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:01,103 INFO L475 AbstractCegarLoop]: Abstraction has 20255 states and 27574 transitions. [2019-09-08 05:08:01,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 05:08:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20255 states and 27574 transitions. [2019-09-08 05:08:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 05:08:01,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:01,123 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:01,123 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1222561721, now seen corresponding path program 1 times [2019-09-08 05:08:01,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:01,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:01,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:01,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:08:01,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:01,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:08:01,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:08:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:08:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:08:01,385 INFO L87 Difference]: Start difference. First operand 20255 states and 27574 transitions. Second operand 13 states. [2019-09-08 05:08:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:02,066 INFO L93 Difference]: Finished difference Result 30854 states and 42116 transitions. [2019-09-08 05:08:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:08:02,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-09-08 05:08:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:02,145 INFO L225 Difference]: With dead ends: 30854 [2019-09-08 05:08:02,145 INFO L226 Difference]: Without dead ends: 22289 [2019-09-08 05:08:02,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:08:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22289 states. [2019-09-08 05:08:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22289 to 21195. [2019-09-08 05:08:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21195 states. [2019-09-08 05:08:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21195 states to 21195 states and 29077 transitions. [2019-09-08 05:08:03,073 INFO L78 Accepts]: Start accepts. Automaton has 21195 states and 29077 transitions. Word has length 230 [2019-09-08 05:08:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:03,074 INFO L475 AbstractCegarLoop]: Abstraction has 21195 states and 29077 transitions. [2019-09-08 05:08:03,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:08:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21195 states and 29077 transitions. [2019-09-08 05:08:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 05:08:03,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:03,085 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:03,085 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:03,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1884380019, now seen corresponding path program 2 times [2019-09-08 05:08:03,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:03,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:03,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:08:03,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:08:03,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:08:04,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:08:04,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:08:04,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 05:08:04,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:08:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:08:04,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:08:04,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-08 05:08:04,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:08:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:08:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:08:04,357 INFO L87 Difference]: Start difference. First operand 21195 states and 29077 transitions. Second operand 18 states. [2019-09-08 05:08:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:13,576 INFO L93 Difference]: Finished difference Result 56500 states and 78116 transitions. [2019-09-08 05:08:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:08:13,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-09-08 05:08:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:13,704 INFO L225 Difference]: With dead ends: 56500 [2019-09-08 05:08:13,705 INFO L226 Difference]: Without dead ends: 36541 [2019-09-08 05:08:13,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 05:08:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36541 states. [2019-09-08 05:08:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36541 to 30626. [2019-09-08 05:08:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30626 states. [2019-09-08 05:08:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30626 states to 30626 states and 42357 transitions. [2019-09-08 05:08:15,325 INFO L78 Accepts]: Start accepts. Automaton has 30626 states and 42357 transitions. Word has length 230 [2019-09-08 05:08:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:15,326 INFO L475 AbstractCegarLoop]: Abstraction has 30626 states and 42357 transitions. [2019-09-08 05:08:15,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:08:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 30626 states and 42357 transitions. [2019-09-08 05:08:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 05:08:15,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:15,351 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:15,351 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -398899966, now seen corresponding path program 1 times [2019-09-08 05:08:15,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:15,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:15,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:08:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:08:15,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:15,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:08:15,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:08:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:08:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:08:15,599 INFO L87 Difference]: Start difference. First operand 30626 states and 42357 transitions. Second operand 13 states. [2019-09-08 05:08:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:16,643 INFO L93 Difference]: Finished difference Result 43944 states and 60974 transitions. [2019-09-08 05:08:16,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:08:16,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 231 [2019-09-08 05:08:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:16,763 INFO L225 Difference]: With dead ends: 43944 [2019-09-08 05:08:16,763 INFO L226 Difference]: Without dead ends: 33684 [2019-09-08 05:08:16,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:08:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33684 states. [2019-09-08 05:08:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33684 to 32004. [2019-09-08 05:08:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32004 states. [2019-09-08 05:08:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32004 states to 32004 states and 44515 transitions. [2019-09-08 05:08:18,283 INFO L78 Accepts]: Start accepts. Automaton has 32004 states and 44515 transitions. Word has length 231 [2019-09-08 05:08:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:18,284 INFO L475 AbstractCegarLoop]: Abstraction has 32004 states and 44515 transitions. [2019-09-08 05:08:18,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:08:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 32004 states and 44515 transitions. [2019-09-08 05:08:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 05:08:18,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:18,308 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:18,309 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1196688235, now seen corresponding path program 1 times [2019-09-08 05:08:18,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:18,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:18,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:18,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:18,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:18,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:18,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:08:18,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:08:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:08:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:08:18,463 INFO L87 Difference]: Start difference. First operand 32004 states and 44515 transitions. Second operand 6 states. [2019-09-08 05:08:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:19,762 INFO L93 Difference]: Finished difference Result 63880 states and 88932 transitions. [2019-09-08 05:08:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:08:19,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2019-09-08 05:08:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:19,861 INFO L225 Difference]: With dead ends: 63880 [2019-09-08 05:08:19,861 INFO L226 Difference]: Without dead ends: 32004 [2019-09-08 05:08:19,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:08:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32004 states. [2019-09-08 05:08:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32004 to 31721. [2019-09-08 05:08:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31721 states. [2019-09-08 05:08:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31721 states to 31721 states and 44131 transitions. [2019-09-08 05:08:21,273 INFO L78 Accepts]: Start accepts. Automaton has 31721 states and 44131 transitions. Word has length 231 [2019-09-08 05:08:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:21,274 INFO L475 AbstractCegarLoop]: Abstraction has 31721 states and 44131 transitions. [2019-09-08 05:08:21,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:08:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 31721 states and 44131 transitions. [2019-09-08 05:08:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 05:08:21,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:21,299 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:21,299 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:21,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1186985257, now seen corresponding path program 1 times [2019-09-08 05:08:21,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:21,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:21,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:21,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:21,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:21,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:21,420 INFO L87 Difference]: Start difference. First operand 31721 states and 44131 transitions. Second operand 3 states. [2019-09-08 05:08:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:22,353 INFO L93 Difference]: Finished difference Result 66572 states and 94158 transitions. [2019-09-08 05:08:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:22,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 05:08:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:22,462 INFO L225 Difference]: With dead ends: 66572 [2019-09-08 05:08:22,462 INFO L226 Difference]: Without dead ends: 34991 [2019-09-08 05:08:22,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34991 states. [2019-09-08 05:08:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34991 to 34636. [2019-09-08 05:08:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34636 states. [2019-09-08 05:08:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34636 states to 34636 states and 49612 transitions. [2019-09-08 05:08:24,149 INFO L78 Accepts]: Start accepts. Automaton has 34636 states and 49612 transitions. Word has length 229 [2019-09-08 05:08:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:24,150 INFO L475 AbstractCegarLoop]: Abstraction has 34636 states and 49612 transitions. [2019-09-08 05:08:24,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34636 states and 49612 transitions. [2019-09-08 05:08:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 05:08:24,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:24,182 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:24,182 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1129853862, now seen corresponding path program 1 times [2019-09-08 05:08:24,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:24,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:24,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:08:24,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:08:24,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:08:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:08:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:08:24,442 INFO L87 Difference]: Start difference. First operand 34636 states and 49612 transitions. Second operand 9 states. [2019-09-08 05:08:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:25,955 INFO L93 Difference]: Finished difference Result 69166 states and 99102 transitions. [2019-09-08 05:08:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:08:25,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 232 [2019-09-08 05:08:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:26,039 INFO L225 Difference]: With dead ends: 69166 [2019-09-08 05:08:26,039 INFO L226 Difference]: Without dead ends: 34642 [2019-09-08 05:08:26,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:08:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34642 states. [2019-09-08 05:08:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34642 to 34332. [2019-09-08 05:08:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34332 states. [2019-09-08 05:08:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34332 states to 34332 states and 49197 transitions. [2019-09-08 05:08:27,361 INFO L78 Accepts]: Start accepts. Automaton has 34332 states and 49197 transitions. Word has length 232 [2019-09-08 05:08:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:27,362 INFO L475 AbstractCegarLoop]: Abstraction has 34332 states and 49197 transitions. [2019-09-08 05:08:27,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:08:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 34332 states and 49197 transitions. [2019-09-08 05:08:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 05:08:27,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:27,394 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:27,394 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash 594754460, now seen corresponding path program 1 times [2019-09-08 05:08:27,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:27,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:08:27,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:08:27,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:08:27,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:28,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 3005 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:08:28,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:08:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:28,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:08:28,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-09-08 05:08:28,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:08:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:08:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:08:28,244 INFO L87 Difference]: Start difference. First operand 34332 states and 49197 transitions. Second operand 20 states. [2019-09-08 05:08:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:34,374 INFO L93 Difference]: Finished difference Result 65480 states and 91070 transitions. [2019-09-08 05:08:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:08:34,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 232 [2019-09-08 05:08:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:34,480 INFO L225 Difference]: With dead ends: 65480 [2019-09-08 05:08:34,481 INFO L226 Difference]: Without dead ends: 36324 [2019-09-08 05:08:34,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:08:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36324 states. [2019-09-08 05:08:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36324 to 32704. [2019-09-08 05:08:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32704 states. [2019-09-08 05:08:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32704 states to 32704 states and 46962 transitions. [2019-09-08 05:08:35,994 INFO L78 Accepts]: Start accepts. Automaton has 32704 states and 46962 transitions. Word has length 232 [2019-09-08 05:08:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:35,995 INFO L475 AbstractCegarLoop]: Abstraction has 32704 states and 46962 transitions. [2019-09-08 05:08:35,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:08:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32704 states and 46962 transitions. [2019-09-08 05:08:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 05:08:36,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:36,029 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:36,030 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1829419041, now seen corresponding path program 1 times [2019-09-08 05:08:36,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:36,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:36,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:37,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:37,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:37,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:37,644 INFO L87 Difference]: Start difference. First operand 32704 states and 46962 transitions. Second operand 3 states. [2019-09-08 05:08:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:38,988 INFO L93 Difference]: Finished difference Result 71800 states and 105832 transitions. [2019-09-08 05:08:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:38,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-08 05:08:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:39,144 INFO L225 Difference]: With dead ends: 71800 [2019-09-08 05:08:39,145 INFO L226 Difference]: Without dead ends: 39338 [2019-09-08 05:08:39,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39338 states. [2019-09-08 05:08:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39338 to 38013. [2019-09-08 05:08:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38013 states. [2019-09-08 05:08:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38013 states to 38013 states and 57190 transitions. [2019-09-08 05:08:41,199 INFO L78 Accepts]: Start accepts. Automaton has 38013 states and 57190 transitions. Word has length 232 [2019-09-08 05:08:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:41,200 INFO L475 AbstractCegarLoop]: Abstraction has 38013 states and 57190 transitions. [2019-09-08 05:08:41,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 38013 states and 57190 transitions. [2019-09-08 05:08:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:08:41,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:41,256 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:41,256 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2126138288, now seen corresponding path program 1 times [2019-09-08 05:08:41,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:41,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:41,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:41,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:41,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:41,376 INFO L87 Difference]: Start difference. First operand 38013 states and 57190 transitions. Second operand 3 states. [2019-09-08 05:08:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:42,935 INFO L93 Difference]: Finished difference Result 88070 states and 136350 transitions. [2019-09-08 05:08:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:42,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 05:08:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:43,148 INFO L225 Difference]: With dead ends: 88070 [2019-09-08 05:08:43,148 INFO L226 Difference]: Without dead ends: 50311 [2019-09-08 05:08:43,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50311 states. [2019-09-08 05:08:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50311 to 49709. [2019-09-08 05:08:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49709 states. [2019-09-08 05:08:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49709 states to 49709 states and 78252 transitions. [2019-09-08 05:08:45,664 INFO L78 Accepts]: Start accepts. Automaton has 49709 states and 78252 transitions. Word has length 233 [2019-09-08 05:08:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:45,665 INFO L475 AbstractCegarLoop]: Abstraction has 49709 states and 78252 transitions. [2019-09-08 05:08:45,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 49709 states and 78252 transitions. [2019-09-08 05:08:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 05:08:45,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:45,794 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:45,794 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1721575775, now seen corresponding path program 1 times [2019-09-08 05:08:45,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:45,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:45,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:45,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:45,902 INFO L87 Difference]: Start difference. First operand 49709 states and 78252 transitions. Second operand 3 states. [2019-09-08 05:08:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:48,630 INFO L93 Difference]: Finished difference Result 124126 states and 201120 transitions. [2019-09-08 05:08:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:48,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-08 05:08:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:48,994 INFO L225 Difference]: With dead ends: 124126 [2019-09-08 05:08:48,994 INFO L226 Difference]: Without dead ends: 74679 [2019-09-08 05:08:51,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74679 states. [2019-09-08 05:08:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74679 to 72789. [2019-09-08 05:08:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72789 states. [2019-09-08 05:08:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72789 states to 72789 states and 119902 transitions. [2019-09-08 05:08:54,814 INFO L78 Accepts]: Start accepts. Automaton has 72789 states and 119902 transitions. Word has length 234 [2019-09-08 05:08:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:54,815 INFO L475 AbstractCegarLoop]: Abstraction has 72789 states and 119902 transitions. [2019-09-08 05:08:54,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72789 states and 119902 transitions. [2019-09-08 05:08:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 05:08:55,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:55,080 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:55,080 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1558141136, now seen corresponding path program 1 times [2019-09-08 05:08:55,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:55,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:08:55,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:55,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:55,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:55,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:55,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,200 INFO L87 Difference]: Start difference. First operand 72789 states and 119902 transitions. Second operand 3 states. [2019-09-08 05:09:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:02,488 INFO L93 Difference]: Finished difference Result 191398 states and 320884 transitions. [2019-09-08 05:09:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:09:02,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-09-08 05:09:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:02,847 INFO L225 Difference]: With dead ends: 191398 [2019-09-08 05:09:02,847 INFO L226 Difference]: Without dead ends: 118887 [2019-09-08 05:09:02,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:09:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118887 states. [2019-09-08 05:09:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118887 to 118672. [2019-09-08 05:09:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118672 states. [2019-09-08 05:09:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118672 states to 118672 states and 199505 transitions. [2019-09-08 05:09:09,364 INFO L78 Accepts]: Start accepts. Automaton has 118672 states and 199505 transitions. Word has length 235 [2019-09-08 05:09:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:09,364 INFO L475 AbstractCegarLoop]: Abstraction has 118672 states and 199505 transitions. [2019-09-08 05:09:09,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:09:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118672 states and 199505 transitions. [2019-09-08 05:09:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:09:09,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:09,823 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:09,823 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash -691985827, now seen corresponding path program 1 times [2019-09-08 05:09:09,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:09,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:09,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:09:09,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:09,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:09:09,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:09:09,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:09:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:09:09,932 INFO L87 Difference]: Start difference. First operand 118672 states and 199505 transitions. Second operand 3 states. [2019-09-08 05:09:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:20,863 INFO L93 Difference]: Finished difference Result 324608 states and 550712 transitions. [2019-09-08 05:09:20,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:09:20,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-09-08 05:09:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:21,584 INFO L225 Difference]: With dead ends: 324608 [2019-09-08 05:09:21,584 INFO L226 Difference]: Without dead ends: 206234 [2019-09-08 05:09:21,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:09:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206234 states. [2019-09-08 05:09:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206234 to 206228. [2019-09-08 05:09:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206228 states. [2019-09-08 05:09:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206228 states to 206228 states and 348499 transitions. [2019-09-08 05:09:43,283 INFO L78 Accepts]: Start accepts. Automaton has 206228 states and 348499 transitions. Word has length 236 [2019-09-08 05:09:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:43,284 INFO L475 AbstractCegarLoop]: Abstraction has 206228 states and 348499 transitions. [2019-09-08 05:09:43,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:09:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 206228 states and 348499 transitions. [2019-09-08 05:09:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 05:09:44,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:44,097 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:44,097 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1323801200, now seen corresponding path program 1 times [2019-09-08 05:09:44,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:44,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:44,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:09:44,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:44,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:09:44,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:09:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:09:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:09:44,213 INFO L87 Difference]: Start difference. First operand 206228 states and 348499 transitions. Second operand 3 states. [2019-09-08 05:10:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:10:05,577 INFO L93 Difference]: Finished difference Result 392878 states and 658557 transitions. [2019-09-08 05:10:05,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:10:05,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-08 05:10:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:10:06,794 INFO L225 Difference]: With dead ends: 392878 [2019-09-08 05:10:06,795 INFO L226 Difference]: Without dead ends: 372098 [2019-09-08 05:10:06,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:10:07,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372098 states. [2019-09-08 05:10:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372098 to 372092. [2019-09-08 05:10:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372092 states. [2019-09-08 05:10:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372092 states to 372092 states and 624947 transitions. [2019-09-08 05:10:41,937 INFO L78 Accepts]: Start accepts. Automaton has 372092 states and 624947 transitions. Word has length 237 [2019-09-08 05:10:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:41,938 INFO L475 AbstractCegarLoop]: Abstraction has 372092 states and 624947 transitions. [2019-09-08 05:10:41,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:10:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 372092 states and 624947 transitions. [2019-09-08 05:10:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 05:10:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:51,508 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:51,508 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -304061667, now seen corresponding path program 1 times [2019-09-08 05:10:51,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:51,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:51,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:51,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:10:51,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:10:51,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:10:51,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:52,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 3034 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 05:10:52,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:10:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:10:52,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:10:52,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-09-08 05:10:52,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 05:10:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 05:10:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:10:52,724 INFO L87 Difference]: Start difference. First operand 372092 states and 624947 transitions. Second operand 35 states. [2019-09-08 05:11:33,974 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 16