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_spec7_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:35:49,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:35:49,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:35:50,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:35:50,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:35:50,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:35:50,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:35:50,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:35:50,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:35:50,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:35:50,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:35:50,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:35:50,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:35:50,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:35:50,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:35:50,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:35:50,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:35:50,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:35:50,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:35:50,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:35:50,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:35:50,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:35:50,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:35:50,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:35:50,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:35:50,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:35:50,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:35:50,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:35:50,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:35:50,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:35:50,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:35:50,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:35:50,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:35:50,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:35:50,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:35:50,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:35:50,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:35:50,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:35:50,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:35:50,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:35:50,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:35:50,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:35:50,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:35:50,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:35:50,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:35:50,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:35:50,057 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:35:50,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:35:50,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:35:50,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:35:50,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:35:50,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:35:50,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:35:50,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:35:50,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:35:50,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:35:50,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:35:50,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:35:50,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:35:50,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:35:50,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:35:50,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:35:50,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:35:50,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:35:50,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:35:50,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:35:50,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:35:50,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:35:50,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:35:50,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:35:50,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:35:50,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:35:50,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:35:50,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:35:50,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:35:50,107 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:35:50,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product29.cil.c [2019-09-08 05:35:50,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400f620a7/5b6e1e9c8a5c45c281835b8165e67f4e/FLAG4085bc1fd [2019-09-08 05:35:50,788 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:35:50,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product29.cil.c [2019-09-08 05:35:50,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400f620a7/5b6e1e9c8a5c45c281835b8165e67f4e/FLAG4085bc1fd [2019-09-08 05:35:51,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400f620a7/5b6e1e9c8a5c45c281835b8165e67f4e [2019-09-08 05:35:51,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:35:51,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:35:51,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:35:51,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:35:51,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:35:51,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:35:51" (1/1) ... [2019-09-08 05:35:51,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337e66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:51, skipping insertion in model container [2019-09-08 05:35:51,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:35:51" (1/1) ... [2019-09-08 05:35:51,048 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:35:51,129 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:35:51,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:35:51,881 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:35:52,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:35:52,123 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:35:52,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52 WrapperNode [2019-09-08 05:35:52,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:35:52,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:35:52,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:35:52,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:35:52,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:35:52,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:35:52,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:35:52,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:35:52,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:35:52,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:35:52,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:35:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:35:52,454 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:35:52,455 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:35:52,455 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:35:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:35:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:35:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:35:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:35:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:35:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:35:52,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:35:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:35:52,460 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:35:52,460 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:35:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:35:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:35:52,464 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:35:52,465 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:35:52,465 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:35:52,465 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:35:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:35:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:35:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:35:52,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:35:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:35:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:35:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:35:52,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:35:52,469 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:35:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:35:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:35:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:35:52,470 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:35:52,471 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:35:52,471 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:35:52,471 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:35:52,472 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:35:52,472 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:35:52,472 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:35:52,472 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:35:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:35:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:35:52,474 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:35:52,474 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:35:52,474 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:35:52,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:35:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:35:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:35:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:35:52,475 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:35:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:35:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:35:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:35:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:35:52,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:35:52,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:35:52,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:35:52,477 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:35:52,478 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:35:52,478 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:35:52,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:35:52,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:35:52,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:35:52,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:35:52,480 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:35:52,480 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:35:52,481 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:35:52,481 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:35:52,481 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:35:52,482 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:35:52,482 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:35:52,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:35:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:35:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:35:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:35:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:35:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:35:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:35:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:35:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:35:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:35:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:35:52,487 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:35:52,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:35:52,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:35:52,488 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:35:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:35:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:35:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:35:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:35:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:35:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:35:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:35:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:35:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:35:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:35:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:35:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:35:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:35:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:35:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:35:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:35:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:35:52,495 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:35:52,495 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:35:52,495 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:35:52,495 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:35:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:35:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:35:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:35:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:35:52,498 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:35:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:35:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:35:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:35:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:35:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:35:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:35:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:35:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:35:52,501 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:35:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:35:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:35:52,502 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:35:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:35:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:35:52,508 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:35:52,509 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:35:52,509 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:35:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:35:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:35:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:35:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:35:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:35:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:35:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:35:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:35:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:35:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:35:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:35:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:35:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:35:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:35:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:35:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:35:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:35:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:35:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:35:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:35:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:35:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:35:52,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:35:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:35:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:35:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:35:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:35:52,525 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:35:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:35:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:35:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:35:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:35:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:35:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:35:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:35:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:35:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:35:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:35:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:35:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:35:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:35:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:35:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:35:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:35:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:35:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:35:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:35:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:35:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:35:52,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:35:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:35:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:35:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:35:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:35:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:35:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:35:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:35:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:35:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:35:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:35:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:35:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:35:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:35:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:35:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:35:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:35:52,537 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:35:52,537 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:35:52,537 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:35:52,537 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:35:52,538 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:35:52,538 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:35:52,538 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:35:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:35:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:35:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:35:52,539 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:35:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:35:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:35:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:35:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:35:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:35:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:35:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:35:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:35:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:35:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:35:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:35:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:35:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:35:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:35:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:35:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:35:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:35:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:35:52,544 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:35:52,545 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:35:52,545 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:35:52,545 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:35:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:35:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:35:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:35:54,965 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:35:54,966 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:35:54,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:35:54 BoogieIcfgContainer [2019-09-08 05:35:54,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:35:54,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:35:54,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:35:54,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:35:54,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:35:51" (1/3) ... [2019-09-08 05:35:54,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c43f8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:35:54, skipping insertion in model container [2019-09-08 05:35:54,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52" (2/3) ... [2019-09-08 05:35:54,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c43f8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:35:54, skipping insertion in model container [2019-09-08 05:35:54,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:35:54" (3/3) ... [2019-09-08 05:35:54,976 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product29.cil.c [2019-09-08 05:35:54,986 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:35:54,998 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:35:55,015 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:35:55,050 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:35:55,051 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:35:55,051 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:35:55,051 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:35:55,051 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:35:55,051 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:35:55,051 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:35:55,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:35:55,052 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:35:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-09-08 05:35:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:35:55,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:55,115 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:55,120 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2048915059, now seen corresponding path program 1 times [2019-09-08 05:35:55,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:55,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:55,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:35:55,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:55,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:35:55,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:35:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:35:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:35:55,826 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-09-08 05:35:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:55,960 INFO L93 Difference]: Finished difference Result 837 states and 1144 transitions. [2019-09-08 05:35:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:35:55,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-09-08 05:35:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:56,005 INFO L225 Difference]: With dead ends: 837 [2019-09-08 05:35:56,006 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 05:35:56,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:35:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 05:35:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-08 05:35:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 05:35:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 742 transitions. [2019-09-08 05:35:56,162 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 742 transitions. Word has length 191 [2019-09-08 05:35:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:56,164 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 742 transitions. [2019-09-08 05:35:56,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:35:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 742 transitions. [2019-09-08 05:35:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 05:35:56,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:56,172 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:56,173 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1030093926, now seen corresponding path program 1 times [2019-09-08 05:35:56,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:56,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:56,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:56,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:56,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:35:56,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:56,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:35:56,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:35:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:35:56,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:56,607 INFO L87 Difference]: Start difference. First operand 541 states and 742 transitions. Second operand 3 states. [2019-09-08 05:35:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:56,687 INFO L93 Difference]: Finished difference Result 820 states and 1106 transitions. [2019-09-08 05:35:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:35:56,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 05:35:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:56,696 INFO L225 Difference]: With dead ends: 820 [2019-09-08 05:35:56,696 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 05:35:56,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 05:35:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543. [2019-09-08 05:35:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-08 05:35:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 744 transitions. [2019-09-08 05:35:56,739 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 744 transitions. Word has length 192 [2019-09-08 05:35:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:56,740 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 744 transitions. [2019-09-08 05:35:56,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:35:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 744 transitions. [2019-09-08 05:35:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:35:56,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:56,748 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:56,748 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -369073018, now seen corresponding path program 1 times [2019-09-08 05:35:56,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:56,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:56,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:35:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:57,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:35:57,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:35:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:35:57,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:57,057 INFO L87 Difference]: Start difference. First operand 543 states and 744 transitions. Second operand 3 states. [2019-09-08 05:35:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:57,104 INFO L93 Difference]: Finished difference Result 1062 states and 1486 transitions. [2019-09-08 05:35:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:35:57,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 05:35:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:57,112 INFO L225 Difference]: With dead ends: 1062 [2019-09-08 05:35:57,112 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 05:35:57,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 05:35:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 583. [2019-09-08 05:35:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 05:35:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 813 transitions. [2019-09-08 05:35:57,149 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 813 transitions. Word has length 198 [2019-09-08 05:35:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:57,149 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 813 transitions. [2019-09-08 05:35:57,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:35:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 813 transitions. [2019-09-08 05:35:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 05:35:57,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:57,156 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:35:57,156 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -436885539, now seen corresponding path program 1 times [2019-09-08 05:35:57,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:57,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:57,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:35:57,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:57,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 05:35:57,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:35:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:35:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:35:57,678 INFO L87 Difference]: Start difference. First operand 583 states and 813 transitions. Second operand 19 states. [2019-09-08 05:36:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:03,603 INFO L93 Difference]: Finished difference Result 1984 states and 2786 transitions. [2019-09-08 05:36:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 05:36:03,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-09-08 05:36:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:03,621 INFO L225 Difference]: With dead ends: 1984 [2019-09-08 05:36:03,622 INFO L226 Difference]: Without dead ends: 1721 [2019-09-08 05:36:03,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 05:36:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-09-08 05:36:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1689. [2019-09-08 05:36:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-09-08 05:36:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2374 transitions. [2019-09-08 05:36:03,733 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2374 transitions. Word has length 199 [2019-09-08 05:36:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:03,734 INFO L475 AbstractCegarLoop]: Abstraction has 1689 states and 2374 transitions. [2019-09-08 05:36:03,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:36:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2374 transitions. [2019-09-08 05:36:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:36:03,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:03,741 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:03,742 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash 175793894, now seen corresponding path program 1 times [2019-09-08 05:36:03,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:03,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:03,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:03,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:03,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:03,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:03,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:03,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:03,923 INFO L87 Difference]: Start difference. First operand 1689 states and 2374 transitions. Second operand 5 states. [2019-09-08 05:36:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:04,011 INFO L93 Difference]: Finished difference Result 2524 states and 3490 transitions. [2019-09-08 05:36:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:04,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-09-08 05:36:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:04,020 INFO L225 Difference]: With dead ends: 2524 [2019-09-08 05:36:04,021 INFO L226 Difference]: Without dead ends: 1407 [2019-09-08 05:36:04,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-09-08 05:36:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2019-09-08 05:36:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2019-09-08 05:36:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1987 transitions. [2019-09-08 05:36:04,107 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1987 transitions. Word has length 202 [2019-09-08 05:36:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:04,109 INFO L475 AbstractCegarLoop]: Abstraction has 1407 states and 1987 transitions. [2019-09-08 05:36:04,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1987 transitions. [2019-09-08 05:36:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:04,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:04,115 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:04,115 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 603543550, now seen corresponding path program 1 times [2019-09-08 05:36:04,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:04,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:04,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:04,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:04,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:36:04,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:36:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:36:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:36:04,558 INFO L87 Difference]: Start difference. First operand 1407 states and 1987 transitions. Second operand 15 states. [2019-09-08 05:36:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:07,941 INFO L93 Difference]: Finished difference Result 2036 states and 2867 transitions. [2019-09-08 05:36:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:36:07,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2019-09-08 05:36:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:07,950 INFO L225 Difference]: With dead ends: 2036 [2019-09-08 05:36:07,950 INFO L226 Difference]: Without dead ends: 1473 [2019-09-08 05:36:07,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:36:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-09-08 05:36:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1443. [2019-09-08 05:36:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-09-08 05:36:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2046 transitions. [2019-09-08 05:36:08,015 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2046 transitions. Word has length 200 [2019-09-08 05:36:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:08,016 INFO L475 AbstractCegarLoop]: Abstraction has 1443 states and 2046 transitions. [2019-09-08 05:36:08,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:36:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2046 transitions. [2019-09-08 05:36:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:08,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:08,022 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:08,022 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:08,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1383640434, now seen corresponding path program 1 times [2019-09-08 05:36:08,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:08,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:08,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:08,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:08,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:08,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:08,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:36:08,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:36:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:36:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:36:08,390 INFO L87 Difference]: Start difference. First operand 1443 states and 2046 transitions. Second operand 18 states. [2019-09-08 05:36:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:09,076 INFO L93 Difference]: Finished difference Result 2434 states and 3427 transitions. [2019-09-08 05:36:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:36:09,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2019-09-08 05:36:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:09,094 INFO L225 Difference]: With dead ends: 2434 [2019-09-08 05:36:09,094 INFO L226 Difference]: Without dead ends: 1561 [2019-09-08 05:36:09,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:36:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-09-08 05:36:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2019-09-08 05:36:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-09-08 05:36:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2218 transitions. [2019-09-08 05:36:09,241 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2218 transitions. Word has length 200 [2019-09-08 05:36:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:09,241 INFO L475 AbstractCegarLoop]: Abstraction has 1561 states and 2218 transitions. [2019-09-08 05:36:09,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:36:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2218 transitions. [2019-09-08 05:36:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:09,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:09,248 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:09,248 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1967915888, now seen corresponding path program 1 times [2019-09-08 05:36:09,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:09,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:09,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:09,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:09,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:09,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:09,451 INFO L87 Difference]: Start difference. First operand 1561 states and 2218 transitions. Second operand 5 states. [2019-09-08 05:36:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:10,798 INFO L93 Difference]: Finished difference Result 4105 states and 5854 transitions. [2019-09-08 05:36:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:36:10,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-09-08 05:36:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:10,826 INFO L225 Difference]: With dead ends: 4105 [2019-09-08 05:36:10,827 INFO L226 Difference]: Without dead ends: 3450 [2019-09-08 05:36:10,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-09-08 05:36:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3432. [2019-09-08 05:36:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2019-09-08 05:36:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4894 transitions. [2019-09-08 05:36:11,005 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4894 transitions. Word has length 200 [2019-09-08 05:36:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:11,006 INFO L475 AbstractCegarLoop]: Abstraction has 3432 states and 4894 transitions. [2019-09-08 05:36:11,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4894 transitions. [2019-09-08 05:36:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:36:11,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:11,015 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:11,015 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1947578513, now seen corresponding path program 1 times [2019-09-08 05:36:11,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:11,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:11,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:11,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:11,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:11,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:11,325 INFO L87 Difference]: Start difference. First operand 3432 states and 4894 transitions. Second operand 7 states. [2019-09-08 05:36:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:13,518 INFO L93 Difference]: Finished difference Result 11201 states and 16975 transitions. [2019-09-08 05:36:13,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:13,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-09-08 05:36:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:13,581 INFO L225 Difference]: With dead ends: 11201 [2019-09-08 05:36:13,581 INFO L226 Difference]: Without dead ends: 8654 [2019-09-08 05:36:13,600 INFO L628 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-09-08 05:36:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2019-09-08 05:36:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 8644. [2019-09-08 05:36:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2019-09-08 05:36:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 12956 transitions. [2019-09-08 05:36:14,141 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 12956 transitions. Word has length 200 [2019-09-08 05:36:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:14,143 INFO L475 AbstractCegarLoop]: Abstraction has 8644 states and 12956 transitions. [2019-09-08 05:36:14,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:36:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 12956 transitions. [2019-09-08 05:36:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:36:14,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:14,152 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:14,152 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash 212373713, now seen corresponding path program 1 times [2019-09-08 05:36:14,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:14,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:14,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:14,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:14,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:14,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 05:36:14,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 05:36:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 05:36:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:36:14,806 INFO L87 Difference]: Start difference. First operand 8644 states and 12956 transitions. Second operand 28 states. [2019-09-08 05:36:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:16,148 INFO L93 Difference]: Finished difference Result 16748 states and 25652 transitions. [2019-09-08 05:36:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:36:16,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2019-09-08 05:36:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:16,213 INFO L225 Difference]: With dead ends: 16748 [2019-09-08 05:36:16,213 INFO L226 Difference]: Without dead ends: 8989 [2019-09-08 05:36:16,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:36:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2019-09-08 05:36:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8972. [2019-09-08 05:36:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8972 states. [2019-09-08 05:36:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 13455 transitions. [2019-09-08 05:36:16,676 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 13455 transitions. Word has length 201 [2019-09-08 05:36:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:16,677 INFO L475 AbstractCegarLoop]: Abstraction has 8972 states and 13455 transitions. [2019-09-08 05:36:16,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 05:36:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 13455 transitions. [2019-09-08 05:36:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 05:36:16,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:16,686 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:16,686 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:16,686 INFO L82 PathProgramCache]: Analyzing trace with hash -469886620, now seen corresponding path program 1 times [2019-09-08 05:36:16,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:16,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:16,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:16,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:36:16,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:36:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:36:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:36:16,935 INFO L87 Difference]: Start difference. First operand 8972 states and 13455 transitions. Second operand 10 states. [2019-09-08 05:36:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:17,165 INFO L93 Difference]: Finished difference Result 9071 states and 13617 transitions. [2019-09-08 05:36:17,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:36:17,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2019-09-08 05:36:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:17,226 INFO L225 Difference]: With dead ends: 9071 [2019-09-08 05:36:17,226 INFO L226 Difference]: Without dead ends: 9068 [2019-09-08 05:36:17,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:36:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9068 states. [2019-09-08 05:36:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9068 to 9068. [2019-09-08 05:36:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9068 states. [2019-09-08 05:36:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9068 states to 9068 states and 13583 transitions. [2019-09-08 05:36:17,735 INFO L78 Accepts]: Start accepts. Automaton has 9068 states and 13583 transitions. Word has length 205 [2019-09-08 05:36:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:17,736 INFO L475 AbstractCegarLoop]: Abstraction has 9068 states and 13583 transitions. [2019-09-08 05:36:17,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:36:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 9068 states and 13583 transitions. [2019-09-08 05:36:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:36:17,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:17,746 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:17,746 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash -208674281, now seen corresponding path program 1 times [2019-09-08 05:36:17,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:17,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:17,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:17,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:17,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:17,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:17,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:17,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:17,886 INFO L87 Difference]: Start difference. First operand 9068 states and 13583 transitions. Second operand 5 states. [2019-09-08 05:36:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:18,101 INFO L93 Difference]: Finished difference Result 17532 states and 26627 transitions. [2019-09-08 05:36:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:18,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 05:36:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:18,147 INFO L225 Difference]: With dead ends: 17532 [2019-09-08 05:36:18,148 INFO L226 Difference]: Without dead ends: 9397 [2019-09-08 05:36:18,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9397 states. [2019-09-08 05:36:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9397 to 9234. [2019-09-08 05:36:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-09-08 05:36:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 13823 transitions. [2019-09-08 05:36:18,813 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 13823 transitions. Word has length 210 [2019-09-08 05:36:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:18,814 INFO L475 AbstractCegarLoop]: Abstraction has 9234 states and 13823 transitions. [2019-09-08 05:36:18,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 13823 transitions. [2019-09-08 05:36:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:36:18,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:18,823 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:18,823 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash 952522831, now seen corresponding path program 1 times [2019-09-08 05:36:18,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:18,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:18,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:18,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:19,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:19,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:36:19,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:36:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:36:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:19,069 INFO L87 Difference]: Start difference. First operand 9234 states and 13823 transitions. Second operand 13 states. [2019-09-08 05:36:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:19,777 INFO L93 Difference]: Finished difference Result 17539 states and 26237 transitions. [2019-09-08 05:36:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:19,778 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 210 [2019-09-08 05:36:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:19,821 INFO L225 Difference]: With dead ends: 17539 [2019-09-08 05:36:19,822 INFO L226 Difference]: Without dead ends: 9238 [2019-09-08 05:36:19,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:36:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2019-09-08 05:36:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 9206. [2019-09-08 05:36:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9206 states. [2019-09-08 05:36:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9206 states to 9206 states and 13770 transitions. [2019-09-08 05:36:20,280 INFO L78 Accepts]: Start accepts. Automaton has 9206 states and 13770 transitions. Word has length 210 [2019-09-08 05:36:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:20,281 INFO L475 AbstractCegarLoop]: Abstraction has 9206 states and 13770 transitions. [2019-09-08 05:36:20,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:36:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9206 states and 13770 transitions. [2019-09-08 05:36:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:36:20,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:20,288 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:20,289 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -438718559, now seen corresponding path program 1 times [2019-09-08 05:36:20,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:21,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:21,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:36:21,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:36:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:36:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:21,096 INFO L87 Difference]: Start difference. First operand 9206 states and 13770 transitions. Second operand 6 states. [2019-09-08 05:36:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:22,013 INFO L93 Difference]: Finished difference Result 26844 states and 40607 transitions. [2019-09-08 05:36:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:36:22,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-08 05:36:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:22,104 INFO L225 Difference]: With dead ends: 26844 [2019-09-08 05:36:22,104 INFO L226 Difference]: Without dead ends: 18541 [2019-09-08 05:36:22,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:36:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18541 states. [2019-09-08 05:36:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18541 to 18189. [2019-09-08 05:36:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18189 states. [2019-09-08 05:36:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18189 states to 18189 states and 27203 transitions. [2019-09-08 05:36:22,992 INFO L78 Accepts]: Start accepts. Automaton has 18189 states and 27203 transitions. Word has length 211 [2019-09-08 05:36:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:22,993 INFO L475 AbstractCegarLoop]: Abstraction has 18189 states and 27203 transitions. [2019-09-08 05:36:22,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:36:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18189 states and 27203 transitions. [2019-09-08 05:36:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 05:36:23,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:23,010 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:23,010 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1807527184, now seen corresponding path program 1 times [2019-09-08 05:36:23,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:23,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:36:23,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:23,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:36:23,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:36:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:36:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:36:23,179 INFO L87 Difference]: Start difference. First operand 18189 states and 27203 transitions. Second operand 8 states. [2019-09-08 05:36:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:25,112 INFO L93 Difference]: Finished difference Result 54354 states and 83430 transitions. [2019-09-08 05:36:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:36:25,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-08 05:36:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:25,275 INFO L225 Difference]: With dead ends: 54354 [2019-09-08 05:36:25,276 INFO L226 Difference]: Without dead ends: 37786 [2019-09-08 05:36:25,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37786 states. [2019-09-08 05:36:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37786 to 37635. [2019-09-08 05:36:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37635 states. [2019-09-08 05:36:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37635 states to 37635 states and 56799 transitions. [2019-09-08 05:36:27,955 INFO L78 Accepts]: Start accepts. Automaton has 37635 states and 56799 transitions. Word has length 230 [2019-09-08 05:36:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:27,956 INFO L475 AbstractCegarLoop]: Abstraction has 37635 states and 56799 transitions. [2019-09-08 05:36:27,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:36:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37635 states and 56799 transitions. [2019-09-08 05:36:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 05:36:27,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:27,993 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:27,994 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash 879585434, now seen corresponding path program 1 times [2019-09-08 05:36:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:36:28,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:28,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:36:28,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:36:28,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:36:28,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:36:28,231 INFO L87 Difference]: Start difference. First operand 37635 states and 56799 transitions. Second operand 15 states. [2019-09-08 05:36:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:32,304 INFO L93 Difference]: Finished difference Result 64029 states and 98108 transitions. [2019-09-08 05:36:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:36:32,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2019-09-08 05:36:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:32,479 INFO L225 Difference]: With dead ends: 64029 [2019-09-08 05:36:32,479 INFO L226 Difference]: Without dead ends: 37770 [2019-09-08 05:36:32,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:36:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37770 states. [2019-09-08 05:36:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37770 to 36828. [2019-09-08 05:36:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36828 states. [2019-09-08 05:36:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36828 states to 36828 states and 55115 transitions. [2019-09-08 05:36:34,060 INFO L78 Accepts]: Start accepts. Automaton has 36828 states and 55115 transitions. Word has length 231 [2019-09-08 05:36:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:34,061 INFO L475 AbstractCegarLoop]: Abstraction has 36828 states and 55115 transitions. [2019-09-08 05:36:34,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:36:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 36828 states and 55115 transitions. [2019-09-08 05:36:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 05:36:34,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:34,090 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:34,090 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1955624845, now seen corresponding path program 1 times [2019-09-08 05:36:34,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:34,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:36:34,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:34,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:34,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:34,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:34,310 INFO L87 Difference]: Start difference. First operand 36828 states and 55115 transitions. Second operand 7 states. [2019-09-08 05:36:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:41,263 INFO L93 Difference]: Finished difference Result 108610 states and 164982 transitions. [2019-09-08 05:36:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:36:41,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-09-08 05:36:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:41,582 INFO L225 Difference]: With dead ends: 108610 [2019-09-08 05:36:41,582 INFO L226 Difference]: Without dead ends: 75236 [2019-09-08 05:36:41,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75236 states. [2019-09-08 05:36:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75236 to 73625. [2019-09-08 05:36:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73625 states. [2019-09-08 05:36:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73625 states to 73625 states and 109932 transitions. [2019-09-08 05:36:46,017 INFO L78 Accepts]: Start accepts. Automaton has 73625 states and 109932 transitions. Word has length 231 [2019-09-08 05:36:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:46,017 INFO L475 AbstractCegarLoop]: Abstraction has 73625 states and 109932 transitions. [2019-09-08 05:36:46,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:36:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 73625 states and 109932 transitions. [2019-09-08 05:36:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 05:36:46,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:46,053 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:46,053 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1155224183, now seen corresponding path program 2 times [2019-09-08 05:36:46,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:36:46,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:36:46,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:36:46,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:36:46,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:36:46,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:36:46,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:36:46,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:36:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:36:47,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:36:47,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:36:47,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:36:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:36:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:36:47,195 INFO L87 Difference]: Start difference. First operand 73625 states and 109932 transitions. Second operand 18 states. [2019-09-08 05:36:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:51,778 INFO L93 Difference]: Finished difference Result 147894 states and 221014 transitions. [2019-09-08 05:36:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:36:51,779 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2019-09-08 05:36:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:52,279 INFO L225 Difference]: With dead ends: 147894 [2019-09-08 05:36:52,279 INFO L226 Difference]: Without dead ends: 74321 [2019-09-08 05:36:52,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:36:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74321 states. [2019-09-08 05:36:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74321 to 73903. [2019-09-08 05:36:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73903 states. [2019-09-08 05:37:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73903 states to 73903 states and 110304 transitions. [2019-09-08 05:37:00,090 INFO L78 Accepts]: Start accepts. Automaton has 73903 states and 110304 transitions. Word has length 231 [2019-09-08 05:37:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:00,091 INFO L475 AbstractCegarLoop]: Abstraction has 73903 states and 110304 transitions. [2019-09-08 05:37:00,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:37:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 73903 states and 110304 transitions. [2019-09-08 05:37:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:37:00,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:00,200 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:00,201 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1879472735, now seen corresponding path program 1 times [2019-09-08 05:37:00,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:00,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:00,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:37:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:37:00,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:37:00,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:37:00,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:01,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:37:01,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:37:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 05:37:01,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:37:01,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:37:01,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:37:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:37:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:37:01,334 INFO L87 Difference]: Start difference. First operand 73903 states and 110304 transitions. Second operand 12 states. [2019-09-08 05:37:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:05,125 INFO L93 Difference]: Finished difference Result 144545 states and 215020 transitions. [2019-09-08 05:37:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:37:05,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 233 [2019-09-08 05:37:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:05,450 INFO L225 Difference]: With dead ends: 144545 [2019-09-08 05:37:05,450 INFO L226 Difference]: Without dead ends: 70689 [2019-09-08 05:37:05,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:37:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70689 states. [2019-09-08 05:37:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70689 to 70633. [2019-09-08 05:37:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70633 states. [2019-09-08 05:37:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70633 states to 70633 states and 104672 transitions. [2019-09-08 05:37:11,372 INFO L78 Accepts]: Start accepts. Automaton has 70633 states and 104672 transitions. Word has length 233 [2019-09-08 05:37:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:11,373 INFO L475 AbstractCegarLoop]: Abstraction has 70633 states and 104672 transitions. [2019-09-08 05:37:11,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:37:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 70633 states and 104672 transitions. [2019-09-08 05:37:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:37:11,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:11,423 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:11,423 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1954791539, now seen corresponding path program 2 times [2019-09-08 05:37:11,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:37:11,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:37:11,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:37:11,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:37:12,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:37:12,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:37:12,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:37:12,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:37:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 05:37:12,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:37:12,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 05:37:12,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:37:12,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:37:12,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:37:12,264 INFO L87 Difference]: Start difference. First operand 70633 states and 104672 transitions. Second operand 11 states. [2019-09-08 05:37:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:16,554 INFO L93 Difference]: Finished difference Result 161823 states and 242030 transitions. [2019-09-08 05:37:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:37:16,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-09-08 05:37:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:16,891 INFO L225 Difference]: With dead ends: 161823 [2019-09-08 05:37:16,891 INFO L226 Difference]: Without dead ends: 91235 [2019-09-08 05:37:17,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:37:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91235 states. [2019-09-08 05:37:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91235 to 89191. [2019-09-08 05:37:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89191 states. [2019-09-08 05:37:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89191 states to 89191 states and 129945 transitions. [2019-09-08 05:37:20,373 INFO L78 Accepts]: Start accepts. Automaton has 89191 states and 129945 transitions. Word has length 233 [2019-09-08 05:37:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:20,374 INFO L475 AbstractCegarLoop]: Abstraction has 89191 states and 129945 transitions. [2019-09-08 05:37:20,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:37:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 89191 states and 129945 transitions. [2019-09-08 05:37:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 05:37:20,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:20,405 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:20,406 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1729345146, now seen corresponding path program 1 times [2019-09-08 05:37:20,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:20,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:20,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:20,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:37:20,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 05:37:20,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:20,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:37:20,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:37:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:37:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:37:20,539 INFO L87 Difference]: Start difference. First operand 89191 states and 129945 transitions. Second operand 3 states. [2019-09-08 05:37:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:23,129 INFO L93 Difference]: Finished difference Result 179249 states and 261734 transitions. [2019-09-08 05:37:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:37:23,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 05:37:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:23,469 INFO L225 Difference]: With dead ends: 179249 [2019-09-08 05:37:23,469 INFO L226 Difference]: Without dead ends: 90175 [2019-09-08 05:37:23,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:37:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90175 states. [2019-09-08 05:37:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90175 to 90163. [2019-09-08 05:37:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90163 states. [2019-09-08 05:37:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90163 states to 90163 states and 131889 transitions. [2019-09-08 05:37:29,871 INFO L78 Accepts]: Start accepts. Automaton has 90163 states and 131889 transitions. Word has length 260 [2019-09-08 05:37:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 90163 states and 131889 transitions. [2019-09-08 05:37:29,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:37:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 90163 states and 131889 transitions. [2019-09-08 05:37:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 05:37:29,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:29,906 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:29,906 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:29,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1793203041, now seen corresponding path program 1 times [2019-09-08 05:37:29,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:29,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:37:30,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:30,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:37:30,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:37:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:37:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:37:30,031 INFO L87 Difference]: Start difference. First operand 90163 states and 131889 transitions. Second operand 3 states. [2019-09-08 05:37:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:32,537 INFO L93 Difference]: Finished difference Result 182045 states and 267326 transitions. [2019-09-08 05:37:32,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:37:32,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-08 05:37:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:32,894 INFO L225 Difference]: With dead ends: 182045 [2019-09-08 05:37:32,894 INFO L226 Difference]: Without dead ends: 91999 [2019-09-08 05:37:33,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:37:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91999 states. [2019-09-08 05:37:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91999 to 91987. [2019-09-08 05:37:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91987 states. [2019-09-08 05:37:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91987 states to 91987 states and 135513 transitions. [2019-09-08 05:37:39,750 INFO L78 Accepts]: Start accepts. Automaton has 91987 states and 135513 transitions. Word has length 248 [2019-09-08 05:37:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:39,750 INFO L475 AbstractCegarLoop]: Abstraction has 91987 states and 135513 transitions. [2019-09-08 05:37:39,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:37:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91987 states and 135513 transitions. [2019-09-08 05:37:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:37:39,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:39,781 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:39,781 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1741763479, now seen corresponding path program 1 times [2019-09-08 05:37:39,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:39,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:39,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 05:37:39,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:39,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:37:39,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:37:39,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:37:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:37:39,927 INFO L87 Difference]: Start difference. First operand 91987 states and 135513 transitions. Second operand 6 states. [2019-09-08 05:37:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:42,601 INFO L93 Difference]: Finished difference Result 183869 states and 270902 transitions. [2019-09-08 05:37:42,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:37:42,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-08 05:37:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:43,041 INFO L225 Difference]: With dead ends: 183869 [2019-09-08 05:37:43,041 INFO L226 Difference]: Without dead ends: 91999 [2019-09-08 05:37:43,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:37:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91999 states. [2019-09-08 05:37:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91999 to 91987. [2019-09-08 05:37:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91987 states. [2019-09-08 05:37:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91987 states to 91987 states and 135465 transitions. [2019-09-08 05:37:50,120 INFO L78 Accepts]: Start accepts. Automaton has 91987 states and 135465 transitions. Word has length 263 [2019-09-08 05:37:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:50,120 INFO L475 AbstractCegarLoop]: Abstraction has 91987 states and 135465 transitions. [2019-09-08 05:37:50,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:37:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 91987 states and 135465 transitions. [2019-09-08 05:37:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 05:37:50,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:50,147 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:50,147 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash -900893680, now seen corresponding path program 1 times [2019-09-08 05:37:50,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:50,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:50,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:37:50,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:50,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:37:50,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:37:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:37:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:50,323 INFO L87 Difference]: Start difference. First operand 91987 states and 135465 transitions. Second operand 8 states. [2019-09-08 05:38:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:01,614 INFO L93 Difference]: Finished difference Result 277215 states and 413875 transitions. [2019-09-08 05:38:01,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:38:01,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-09-08 05:38:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:02,295 INFO L225 Difference]: With dead ends: 277215 [2019-09-08 05:38:02,295 INFO L226 Difference]: Without dead ends: 185345 [2019-09-08 05:38:02,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:38:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185345 states. [2019-09-08 05:38:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185345 to 113948. [2019-09-08 05:38:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113948 states. [2019-09-08 05:38:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113948 states to 113948 states and 172017 transitions. [2019-09-08 05:38:13,168 INFO L78 Accepts]: Start accepts. Automaton has 113948 states and 172017 transitions. Word has length 243 [2019-09-08 05:38:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:13,168 INFO L475 AbstractCegarLoop]: Abstraction has 113948 states and 172017 transitions. [2019-09-08 05:38:13,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:38:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 113948 states and 172017 transitions. [2019-09-08 05:38:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:38:13,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:13,237 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:13,237 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -21541281, now seen corresponding path program 1 times [2019-09-08 05:38:13,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:13,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:38:13,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:13,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:38:13,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:38:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:38:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:38:13,425 INFO L87 Difference]: Start difference. First operand 113948 states and 172017 transitions. Second operand 8 states. [2019-09-08 05:38:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:25,853 INFO L93 Difference]: Finished difference Result 344706 states and 531619 transitions. [2019-09-08 05:38:25,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:38:25,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-09-08 05:38:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:26,757 INFO L225 Difference]: With dead ends: 344706 [2019-09-08 05:38:26,758 INFO L226 Difference]: Without dead ends: 230875 [2019-09-08 05:38:28,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:38:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230875 states. [2019-09-08 05:38:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230875 to 147791. [2019-09-08 05:38:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147791 states. [2019-09-08 05:38:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147791 states to 147791 states and 233073 transitions. [2019-09-08 05:38:41,407 INFO L78 Accepts]: Start accepts. Automaton has 147791 states and 233073 transitions. Word has length 250 [2019-09-08 05:38:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:41,408 INFO L475 AbstractCegarLoop]: Abstraction has 147791 states and 233073 transitions. [2019-09-08 05:38:41,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:38:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 147791 states and 233073 transitions. [2019-09-08 05:38:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 05:38:41,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:41,556 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:41,556 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:41,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1588176454, now seen corresponding path program 1 times [2019-09-08 05:38:41,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:41,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:41,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:38:41,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:41,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:38:41,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:38:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:38:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:41,684 INFO L87 Difference]: Start difference. First operand 147791 states and 233073 transitions. Second operand 3 states. [2019-09-08 05:38:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:51,539 INFO L93 Difference]: Finished difference Result 309498 states and 501547 transitions. [2019-09-08 05:38:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:38:51,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 05:38:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:52,142 INFO L225 Difference]: With dead ends: 309498 [2019-09-08 05:38:52,143 INFO L226 Difference]: Without dead ends: 161824 [2019-09-08 05:38:52,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161824 states. [2019-09-08 05:38:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161824 to 142302. [2019-09-08 05:38:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142302 states. [2019-09-08 05:38:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142302 states to 142302 states and 240585 transitions. [2019-09-08 05:38:59,882 INFO L78 Accepts]: Start accepts. Automaton has 142302 states and 240585 transitions. Word has length 246 [2019-09-08 05:38:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:59,882 INFO L475 AbstractCegarLoop]: Abstraction has 142302 states and 240585 transitions. [2019-09-08 05:38:59,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:38:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 142302 states and 240585 transitions. [2019-09-08 05:39:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:39:00,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:00,139 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:00,139 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 476280556, now seen corresponding path program 1 times [2019-09-08 05:39:00,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:00,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:39:00,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:00,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:39:00,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:39:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:39:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:39:00,307 INFO L87 Difference]: Start difference. First operand 142302 states and 240585 transitions. Second operand 8 states. [2019-09-08 05:39:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:22,607 INFO L93 Difference]: Finished difference Result 432720 states and 769495 transitions. [2019-09-08 05:39:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:39:22,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-09-08 05:39:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:24,277 INFO L225 Difference]: With dead ends: 432720 [2019-09-08 05:39:24,278 INFO L226 Difference]: Without dead ends: 290535 [2019-09-08 05:39:24,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:39:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290535 states. [2019-09-08 05:39:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290535 to 215322. [2019-09-08 05:39:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215322 states. [2019-09-08 05:39:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215322 states to 215322 states and 399477 transitions. [2019-09-08 05:39:44,605 INFO L78 Accepts]: Start accepts. Automaton has 215322 states and 399477 transitions. Word has length 245 [2019-09-08 05:39:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:44,605 INFO L475 AbstractCegarLoop]: Abstraction has 215322 states and 399477 transitions. [2019-09-08 05:39:44,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:39:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 215322 states and 399477 transitions. [2019-09-08 05:39:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-08 05:39:45,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:45,144 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:45,144 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1779511359, now seen corresponding path program 1 times [2019-09-08 05:39:45,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:45,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:45,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:45,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:45,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:39:45,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:45,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:39:45,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:39:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:39:45,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:39:45,305 INFO L87 Difference]: Start difference. First operand 215322 states and 399477 transitions. Second operand 6 states. [2019-09-08 05:40:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:03,563 INFO L93 Difference]: Finished difference Result 430887 states and 827942 transitions. [2019-09-08 05:40:03,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:40:03,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 270 [2019-09-08 05:40:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:04,907 INFO L225 Difference]: With dead ends: 430887 [2019-09-08 05:40:04,908 INFO L226 Difference]: Without dead ends: 215682 [2019-09-08 05:40:05,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:40:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215682 states. [2019-09-08 05:40:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215682 to 200767. [2019-09-08 05:40:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200767 states. [2019-09-08 05:40:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200767 states to 200767 states and 350883 transitions. [2019-09-08 05:40:22,977 INFO L78 Accepts]: Start accepts. Automaton has 200767 states and 350883 transitions. Word has length 270 [2019-09-08 05:40:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:22,977 INFO L475 AbstractCegarLoop]: Abstraction has 200767 states and 350883 transitions. [2019-09-08 05:40:22,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:40:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 200767 states and 350883 transitions. [2019-09-08 05:40:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 05:40:24,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:24,535 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:24,535 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2094602170, now seen corresponding path program 1 times [2019-09-08 05:40:24,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:24,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:24,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:24,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:24,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:40:24,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:24,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:40:24,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:40:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:40:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:40:24,674 INFO L87 Difference]: Start difference. First operand 200767 states and 350883 transitions. Second operand 6 states. [2019-09-08 05:40:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:41,076 INFO L93 Difference]: Finished difference Result 401417 states and 706238 transitions. [2019-09-08 05:40:41,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:40:41,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-08 05:40:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:42,290 INFO L225 Difference]: With dead ends: 401417 [2019-09-08 05:40:42,290 INFO L226 Difference]: Without dead ends: 200767 [2019-09-08 05:40:42,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:40:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200767 states. [2019-09-08 05:40:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200767 to 200767. [2019-09-08 05:40:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200767 states. [2019-09-08 05:40:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200767 states to 200767 states and 345627 transitions. [2019-09-08 05:40:54,664 INFO L78 Accepts]: Start accepts. Automaton has 200767 states and 345627 transitions. Word has length 255 [2019-09-08 05:40:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:54,665 INFO L475 AbstractCegarLoop]: Abstraction has 200767 states and 345627 transitions. [2019-09-08 05:40:54,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:40:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 200767 states and 345627 transitions. [2019-09-08 05:40:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 05:40:55,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:55,103 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:55,103 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1771053647, now seen corresponding path program 1 times [2019-09-08 05:40:55,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:55,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:55,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:55,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:40:55,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:55,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:40:55,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:40:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:40:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:40:55,250 INFO L87 Difference]: Start difference. First operand 200767 states and 345627 transitions. Second operand 6 states. [2019-09-08 05:41:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:08,765 INFO L93 Difference]: Finished difference Result 371847 states and 621560 transitions. [2019-09-08 05:41:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:41:08,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2019-09-08 05:41:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:09,462 INFO L225 Difference]: With dead ends: 371847 [2019-09-08 05:41:09,463 INFO L226 Difference]: Without dead ends: 200957 [2019-09-08 05:41:09,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:41:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200957 states. [2019-09-08 05:41:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200957 to 190586. [2019-09-08 05:41:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190586 states. [2019-09-08 05:41:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190586 states to 190586 states and 330934 transitions. [2019-09-08 05:41:30,684 INFO L78 Accepts]: Start accepts. Automaton has 190586 states and 330934 transitions. Word has length 269 [2019-09-08 05:41:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:30,685 INFO L475 AbstractCegarLoop]: Abstraction has 190586 states and 330934 transitions. [2019-09-08 05:41:30,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:41:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 190586 states and 330934 transitions. [2019-09-08 05:41:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 05:41:31,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:31,091 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:31,091 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1246969895, now seen corresponding path program 1 times [2019-09-08 05:41:31,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:31,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:41:32,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:32,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:41:32,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:41:32,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:41:32,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:41:32,351 INFO L87 Difference]: Start difference. First operand 190586 states and 330934 transitions. Second operand 6 states. [2019-09-08 05:41:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:41,424 INFO L93 Difference]: Finished difference Result 381415 states and 681640 transitions. [2019-09-08 05:41:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:41:41,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-09-08 05:41:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:42,257 INFO L225 Difference]: With dead ends: 381415 [2019-09-08 05:41:42,257 INFO L226 Difference]: Without dead ends: 190946 [2019-09-08 05:41:42,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:41:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190946 states. [2019-09-08 05:41:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190946 to 175993. [2019-09-08 05:41:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175993 states. [2019-09-08 05:41:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175993 states to 175993 states and 300892 transitions. [2019-09-08 05:41:59,483 INFO L78 Accepts]: Start accepts. Automaton has 175993 states and 300892 transitions. Word has length 254 [2019-09-08 05:41:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:59,484 INFO L475 AbstractCegarLoop]: Abstraction has 175993 states and 300892 transitions. [2019-09-08 05:41:59,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:41:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 175993 states and 300892 transitions. [2019-09-08 05:41:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 05:41:59,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:59,863 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:59,863 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash 428103414, now seen corresponding path program 1 times [2019-09-08 05:41:59,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:59,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:59,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:59,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:42:00,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:00,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:42:00,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:42:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:42:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:42:00,005 INFO L87 Difference]: Start difference. First operand 175993 states and 300892 transitions. Second operand 6 states. [2019-09-08 05:42:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:11,569 INFO L93 Difference]: Finished difference Result 351869 states and 604720 transitions. [2019-09-08 05:42:11,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:42:11,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-09-08 05:42:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:12,282 INFO L225 Difference]: With dead ends: 351869 [2019-09-08 05:42:12,282 INFO L226 Difference]: Without dead ends: 175993 [2019-09-08 05:42:20,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:42:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175993 states. [2019-09-08 05:42:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175993 to 175993. [2019-09-08 05:42:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175993 states. [2019-09-08 05:42:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175993 states to 175993 states and 298870 transitions. [2019-09-08 05:42:29,133 INFO L78 Accepts]: Start accepts. Automaton has 175993 states and 298870 transitions. Word has length 252 [2019-09-08 05:42:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:29,134 INFO L475 AbstractCegarLoop]: Abstraction has 175993 states and 298870 transitions. [2019-09-08 05:42:29,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:42:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 175993 states and 298870 transitions. [2019-09-08 05:42:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 05:42:29,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:29,523 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 05:42:29,523 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 80757213, now seen corresponding path program 1 times [2019-09-08 05:42:29,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:29,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 05:42:29,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:42:29,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:42:29,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:30,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 3224 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:42:31,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:42:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 05:42:31,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:42:31,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2019-09-08 05:42:31,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:42:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:42:31,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:42:31,129 INFO L87 Difference]: Start difference. First operand 175993 states and 298870 transitions. Second operand 11 states. [2019-09-08 05:42:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:47,640 INFO L93 Difference]: Finished difference Result 351906 states and 597646 transitions. [2019-09-08 05:42:47,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:42:47,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 278 [2019-09-08 05:42:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:48,307 INFO L225 Difference]: With dead ends: 351906 [2019-09-08 05:42:48,308 INFO L226 Difference]: Without dead ends: 175993 [2019-09-08 05:42:48,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:42:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175993 states. [2019-09-08 05:42:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175993 to 175993. [2019-09-08 05:42:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175993 states. [2019-09-08 05:42:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175993 states to 175993 states and 298869 transitions. [2019-09-08 05:42:57,658 INFO L78 Accepts]: Start accepts. Automaton has 175993 states and 298869 transitions. Word has length 278 [2019-09-08 05:42:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:57,659 INFO L475 AbstractCegarLoop]: Abstraction has 175993 states and 298869 transitions. [2019-09-08 05:42:57,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:42:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 175993 states and 298869 transitions. [2019-09-08 05:42:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:42:58,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:58,140 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:58,140 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash 345284106, now seen corresponding path program 1 times [2019-09-08 05:42:58,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:58,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 05:42:58,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:58,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:42:58,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:42:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:42:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:42:58,285 INFO L87 Difference]: Start difference. First operand 175993 states and 298869 transitions. Second operand 3 states. [2019-09-08 05:43:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:16,901 INFO L93 Difference]: Finished difference Result 405642 states and 712048 transitions. [2019-09-08 05:43:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:43:16,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-09-08 05:43:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:17,921 INFO L225 Difference]: With dead ends: 405642 [2019-09-08 05:43:17,921 INFO L226 Difference]: Without dead ends: 229766 [2019-09-08 05:43:18,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229766 states. [2019-09-08 05:43:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229766 to 229753. [2019-09-08 05:43:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229753 states. [2019-09-08 05:43:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229753 states to 229753 states and 411765 transitions. [2019-09-08 05:43:31,692 INFO L78 Accepts]: Start accepts. Automaton has 229753 states and 411765 transitions. Word has length 294 [2019-09-08 05:43:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:31,692 INFO L475 AbstractCegarLoop]: Abstraction has 229753 states and 411765 transitions. [2019-09-08 05:43:31,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:43:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 229753 states and 411765 transitions. [2019-09-08 05:43:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 05:43:32,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:32,362 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:32,362 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1009723489, now seen corresponding path program 1 times [2019-09-08 05:43:32,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:32,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:32,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:32,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 05:43:32,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:43:32,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:43:32,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:33,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 3154 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:43:33,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:43:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 05:43:33,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:43:33,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 05:43:33,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:43:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:43:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:43:33,434 INFO L87 Difference]: Start difference. First operand 229753 states and 411765 transitions. Second operand 17 states. [2019-09-08 05:44:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:12,669 INFO L93 Difference]: Finished difference Result 600703 states and 1119553 transitions. [2019-09-08 05:44:12,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 05:44:12,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 260 [2019-09-08 05:44:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:14,388 INFO L225 Difference]: With dead ends: 600703 [2019-09-08 05:44:14,389 INFO L226 Difference]: Without dead ends: 370736 [2019-09-08 05:44:15,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=302, Invalid=1768, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 05:44:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370736 states. [2019-09-08 05:44:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370736 to 369877. [2019-09-08 05:44:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369877 states. [2019-09-08 05:44:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369877 states to 369877 states and 706085 transitions. [2019-09-08 05:44:49,721 INFO L78 Accepts]: Start accepts. Automaton has 369877 states and 706085 transitions. Word has length 260 [2019-09-08 05:44:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:49,722 INFO L475 AbstractCegarLoop]: Abstraction has 369877 states and 706085 transitions. [2019-09-08 05:44:49,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:44:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 369877 states and 706085 transitions. [2019-09-08 05:44:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 05:44:52,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:52,919 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 05:44:52,919 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 403150398, now seen corresponding path program 1 times [2019-09-08 05:44:52,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 05:44:53,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:53,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:44:53,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:44:53,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:44:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:44:53,060 INFO L87 Difference]: Start difference. First operand 369877 states and 706085 transitions. Second operand 3 states. [2019-09-08 05:45:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:30,191 INFO L93 Difference]: Finished difference Result 957775 states and 1891295 transitions. [2019-09-08 05:45:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:45:30,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 05:45:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:32,883 INFO L225 Difference]: With dead ends: 957775 [2019-09-08 05:45:32,883 INFO L226 Difference]: Without dead ends: 588015 [2019-09-08 05:45:33,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588015 states.