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_spec27_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:12:34,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:12:34,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:12:34,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:12:34,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:12:34,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:12:34,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:12:34,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:12:34,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:12:34,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:12:34,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:12:34,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:12:34,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:12:34,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:12:34,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:12:34,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:12:34,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:12:34,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:12:34,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:12:34,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:12:34,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:12:34,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:12:34,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:12:34,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:12:34,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:12:34,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:12:34,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:12:34,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:12:34,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:12:34,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:12:34,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:12:34,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:12:34,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:12:34,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:12:34,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:12:34,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:12:34,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:12:34,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:12:34,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:12:34,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:12:34,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:12:34,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:12:34,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:12:34,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:12:34,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:12:34,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:12:34,829 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:12:34,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:12:34,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:12:34,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:12:34,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:12:34,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:12:34,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:12:34,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:12:34,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:12:34,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:12:34,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:12:34,831 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:12:34,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:12:34,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:12:34,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:12:34,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:12:34,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:12:34,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:12:34,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:12:34,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:12:34,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:12:34,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:12:34,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:12:34,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:12:34,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:12:34,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:12:34,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:12:34,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:12:34,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:12:34,881 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:12:34,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product32.cil.c [2019-10-02 13:12:34,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863d00568/7fe3d15715e6442384bedb6f37f9ada2/FLAG204d28003 [2019-10-02 13:12:35,651 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:12:35,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product32.cil.c [2019-10-02 13:12:35,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863d00568/7fe3d15715e6442384bedb6f37f9ada2/FLAG204d28003 [2019-10-02 13:12:35,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863d00568/7fe3d15715e6442384bedb6f37f9ada2 [2019-10-02 13:12:35,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:12:35,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:12:35,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:12:35,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:12:35,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:12:35,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:12:35" (1/1) ... [2019-10-02 13:12:35,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eaad935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:35, skipping insertion in model container [2019-10-02 13:12:35,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:12:35" (1/1) ... [2019-10-02 13:12:35,793 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:12:35,887 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:12:36,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:12:36,718 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:12:36,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:12:37,010 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:12:37,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37 WrapperNode [2019-10-02 13:12:37,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:12:37,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:12:37,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:12:37,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:12:37,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... [2019-10-02 13:12:37,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:12:37,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:12:37,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:12:37,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:12:37,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:12:37,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:12:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:12:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:12:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:12:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:12:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:12:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:12:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:12:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:12:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:12:37,324 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:12:37,324 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:12:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:12:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:12:37,326 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:12:37,326 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:12:37,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:12:37,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:12:37,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:12:37,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:12:37,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:12:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:12:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:12:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:12:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:12:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:12:37,330 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:12:37,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:12:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:12:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:12:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:12:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:12:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:12:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:12:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:12:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:12:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:12:37,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:12:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:12:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:12:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:12:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:12:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:12:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:12:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:12:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:12:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:12:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:12:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:12:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:12:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:12:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:12:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:12:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:12:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:12:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:12:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:12:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:12:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:12:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:12:37,340 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:12:37,340 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:12:37,341 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:12:37,341 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:12:37,341 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:12:37,341 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:12:37,342 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:12:37,342 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:12:37,342 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:12:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:12:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:12:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:12:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:12:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:12:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:12:37,344 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:12:37,344 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:12:37,344 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:12:37,344 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:12:37,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:12:37,345 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:12:37,346 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:12:37,347 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:12:37,347 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:12:37,347 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:12:37,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:12:37,348 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:12:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:12:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:12:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:12:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:12:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:12:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:12:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:12:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:12:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:12:37,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:12:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:12:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:12:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:12:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:12:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:12:37,351 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:12:37,352 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:12:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:12:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:12:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:12:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:12:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:12:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:12:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:12:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:12:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:12:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:12:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:12:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:12:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:12:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:12:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:12:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:12:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:12:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:12:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:12:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:12:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:12:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:12:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:12:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:12:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:12:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:12:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:12:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:12:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:12:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:12:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:12:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:12:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:12:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:12:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:12:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:12:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:12:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:12:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:12:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:12:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:12:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:12:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:12:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:12:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:12:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:12:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:12:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:12:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:12:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:12:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:12:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:12:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:12:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:12:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:12:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:12:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:12:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:12:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:12:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:12:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:12:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:12:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:12:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:12:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:12:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:12:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:12:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:12:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:12:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:12:37,380 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:12:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:12:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:12:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:12:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:12:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:12:37,381 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:12:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:12:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:12:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:12:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:12:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:12:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:12:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:12:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:12:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:12:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:12:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:12:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:12:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:12:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:12:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:12:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:12:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:12:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:12:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:12:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:12:37,387 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:12:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:12:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:12:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:12:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:12:37,388 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:12:37,389 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:12:37,389 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:12:37,389 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:12:37,389 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:12:37,389 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:12:37,390 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:12:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:12:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:12:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:12:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:12:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:12:37,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:12:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:12:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:12:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:12:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:12:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:12:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:12:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:12:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:12:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:12:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:12:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:12:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:12:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:12:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:12:39,735 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:12:39,735 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:12:39,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:12:39 BoogieIcfgContainer [2019-10-02 13:12:39,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:12:39,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:12:39,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:12:39,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:12:39,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:12:35" (1/3) ... [2019-10-02 13:12:39,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b92c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:12:39, skipping insertion in model container [2019-10-02 13:12:39,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:37" (2/3) ... [2019-10-02 13:12:39,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b92c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:12:39, skipping insertion in model container [2019-10-02 13:12:39,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:12:39" (3/3) ... [2019-10-02 13:12:39,745 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product32.cil.c [2019-10-02 13:12:39,754 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:12:39,764 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:12:39,787 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:12:39,843 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:12:39,844 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:12:39,844 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:12:39,844 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:12:39,844 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:12:39,848 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:12:39,848 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:12:39,848 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:12:39,849 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:12:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states. [2019-10-02 13:12:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 13:12:39,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:39,923 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:39,925 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash -175128502, now seen corresponding path program 1 times [2019-10-02 13:12:39,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:39,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:39,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:39,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:12:40,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:12:40,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:12:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:12:40,742 INFO L87 Difference]: Start difference. First operand 639 states. Second operand 2 states. [2019-10-02 13:12:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:40,822 INFO L93 Difference]: Finished difference Result 918 states and 1250 transitions. [2019-10-02 13:12:40,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:12:40,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 220 [2019-10-02 13:12:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:40,848 INFO L225 Difference]: With dead ends: 918 [2019-10-02 13:12:40,849 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 13:12:40,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:12:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 13:12:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 13:12:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 13:12:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-10-02 13:12:40,975 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 220 [2019-10-02 13:12:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:40,979 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-10-02 13:12:40,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:12:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-10-02 13:12:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:12:40,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:40,989 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:40,989 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 217234565, now seen corresponding path program 1 times [2019-10-02 13:12:40,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:40,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:41,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:41,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:41,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:41,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:41,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:41,354 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 3 states. [2019-10-02 13:12:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:41,476 INFO L93 Difference]: Finished difference Result 901 states and 1210 transitions. [2019-10-02 13:12:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:41,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-10-02 13:12:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:41,493 INFO L225 Difference]: With dead ends: 901 [2019-10-02 13:12:41,493 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 13:12:41,507 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 13:12:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 589. [2019-10-02 13:12:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 13:12:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 803 transitions. [2019-10-02 13:12:41,579 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 803 transitions. Word has length 221 [2019-10-02 13:12:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:41,580 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 803 transitions. [2019-10-02 13:12:41,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 803 transitions. [2019-10-02 13:12:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:12:41,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:41,594 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:41,595 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1493318645, now seen corresponding path program 1 times [2019-10-02 13:12:41,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:41,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:41,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:41,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:41,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:41,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:41,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:41,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:41,898 INFO L87 Difference]: Start difference. First operand 589 states and 803 transitions. Second operand 3 states. [2019-10-02 13:12:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:41,950 INFO L93 Difference]: Finished difference Result 1156 states and 1607 transitions. [2019-10-02 13:12:41,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:41,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 13:12:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:41,955 INFO L225 Difference]: With dead ends: 1156 [2019-10-02 13:12:41,956 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 13:12:41,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 13:12:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 631. [2019-10-02 13:12:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 13:12:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 875 transitions. [2019-10-02 13:12:41,982 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 875 transitions. Word has length 231 [2019-10-02 13:12:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:41,983 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 875 transitions. [2019-10-02 13:12:41,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 875 transitions. [2019-10-02 13:12:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:12:41,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:41,988 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:41,988 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:41,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1395259844, now seen corresponding path program 1 times [2019-10-02 13:12:41,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:41,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:42,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:42,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:42,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:42,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:42,238 INFO L87 Difference]: Start difference. First operand 631 states and 875 transitions. Second operand 3 states. [2019-10-02 13:12:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:42,276 INFO L93 Difference]: Finished difference Result 1279 states and 1818 transitions. [2019-10-02 13:12:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:42,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 13:12:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:42,282 INFO L225 Difference]: With dead ends: 1279 [2019-10-02 13:12:42,282 INFO L226 Difference]: Without dead ends: 713 [2019-10-02 13:12:42,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-10-02 13:12:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2019-10-02 13:12:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-02 13:12:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1013 transitions. [2019-10-02 13:12:42,311 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1013 transitions. Word has length 232 [2019-10-02 13:12:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:42,312 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1013 transitions. [2019-10-02 13:12:42,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1013 transitions. [2019-10-02 13:12:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:12:42,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:42,317 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:42,317 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1916343691, now seen corresponding path program 1 times [2019-10-02 13:12:42,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:42,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:42,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:42,488 INFO L87 Difference]: Start difference. First operand 712 states and 1013 transitions. Second operand 3 states. [2019-10-02 13:12:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:42,537 INFO L93 Difference]: Finished difference Result 1516 states and 2222 transitions. [2019-10-02 13:12:42,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:42,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:12:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:42,545 INFO L225 Difference]: With dead ends: 1516 [2019-10-02 13:12:42,545 INFO L226 Difference]: Without dead ends: 869 [2019-10-02 13:12:42,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-10-02 13:12:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 868. [2019-10-02 13:12:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-10-02 13:12:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1277 transitions. [2019-10-02 13:12:42,589 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1277 transitions. Word has length 233 [2019-10-02 13:12:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:42,590 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1277 transitions. [2019-10-02 13:12:42,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1277 transitions. [2019-10-02 13:12:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:12:42,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:42,599 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:42,599 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1288958908, now seen corresponding path program 1 times [2019-10-02 13:12:42,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:42,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:42,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:42,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:42,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:42,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:42,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:42,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:42,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:42,936 INFO L87 Difference]: Start difference. First operand 868 states and 1277 transitions. Second operand 3 states. [2019-10-02 13:12:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:42,989 INFO L93 Difference]: Finished difference Result 1972 states and 2994 transitions. [2019-10-02 13:12:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:42,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 13:12:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:42,996 INFO L225 Difference]: With dead ends: 1972 [2019-10-02 13:12:42,996 INFO L226 Difference]: Without dead ends: 1169 [2019-10-02 13:12:42,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-10-02 13:12:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1168. [2019-10-02 13:12:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-10-02 13:12:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1781 transitions. [2019-10-02 13:12:43,044 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1781 transitions. Word has length 234 [2019-10-02 13:12:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:43,044 INFO L475 AbstractCegarLoop]: Abstraction has 1168 states and 1781 transitions. [2019-10-02 13:12:43,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1781 transitions. [2019-10-02 13:12:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:12:43,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:43,054 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:43,054 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:43,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1347912636, now seen corresponding path program 1 times [2019-10-02 13:12:43,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:43,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:12:43,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:12:43,528 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:12:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:44,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 3220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:12:44,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:12:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:12:44,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:12:44,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:12:44,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:12:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:12:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:12:44,693 INFO L87 Difference]: Start difference. First operand 1168 states and 1781 transitions. Second operand 26 states. [2019-10-02 13:12:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:54,612 INFO L93 Difference]: Finished difference Result 4111 states and 6312 transitions. [2019-10-02 13:12:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:12:54,613 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 237 [2019-10-02 13:12:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:54,634 INFO L225 Difference]: With dead ends: 4111 [2019-10-02 13:12:54,634 INFO L226 Difference]: Without dead ends: 2979 [2019-10-02 13:12:54,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:12:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2019-10-02 13:12:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2942. [2019-10-02 13:12:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2019-10-02 13:12:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4488 transitions. [2019-10-02 13:12:54,821 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4488 transitions. Word has length 237 [2019-10-02 13:12:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:54,821 INFO L475 AbstractCegarLoop]: Abstraction has 2942 states and 4488 transitions. [2019-10-02 13:12:54,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:12:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4488 transitions. [2019-10-02 13:12:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:12:54,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:54,838 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:54,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1205138825, now seen corresponding path program 1 times [2019-10-02 13:12:54,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:54,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:54,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:12:55,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:55,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:12:55,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:12:55,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:12:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:12:55,275 INFO L87 Difference]: Start difference. First operand 2942 states and 4488 transitions. Second operand 18 states. [2019-10-02 13:12:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:55,933 INFO L93 Difference]: Finished difference Result 4383 states and 6518 transitions. [2019-10-02 13:12:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:12:55,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 239 [2019-10-02 13:12:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:55,955 INFO L225 Difference]: With dead ends: 4383 [2019-10-02 13:12:55,955 INFO L226 Difference]: Without dead ends: 3124 [2019-10-02 13:12:55,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:12:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2019-10-02 13:12:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124. [2019-10-02 13:12:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2019-10-02 13:12:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4756 transitions. [2019-10-02 13:12:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4756 transitions. Word has length 239 [2019-10-02 13:12:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:56,145 INFO L475 AbstractCegarLoop]: Abstraction has 3124 states and 4756 transitions. [2019-10-02 13:12:56,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:12:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4756 transitions. [2019-10-02 13:12:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:12:56,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:56,162 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:56,162 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash 929515602, now seen corresponding path program 1 times [2019-10-02 13:12:56,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:56,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:12:56,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:12:56,676 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:12:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:57,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 3222 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:12:57,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:12:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:12:57,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:12:57,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:12:57,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:12:57,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:12:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:12:57,490 INFO L87 Difference]: Start difference. First operand 3124 states and 4756 transitions. Second operand 20 states. [2019-10-02 13:13:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:05,048 INFO L93 Difference]: Finished difference Result 6301 states and 9710 transitions. [2019-10-02 13:13:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:13:05,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 239 [2019-10-02 13:13:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:05,069 INFO L225 Difference]: With dead ends: 6301 [2019-10-02 13:13:05,069 INFO L226 Difference]: Without dead ends: 3228 [2019-10-02 13:13:05,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:13:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-10-02 13:13:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 3198. [2019-10-02 13:13:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-10-02 13:13:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4876 transitions. [2019-10-02 13:13:05,239 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4876 transitions. Word has length 239 [2019-10-02 13:13:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:05,239 INFO L475 AbstractCegarLoop]: Abstraction has 3198 states and 4876 transitions. [2019-10-02 13:13:05,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:13:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4876 transitions. [2019-10-02 13:13:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:13:05,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:05,261 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:05,262 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1949475830, now seen corresponding path program 1 times [2019-10-02 13:13:05,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:05,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:05,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:05,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:05,531 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:05,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:06,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 3223 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:06,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:13:06,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:06,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:06,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:06,303 INFO L87 Difference]: Start difference. First operand 3198 states and 4876 transitions. Second operand 12 states. [2019-10-02 13:13:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:10,559 INFO L93 Difference]: Finished difference Result 9369 states and 14425 transitions. [2019-10-02 13:13:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:13:10,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 240 [2019-10-02 13:13:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:10,601 INFO L225 Difference]: With dead ends: 9369 [2019-10-02 13:13:10,602 INFO L226 Difference]: Without dead ends: 6232 [2019-10-02 13:13:10,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:13:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2019-10-02 13:13:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 6214. [2019-10-02 13:13:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2019-10-02 13:13:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 9506 transitions. [2019-10-02 13:13:10,950 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 9506 transitions. Word has length 240 [2019-10-02 13:13:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:10,951 INFO L475 AbstractCegarLoop]: Abstraction has 6214 states and 9506 transitions. [2019-10-02 13:13:10,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 9506 transitions. [2019-10-02 13:13:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:13:10,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:10,976 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:10,976 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1861470539, now seen corresponding path program 1 times [2019-10-02 13:13:10,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:10,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:11,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:11,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:11,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:11,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:11,214 INFO L87 Difference]: Start difference. First operand 6214 states and 9506 transitions. Second operand 7 states. [2019-10-02 13:13:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:13,415 INFO L93 Difference]: Finished difference Result 17153 states and 27158 transitions. [2019-10-02 13:13:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:13:13,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2019-10-02 13:13:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:13,510 INFO L225 Difference]: With dead ends: 17153 [2019-10-02 13:13:13,511 INFO L226 Difference]: Without dead ends: 13560 [2019-10-02 13:13:13,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:13:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2019-10-02 13:13:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 13554. [2019-10-02 13:13:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13554 states. [2019-10-02 13:13:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 21462 transitions. [2019-10-02 13:13:14,211 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 21462 transitions. Word has length 241 [2019-10-02 13:13:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:14,212 INFO L475 AbstractCegarLoop]: Abstraction has 13554 states and 21462 transitions. [2019-10-02 13:13:14,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:13:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 21462 transitions. [2019-10-02 13:13:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:13:14,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:14,240 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:14,241 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1061073382, now seen corresponding path program 1 times [2019-10-02 13:13:14,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:14,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:14,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:14,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:14,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:13:15,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:13:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:13:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:13:15,356 INFO L87 Difference]: Start difference. First operand 13554 states and 21462 transitions. Second operand 26 states. [2019-10-02 13:13:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:16,475 INFO L93 Difference]: Finished difference Result 24707 states and 39606 transitions. [2019-10-02 13:13:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:13:16,475 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 242 [2019-10-02 13:13:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:16,552 INFO L225 Difference]: With dead ends: 24707 [2019-10-02 13:13:16,552 INFO L226 Difference]: Without dead ends: 13774 [2019-10-02 13:13:16,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:13:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13774 states. [2019-10-02 13:13:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13774 to 13754. [2019-10-02 13:13:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2019-10-02 13:13:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 21688 transitions. [2019-10-02 13:13:17,274 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 21688 transitions. Word has length 242 [2019-10-02 13:13:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:17,275 INFO L475 AbstractCegarLoop]: Abstraction has 13754 states and 21688 transitions. [2019-10-02 13:13:17,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:13:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 21688 transitions. [2019-10-02 13:13:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 13:13:17,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:17,304 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:17,304 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1224047171, now seen corresponding path program 1 times [2019-10-02 13:13:17,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:17,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:17,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:17,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:13:17,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:13:17,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:13:17,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:13:17,670 INFO L87 Difference]: Start difference. First operand 13754 states and 21688 transitions. Second operand 10 states. [2019-10-02 13:13:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:18,186 INFO L93 Difference]: Finished difference Result 25097 states and 40477 transitions. [2019-10-02 13:13:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:13:18,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2019-10-02 13:13:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:18,268 INFO L225 Difference]: With dead ends: 25097 [2019-10-02 13:13:18,269 INFO L226 Difference]: Without dead ends: 14354 [2019-10-02 13:13:18,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:13:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14354 states. [2019-10-02 13:13:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14354 to 13874. [2019-10-02 13:13:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-10-02 13:13:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 21798 transitions. [2019-10-02 13:13:19,041 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 21798 transitions. Word has length 246 [2019-10-02 13:13:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:19,042 INFO L475 AbstractCegarLoop]: Abstraction has 13874 states and 21798 transitions. [2019-10-02 13:13:19,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:13:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 21798 transitions. [2019-10-02 13:13:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 13:13:19,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:19,075 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:19,075 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash -356610363, now seen corresponding path program 1 times [2019-10-02 13:13:19,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:19,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:13:19,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:19,398 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:19,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:19,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:20,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:20,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:20,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:20,151 INFO L87 Difference]: Start difference. First operand 13874 states and 21798 transitions. Second operand 12 states. [2019-10-02 13:13:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:22,251 INFO L93 Difference]: Finished difference Result 28070 states and 45133 transitions. [2019-10-02 13:13:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:13:22,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 251 [2019-10-02 13:13:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:22,333 INFO L225 Difference]: With dead ends: 28070 [2019-10-02 13:13:22,333 INFO L226 Difference]: Without dead ends: 14271 [2019-10-02 13:13:22,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14271 states. [2019-10-02 13:13:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14271 to 14074. [2019-10-02 13:13:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14074 states. [2019-10-02 13:13:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14074 states to 14074 states and 22106 transitions. [2019-10-02 13:13:23,539 INFO L78 Accepts]: Start accepts. Automaton has 14074 states and 22106 transitions. Word has length 251 [2019-10-02 13:13:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:23,540 INFO L475 AbstractCegarLoop]: Abstraction has 14074 states and 22106 transitions. [2019-10-02 13:13:23,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 14074 states and 22106 transitions. [2019-10-02 13:13:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 13:13:23,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:23,574 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:23,575 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 424999464, now seen corresponding path program 1 times [2019-10-02 13:13:23,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:23,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:23,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:13:23,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:23,927 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:24,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:24,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:24,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:13:24,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:24,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-10-02 13:13:24,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:13:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:13:24,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:24,624 INFO L87 Difference]: Start difference. First operand 14074 states and 22106 transitions. Second operand 18 states. [2019-10-02 13:13:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:27,408 INFO L93 Difference]: Finished difference Result 28096 states and 44476 transitions. [2019-10-02 13:13:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:13:27,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 252 [2019-10-02 13:13:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:27,473 INFO L225 Difference]: With dead ends: 28096 [2019-10-02 13:13:27,474 INFO L226 Difference]: Without dead ends: 14102 [2019-10-02 13:13:27,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:13:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14102 states. [2019-10-02 13:13:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14102 to 14062. [2019-10-02 13:13:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14062 states. [2019-10-02 13:13:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14062 states to 14062 states and 22097 transitions. [2019-10-02 13:13:28,237 INFO L78 Accepts]: Start accepts. Automaton has 14062 states and 22097 transitions. Word has length 252 [2019-10-02 13:13:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:28,238 INFO L475 AbstractCegarLoop]: Abstraction has 14062 states and 22097 transitions. [2019-10-02 13:13:28,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:13:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14062 states and 22097 transitions. [2019-10-02 13:13:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 13:13:28,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:28,254 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:28,254 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1807482321, now seen corresponding path program 1 times [2019-10-02 13:13:28,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:28,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:28,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:28,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:28,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:13:28,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:28,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:13:28,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:13:28,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:13:28,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:13:28,414 INFO L87 Difference]: Start difference. First operand 14062 states and 22097 transitions. Second operand 5 states. [2019-10-02 13:13:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:28,924 INFO L93 Difference]: Finished difference Result 23130 states and 35821 transitions. [2019-10-02 13:13:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:13:28,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-10-02 13:13:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:28,963 INFO L225 Difference]: With dead ends: 23130 [2019-10-02 13:13:28,963 INFO L226 Difference]: Without dead ends: 11620 [2019-10-02 13:13:28,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:13:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11620 states. [2019-10-02 13:13:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11620 to 11610. [2019-10-02 13:13:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11610 states. [2019-10-02 13:13:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 18078 transitions. [2019-10-02 13:13:29,558 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 18078 transitions. Word has length 255 [2019-10-02 13:13:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:29,559 INFO L475 AbstractCegarLoop]: Abstraction has 11610 states and 18078 transitions. [2019-10-02 13:13:29,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:13:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 18078 transitions. [2019-10-02 13:13:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 13:13:29,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:29,576 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:29,576 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash 444916843, now seen corresponding path program 1 times [2019-10-02 13:13:29,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:29,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:29,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 13:13:29,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:29,769 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:29,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:30,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 3270 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:30,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:30,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:30,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:13:30,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:13:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:13:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:13:30,473 INFO L87 Difference]: Start difference. First operand 11610 states and 18078 transitions. Second operand 11 states. [2019-10-02 13:13:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:33,278 INFO L93 Difference]: Finished difference Result 34857 states and 55446 transitions. [2019-10-02 13:13:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:13:33,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 254 [2019-10-02 13:13:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:33,352 INFO L225 Difference]: With dead ends: 34857 [2019-10-02 13:13:33,352 INFO L226 Difference]: Without dead ends: 23327 [2019-10-02 13:13:33,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:13:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23327 states. [2019-10-02 13:13:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23327 to 22987. [2019-10-02 13:13:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22987 states. [2019-10-02 13:13:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22987 states to 22987 states and 36119 transitions. [2019-10-02 13:13:34,293 INFO L78 Accepts]: Start accepts. Automaton has 22987 states and 36119 transitions. Word has length 254 [2019-10-02 13:13:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:34,293 INFO L475 AbstractCegarLoop]: Abstraction has 22987 states and 36119 transitions. [2019-10-02 13:13:34,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:13:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22987 states and 36119 transitions. [2019-10-02 13:13:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 13:13:34,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:34,321 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:34,321 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:34,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1711306168, now seen corresponding path program 1 times [2019-10-02 13:13:34,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:34,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:34,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:13:34,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:34,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:34,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:34,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:34,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:34,755 INFO L87 Difference]: Start difference. First operand 22987 states and 36119 transitions. Second operand 7 states. [2019-10-02 13:13:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:38,800 INFO L93 Difference]: Finished difference Result 60951 states and 100931 transitions. [2019-10-02 13:13:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:13:38,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 256 [2019-10-02 13:13:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:38,954 INFO L225 Difference]: With dead ends: 60951 [2019-10-02 13:13:38,954 INFO L226 Difference]: Without dead ends: 43007 [2019-10-02 13:13:38,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:13:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43007 states. [2019-10-02 13:13:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43007 to 42592. [2019-10-02 13:13:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42592 states. [2019-10-02 13:13:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42592 states to 42592 states and 70246 transitions. [2019-10-02 13:13:40,419 INFO L78 Accepts]: Start accepts. Automaton has 42592 states and 70246 transitions. Word has length 256 [2019-10-02 13:13:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:40,419 INFO L475 AbstractCegarLoop]: Abstraction has 42592 states and 70246 transitions. [2019-10-02 13:13:40,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:13:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 42592 states and 70246 transitions. [2019-10-02 13:13:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-02 13:13:40,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:40,443 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:40,444 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash 864545966, now seen corresponding path program 1 times [2019-10-02 13:13:40,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:40,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:40,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:40,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:40,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:13:42,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 13:13:42,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:13:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:13:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:13:42,498 INFO L87 Difference]: Start difference. First operand 42592 states and 70246 transitions. Second operand 30 states. [2019-10-02 13:13:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:44,426 INFO L93 Difference]: Finished difference Result 81990 states and 137297 transitions. [2019-10-02 13:13:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:13:44,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 257 [2019-10-02 13:13:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:44,596 INFO L225 Difference]: With dead ends: 81990 [2019-10-02 13:13:44,596 INFO L226 Difference]: Without dead ends: 44441 [2019-10-02 13:13:44,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:13:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44441 states. [2019-10-02 13:13:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44441 to 44376. [2019-10-02 13:13:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44376 states. [2019-10-02 13:13:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44376 states to 44376 states and 72498 transitions. [2019-10-02 13:13:46,394 INFO L78 Accepts]: Start accepts. Automaton has 44376 states and 72498 transitions. Word has length 257 [2019-10-02 13:13:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:46,395 INFO L475 AbstractCegarLoop]: Abstraction has 44376 states and 72498 transitions. [2019-10-02 13:13:46,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:13:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44376 states and 72498 transitions. [2019-10-02 13:13:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 13:13:46,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:46,419 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:46,419 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 177842814, now seen corresponding path program 1 times [2019-10-02 13:13:46,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:46,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:13:46,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:46,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:13:46,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:13:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:13:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:13:46,645 INFO L87 Difference]: Start difference. First operand 44376 states and 72498 transitions. Second operand 8 states. [2019-10-02 13:13:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:57,833 INFO L93 Difference]: Finished difference Result 167067 states and 305192 transitions. [2019-10-02 13:13:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:13:57,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 288 [2019-10-02 13:13:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:58,401 INFO L225 Difference]: With dead ends: 167067 [2019-10-02 13:13:58,401 INFO L226 Difference]: Without dead ends: 127734 [2019-10-02 13:13:58,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:13:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127734 states. [2019-10-02 13:14:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127734 to 127528. [2019-10-02 13:14:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127528 states. [2019-10-02 13:14:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127528 states to 127528 states and 224306 transitions. [2019-10-02 13:14:06,609 INFO L78 Accepts]: Start accepts. Automaton has 127528 states and 224306 transitions. Word has length 288 [2019-10-02 13:14:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:06,609 INFO L475 AbstractCegarLoop]: Abstraction has 127528 states and 224306 transitions. [2019-10-02 13:14:06,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:14:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 127528 states and 224306 transitions. [2019-10-02 13:14:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 13:14:06,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:06,672 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:06,672 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash 185718620, now seen corresponding path program 1 times [2019-10-02 13:14:06,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:06,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:07,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:07,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:14:07,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:14:07,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:14:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:14:07,156 INFO L87 Difference]: Start difference. First operand 127528 states and 224306 transitions. Second operand 24 states. [2019-10-02 13:14:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:14,789 INFO L93 Difference]: Finished difference Result 237403 states and 415749 transitions. [2019-10-02 13:14:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:14:14,789 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 289 [2019-10-02 13:14:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:15,249 INFO L225 Difference]: With dead ends: 237403 [2019-10-02 13:14:15,249 INFO L226 Difference]: Without dead ends: 117974 [2019-10-02 13:14:15,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:14:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117974 states. [2019-10-02 13:14:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117974 to 116401. [2019-10-02 13:14:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116401 states. [2019-10-02 13:14:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116401 states to 116401 states and 197079 transitions. [2019-10-02 13:14:25,303 INFO L78 Accepts]: Start accepts. Automaton has 116401 states and 197079 transitions. Word has length 289 [2019-10-02 13:14:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:25,304 INFO L475 AbstractCegarLoop]: Abstraction has 116401 states and 197079 transitions. [2019-10-02 13:14:25,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:14:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 116401 states and 197079 transitions. [2019-10-02 13:14:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:14:25,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:25,365 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:25,365 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1230589429, now seen corresponding path program 1 times [2019-10-02 13:14:25,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:25,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:25,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:25,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:25,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:25,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:14:25,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:14:25,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:14:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:14:25,571 INFO L87 Difference]: Start difference. First operand 116401 states and 197079 transitions. Second operand 8 states. [2019-10-02 13:14:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:37,515 INFO L93 Difference]: Finished difference Result 346226 states and 613671 transitions. [2019-10-02 13:14:37,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:14:37,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 298 [2019-10-02 13:14:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:38,552 INFO L225 Difference]: With dead ends: 346226 [2019-10-02 13:14:38,552 INFO L226 Difference]: Without dead ends: 237195 [2019-10-02 13:14:39,333 INFO L640 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-10-02 13:14:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237195 states. [2019-10-02 13:14:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237195 to 236632. [2019-10-02 13:14:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236632 states. [2019-10-02 13:14:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236632 states to 236632 states and 415182 transitions. [2019-10-02 13:14:55,882 INFO L78 Accepts]: Start accepts. Automaton has 236632 states and 415182 transitions. Word has length 298 [2019-10-02 13:14:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:55,882 INFO L475 AbstractCegarLoop]: Abstraction has 236632 states and 415182 transitions. [2019-10-02 13:14:55,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:14:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 236632 states and 415182 transitions. [2019-10-02 13:14:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 13:14:55,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:55,962 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:55,962 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:55,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1067521113, now seen corresponding path program 1 times [2019-10-02 13:14:55,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:55,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:55,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 13:14:56,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:14:56,220 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:14:56,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:57,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 3422 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:14:57,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:14:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:14:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:14:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-10-02 13:14:58,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:14:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:14:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:14:58,047 INFO L87 Difference]: Start difference. First operand 236632 states and 415182 transitions. Second operand 17 states. [2019-10-02 13:15:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:18,250 INFO L93 Difference]: Finished difference Result 473846 states and 881446 transitions. [2019-10-02 13:15:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:15:18,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2019-10-02 13:15:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:19,326 INFO L225 Difference]: With dead ends: 473846 [2019-10-02 13:15:19,327 INFO L226 Difference]: Without dead ends: 242069 [2019-10-02 13:15:19,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:15:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242069 states. [2019-10-02 13:15:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242069 to 236740. [2019-10-02 13:15:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236740 states. [2019-10-02 13:15:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236740 states to 236740 states and 415343 transitions. [2019-10-02 13:15:37,775 INFO L78 Accepts]: Start accepts. Automaton has 236740 states and 415343 transitions. Word has length 299 [2019-10-02 13:15:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:37,775 INFO L475 AbstractCegarLoop]: Abstraction has 236740 states and 415343 transitions. [2019-10-02 13:15:37,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:15:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 236740 states and 415343 transitions. [2019-10-02 13:15:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 13:15:37,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:37,857 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:37,857 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:37,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1418006694, now seen corresponding path program 1 times [2019-10-02 13:15:37,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:37,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:37,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:15:38,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:38,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:15:38,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:15:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:15:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:38,012 INFO L87 Difference]: Start difference. First operand 236740 states and 415343 transitions. Second operand 3 states. [2019-10-02 13:15:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:54,218 INFO L93 Difference]: Finished difference Result 476801 states and 836945 transitions. [2019-10-02 13:15:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:15:54,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-10-02 13:15:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:55,249 INFO L225 Difference]: With dead ends: 476801 [2019-10-02 13:15:55,249 INFO L226 Difference]: Without dead ends: 240214 [2019-10-02 13:15:55,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240214 states. [2019-10-02 13:16:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240214 to 240208. [2019-10-02 13:16:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240208 states. [2019-10-02 13:16:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240208 states to 240208 states and 421690 transitions. [2019-10-02 13:16:13,446 INFO L78 Accepts]: Start accepts. Automaton has 240208 states and 421690 transitions. Word has length 299 [2019-10-02 13:16:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:13,447 INFO L475 AbstractCegarLoop]: Abstraction has 240208 states and 421690 transitions. [2019-10-02 13:16:13,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:16:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 240208 states and 421690 transitions. [2019-10-02 13:16:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 13:16:13,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:13,541 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:13,541 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash 736895398, now seen corresponding path program 1 times [2019-10-02 13:16:13,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:13,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:13,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:13,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:16:14,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:16:14,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:16:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:16:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:14,894 INFO L87 Difference]: Start difference. First operand 240208 states and 421690 transitions. Second operand 3 states. [2019-10-02 13:16:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:32,879 INFO L93 Difference]: Finished difference Result 487265 states and 856238 transitions. [2019-10-02 13:16:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:16:32,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-02 13:16:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:33,843 INFO L225 Difference]: With dead ends: 487265 [2019-10-02 13:16:33,843 INFO L226 Difference]: Without dead ends: 247224 [2019-10-02 13:16:34,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247224 states. [2019-10-02 13:16:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247224 to 247218. [2019-10-02 13:16:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247218 states. [2019-10-02 13:16:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247218 states to 247218 states and 434555 transitions. [2019-10-02 13:16:52,097 INFO L78 Accepts]: Start accepts. Automaton has 247218 states and 434555 transitions. Word has length 307 [2019-10-02 13:16:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:52,098 INFO L475 AbstractCegarLoop]: Abstraction has 247218 states and 434555 transitions. [2019-10-02 13:16:52,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:16:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 247218 states and 434555 transitions. [2019-10-02 13:16:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 13:16:52,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:52,214 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:52,215 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:52,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1788520059, now seen corresponding path program 1 times [2019-10-02 13:16:52,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:52,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:52,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:16:52,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:52,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:16:52,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:16:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:16:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:52,365 INFO L87 Difference]: Start difference. First operand 247218 states and 434555 transitions. Second operand 3 states. [2019-10-02 13:17:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:17:09,966 INFO L93 Difference]: Finished difference Result 507327 states and 893288 transitions. [2019-10-02 13:17:09,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:17:09,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-10-02 13:17:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:17:11,062 INFO L225 Difference]: With dead ends: 507327 [2019-10-02 13:17:11,063 INFO L226 Difference]: Without dead ends: 260282 [2019-10-02 13:17:12,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:17:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260282 states. [2019-10-02 13:17:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260282 to 260276. [2019-10-02 13:17:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260276 states. [2019-10-02 13:17:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260276 states to 260276 states and 458556 transitions. [2019-10-02 13:17:26,872 INFO L78 Accepts]: Start accepts. Automaton has 260276 states and 458556 transitions. Word has length 308 [2019-10-02 13:17:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:17:26,873 INFO L475 AbstractCegarLoop]: Abstraction has 260276 states and 458556 transitions. [2019-10-02 13:17:26,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:17:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 260276 states and 458556 transitions. [2019-10-02 13:17:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 13:17:27,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:17:27,036 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:17:27,037 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:17:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:17:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -411957720, now seen corresponding path program 1 times [2019-10-02 13:17:27,037 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:17:27,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:17:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:27,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:17:27,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:17:27,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:17:27,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:17:27,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:17:27,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:17:27,188 INFO L87 Difference]: Start difference. First operand 260276 states and 458556 transitions. Second operand 3 states. [2019-10-02 13:17:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:17:44,449 INFO L93 Difference]: Finished difference Result 545341 states and 963362 transitions. [2019-10-02 13:17:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:17:44,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-10-02 13:17:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:17:45,568 INFO L225 Difference]: With dead ends: 545341 [2019-10-02 13:17:45,569 INFO L226 Difference]: Without dead ends: 285244 [2019-10-02 13:17:53,934 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:17:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285244 states. [2019-10-02 13:18:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285244 to 285238. [2019-10-02 13:18:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285238 states. [2019-10-02 13:18:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285238 states to 285238 states and 504253 transitions. [2019-10-02 13:18:08,942 INFO L78 Accepts]: Start accepts. Automaton has 285238 states and 504253 transitions. Word has length 309 [2019-10-02 13:18:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:18:08,943 INFO L475 AbstractCegarLoop]: Abstraction has 285238 states and 504253 transitions. [2019-10-02 13:18:08,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:18:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 285238 states and 504253 transitions. [2019-10-02 13:18:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:18:09,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:18:09,253 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:18:09,253 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:18:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:18:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1678786458, now seen corresponding path program 1 times [2019-10-02 13:18:09,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:18:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:18:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:09,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:18:09,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:18:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:18:10,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:18:10,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:18:10,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:18:10,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:18:10,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:10,846 INFO L87 Difference]: Start difference. First operand 285238 states and 504253 transitions. Second operand 3 states. [2019-10-02 13:18:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:18:32,606 INFO L93 Difference]: Finished difference Result 617920 states and 1093532 transitions. [2019-10-02 13:18:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:18:32,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-10-02 13:18:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:18:33,954 INFO L225 Difference]: With dead ends: 617920 [2019-10-02 13:18:33,954 INFO L226 Difference]: Without dead ends: 332872 [2019-10-02 13:18:34,538 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332872 states. [2019-10-02 13:19:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332872 to 332866. [2019-10-02 13:19:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332866 states. [2019-10-02 13:19:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332866 states to 332866 states and 587976 transitions. [2019-10-02 13:19:02,737 INFO L78 Accepts]: Start accepts. Automaton has 332866 states and 587976 transitions. Word has length 303 [2019-10-02 13:19:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:02,738 INFO L475 AbstractCegarLoop]: Abstraction has 332866 states and 587976 transitions. [2019-10-02 13:19:02,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 332866 states and 587976 transitions. [2019-10-02 13:19:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 13:19:03,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:03,208 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:03,209 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:03,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1710576088, now seen corresponding path program 1 times [2019-10-02 13:19:03,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:19:04,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:04,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:19:04,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:19:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:19:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:04,651 INFO L87 Difference]: Start difference. First operand 332866 states and 587976 transitions. Second operand 3 states. [2019-10-02 13:19:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:31,605 INFO L93 Difference]: Finished difference Result 756158 states and 1340054 transitions. [2019-10-02 13:19:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:19:31,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-02 13:19:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:34,168 INFO L225 Difference]: With dead ends: 756158 [2019-10-02 13:19:34,168 INFO L226 Difference]: Without dead ends: 423498 [2019-10-02 13:19:34,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423498 states. [2019-10-02 13:20:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423498 to 423492. [2019-10-02 13:20:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423492 states. [2019-10-02 13:20:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423492 states to 423492 states and 749257 transitions. [2019-10-02 13:20:11,706 INFO L78 Accepts]: Start accepts. Automaton has 423492 states and 749257 transitions. Word has length 311 [2019-10-02 13:20:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:11,707 INFO L475 AbstractCegarLoop]: Abstraction has 423492 states and 749257 transitions. [2019-10-02 13:20:11,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 423492 states and 749257 transitions. [2019-10-02 13:20:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 13:20:12,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:12,630 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:12,630 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -409035878, now seen corresponding path program 1 times [2019-10-02 13:20:12,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:12,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:12,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:12,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:20:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:12,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:12,798 INFO L87 Difference]: Start difference. First operand 423492 states and 749257 transitions. Second operand 3 states. [2019-10-02 13:20:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:46,977 INFO L93 Difference]: Finished difference Result 827283 states and 1453661 transitions. [2019-10-02 13:20:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:46,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-02 13:20:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:49,271 INFO L225 Difference]: With dead ends: 827283 [2019-10-02 13:20:49,271 INFO L226 Difference]: Without dead ends: 595506 [2019-10-02 13:20:49,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595506 states. [2019-10-02 13:21:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595506 to 595500. [2019-10-02 13:21:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595500 states. [2019-10-02 13:21:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595500 states to 595500 states and 1041066 transitions. [2019-10-02 13:21:50,885 INFO L78 Accepts]: Start accepts. Automaton has 595500 states and 1041066 transitions. Word has length 305 [2019-10-02 13:21:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:50,886 INFO L475 AbstractCegarLoop]: Abstraction has 595500 states and 1041066 transitions. [2019-10-02 13:21:50,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 595500 states and 1041066 transitions. [2019-10-02 13:21:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:21:54,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:54,442 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:54,442 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1933426216, now seen corresponding path program 1 times [2019-10-02 13:21:54,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:54,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:54,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:21:54,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:54,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:21:54,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:21:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:21:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:21:54,628 INFO L87 Difference]: Start difference. First operand 595500 states and 1041066 transitions. Second operand 5 states.