java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec3_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:22:03,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:22:03,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:22:03,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:22:03,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:22:03,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:22:03,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:22:03,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:22:03,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:22:03,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:22:03,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:22:03,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:22:03,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:22:03,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:22:03,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:22:03,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:22:03,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:22:03,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:22:03,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:22:03,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:22:03,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:22:03,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:22:03,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:22:03,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:22:03,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:22:03,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:22:03,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:22:03,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:22:03,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:22:03,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:22:03,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:22:03,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:22:03,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:22:03,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:22:03,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:22:03,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:22:03,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:22:03,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:22:03,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:22:03,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:22:03,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:22:03,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:22:03,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:22:03,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:22:03,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:22:03,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:22:03,391 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:22:03,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:22:03,392 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:22:03,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:22:03,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:22:03,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:22:03,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:22:03,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:22:03,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:22:03,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:22:03,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:22:03,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:22:03,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:22:03,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:22:03,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:22:03,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:22:03,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:22:03,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:22:03,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:22:03,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:22:03,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:22:03,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:22:03,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:22:03,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:22:03,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:22:03,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:22:03,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:22:03,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:22:03,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:22:03,456 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:22:03,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product31.cil.c [2019-10-02 13:22:03,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c67df59/23a1a6a5a5cd40a69a5da8b84e97afed/FLAGb408fb0d3 [2019-10-02 13:22:04,123 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:22:04,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product31.cil.c [2019-10-02 13:22:04,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c67df59/23a1a6a5a5cd40a69a5da8b84e97afed/FLAGb408fb0d3 [2019-10-02 13:22:04,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c67df59/23a1a6a5a5cd40a69a5da8b84e97afed [2019-10-02 13:22:04,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:22:04,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:22:04,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:22:04,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:22:04,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:22:04,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:22:04" (1/1) ... [2019-10-02 13:22:04,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4adf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:04, skipping insertion in model container [2019-10-02 13:22:04,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:22:04" (1/1) ... [2019-10-02 13:22:04,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:22:04,456 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:22:05,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:22:05,231 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:22:05,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:22:05,476 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:22:05,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05 WrapperNode [2019-10-02 13:22:05,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:22:05,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:22:05,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:22:05,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:22:05,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... [2019-10-02 13:22:05,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:22:05,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:22:05,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:22:05,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:22:05,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:22:05,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:22:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:22:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:22:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:22:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:22:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:22:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:22:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:22:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:22:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:22:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:22:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:22:05,719 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:22:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:22:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:22:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:22:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:22:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:22:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:22:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:22:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:22:05,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:22:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:22:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:22:05,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:22:05,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:22:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:22:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:22:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:22:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:22:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:22:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:22:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:22:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:22:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:22:05,728 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:22:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:22:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:22:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:22:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:22:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:22:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:22:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:22:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:22:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:22:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:22:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:22:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:22:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:22:05,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:22:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:22:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:22:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:22:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:22:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:22:05,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:22:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:22:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:22:05,736 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:22:05,736 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:22:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:22:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:22:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:22:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:22:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:22:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:22:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:22:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:22:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:22:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:22:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:22:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:22:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:22:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:22:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:22:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:22:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:22:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:22:05,741 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:22:05,742 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:22:05,743 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:22:05,744 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:22:05,745 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:22:05,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:22:05,747 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:22:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:22:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:22:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:22:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:22:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:22:05,748 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:22:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:22:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:22:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:22:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:22:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:22:05,749 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:22:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:22:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:22:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:22:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:22:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:22:05,750 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:22:05,751 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:22:05,751 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:22:05,751 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:22:05,751 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:22:05,751 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:22:05,751 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:22:05,752 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:22:05,753 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:22:05,753 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:22:05,753 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:22:05,753 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:22:05,753 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:22:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:22:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:22:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:22:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:22:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:22:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:22:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 13:22:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:22:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:22:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:22:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:22:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:22:05,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:22:07,809 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:22:07,810 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:22:07,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:22:07 BoogieIcfgContainer [2019-10-02 13:22:07,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:22:07,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:22:07,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:22:07,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:22:07,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:22:04" (1/3) ... [2019-10-02 13:22:07,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3647ba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:22:07, skipping insertion in model container [2019-10-02 13:22:07,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:05" (2/3) ... [2019-10-02 13:22:07,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3647ba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:22:07, skipping insertion in model container [2019-10-02 13:22:07,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:22:07" (3/3) ... [2019-10-02 13:22:07,820 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product31.cil.c [2019-10-02 13:22:07,830 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:22:07,846 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:22:07,863 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:22:07,909 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:22:07,910 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:22:07,910 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:22:07,910 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:22:07,910 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:22:07,913 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:22:07,914 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:22:07,914 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:22:07,914 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:22:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states. [2019-10-02 13:22:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 13:22:07,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:07,992 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:07,995 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:08,000 INFO L82 PathProgramCache]: Analyzing trace with hash 721046369, now seen corresponding path program 1 times [2019-10-02 13:22:08,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:08,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:08,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:08,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:08,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:22:08,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:22:08,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:22:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:22:08,738 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 2 states. [2019-10-02 13:22:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:08,868 INFO L93 Difference]: Finished difference Result 882 states and 1163 transitions. [2019-10-02 13:22:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:22:08,869 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-10-02 13:22:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:08,902 INFO L225 Difference]: With dead ends: 882 [2019-10-02 13:22:08,902 INFO L226 Difference]: Without dead ends: 547 [2019-10-02 13:22:08,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:22:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-02 13:22:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2019-10-02 13:22:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-10-02 13:22:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2019-10-02 13:22:09,035 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 195 [2019-10-02 13:22:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:09,037 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2019-10-02 13:22:09,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:22:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2019-10-02 13:22:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:22:09,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:09,043 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:09,043 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1162563648, now seen corresponding path program 1 times [2019-10-02 13:22:09,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:09,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:09,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:09,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:09,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:09,347 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand 3 states. [2019-10-02 13:22:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:09,396 INFO L93 Difference]: Finished difference Result 865 states and 1126 transitions. [2019-10-02 13:22:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:09,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:22:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:09,402 INFO L225 Difference]: With dead ends: 865 [2019-10-02 13:22:09,402 INFO L226 Difference]: Without dead ends: 550 [2019-10-02 13:22:09,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-02 13:22:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2019-10-02 13:22:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-10-02 13:22:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 725 transitions. [2019-10-02 13:22:09,484 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 725 transitions. Word has length 196 [2019-10-02 13:22:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:09,484 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 725 transitions. [2019-10-02 13:22:09,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 725 transitions. [2019-10-02 13:22:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:22:09,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:09,489 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:09,489 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1293026860, now seen corresponding path program 1 times [2019-10-02 13:22:09,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:09,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:09,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:09,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:09,688 INFO L87 Difference]: Start difference. First operand 549 states and 725 transitions. Second operand 3 states. [2019-10-02 13:22:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:09,735 INFO L93 Difference]: Finished difference Result 1074 states and 1448 transitions. [2019-10-02 13:22:09,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:09,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-02 13:22:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:09,740 INFO L225 Difference]: With dead ends: 1074 [2019-10-02 13:22:09,741 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 13:22:09,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 13:22:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 589. [2019-10-02 13:22:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 13:22:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 794 transitions. [2019-10-02 13:22:09,766 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 794 transitions. Word has length 202 [2019-10-02 13:22:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:09,767 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 794 transitions. [2019-10-02 13:22:09,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 794 transitions. [2019-10-02 13:22:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:22:09,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:09,772 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:09,772 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 488920011, now seen corresponding path program 1 times [2019-10-02 13:22:09,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:09,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:22:10,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:10,377 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:10,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:11,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 2914 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:11,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:22:11,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:22:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:22:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:22:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:22:11,717 INFO L87 Difference]: Start difference. First operand 589 states and 794 transitions. Second operand 26 states. [2019-10-02 13:22:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:21,548 INFO L93 Difference]: Finished difference Result 2382 states and 3260 transitions. [2019-10-02 13:22:21,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:22:21,548 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 203 [2019-10-02 13:22:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:21,564 INFO L225 Difference]: With dead ends: 2382 [2019-10-02 13:22:21,565 INFO L226 Difference]: Without dead ends: 1829 [2019-10-02 13:22:21,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:22:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-10-02 13:22:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1789. [2019-10-02 13:22:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-10-02 13:22:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2429 transitions. [2019-10-02 13:22:21,716 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2429 transitions. Word has length 203 [2019-10-02 13:22:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:21,716 INFO L475 AbstractCegarLoop]: Abstraction has 1789 states and 2429 transitions. [2019-10-02 13:22:21,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:22:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2429 transitions. [2019-10-02 13:22:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:22:21,725 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:21,725 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:21,725 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -74066695, now seen corresponding path program 1 times [2019-10-02 13:22:21,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:21,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:22:22,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:22,016 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:22,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:22,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:22:22,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:22:22,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:22,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 13:22:22,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:22:22,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:22:22,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:22:22,753 INFO L87 Difference]: Start difference. First operand 1789 states and 2429 transitions. Second operand 16 states. [2019-10-02 13:22:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:24,590 INFO L93 Difference]: Finished difference Result 3605 states and 4950 transitions. [2019-10-02 13:22:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:22:24,591 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 205 [2019-10-02 13:22:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:24,607 INFO L225 Difference]: With dead ends: 3605 [2019-10-02 13:22:24,608 INFO L226 Difference]: Without dead ends: 1851 [2019-10-02 13:22:24,619 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:22:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2019-10-02 13:22:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1851. [2019-10-02 13:22:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-10-02 13:22:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2531 transitions. [2019-10-02 13:22:24,759 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2531 transitions. Word has length 205 [2019-10-02 13:22:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:24,760 INFO L475 AbstractCegarLoop]: Abstraction has 1851 states and 2531 transitions. [2019-10-02 13:22:24,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:22:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2531 transitions. [2019-10-02 13:22:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:22:24,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:24,769 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:24,769 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash -460224943, now seen corresponding path program 1 times [2019-10-02 13:22:24,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:22:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:25,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:25,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:25,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 2917 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:25,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:22:26,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:26,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:22:26,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:22:26,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:22:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:22:26,065 INFO L87 Difference]: Start difference. First operand 1851 states and 2531 transitions. Second operand 22 states. [2019-10-02 13:22:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:35,983 INFO L93 Difference]: Finished difference Result 3770 states and 5231 transitions. [2019-10-02 13:22:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:22:35,983 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 206 [2019-10-02 13:22:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:36,007 INFO L225 Difference]: With dead ends: 3770 [2019-10-02 13:22:36,008 INFO L226 Difference]: Without dead ends: 1980 [2019-10-02 13:22:36,021 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 13:22:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2019-10-02 13:22:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1935. [2019-10-02 13:22:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-10-02 13:22:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2665 transitions. [2019-10-02 13:22:36,188 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2665 transitions. Word has length 206 [2019-10-02 13:22:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:36,190 INFO L475 AbstractCegarLoop]: Abstraction has 1935 states and 2665 transitions. [2019-10-02 13:22:36,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:22:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2665 transitions. [2019-10-02 13:22:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:22:36,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:36,197 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:36,198 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1178356720, now seen corresponding path program 1 times [2019-10-02 13:22:36,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:36,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:36,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:36,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:36,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:22:36,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:36,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:22:36,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:22:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:22:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:22:36,532 INFO L87 Difference]: Start difference. First operand 1935 states and 2665 transitions. Second operand 5 states. [2019-10-02 13:22:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:36,621 INFO L93 Difference]: Finished difference Result 2931 states and 3964 transitions. [2019-10-02 13:22:36,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:22:36,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-02 13:22:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:36,632 INFO L225 Difference]: With dead ends: 2931 [2019-10-02 13:22:36,632 INFO L226 Difference]: Without dead ends: 1556 [2019-10-02 13:22:36,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:22:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2019-10-02 13:22:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1554. [2019-10-02 13:22:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-10-02 13:22:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2135 transitions. [2019-10-02 13:22:36,753 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2135 transitions. Word has length 210 [2019-10-02 13:22:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:36,755 INFO L475 AbstractCegarLoop]: Abstraction has 1554 states and 2135 transitions. [2019-10-02 13:22:36,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:22:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2135 transitions. [2019-10-02 13:22:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:22:36,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:36,767 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:36,767 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash -755207864, now seen corresponding path program 1 times [2019-10-02 13:22:36,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:36,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:36,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:37,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:37,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:22:37,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:22:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:22:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:22:37,154 INFO L87 Difference]: Start difference. First operand 1554 states and 2135 transitions. Second operand 16 states. [2019-10-02 13:22:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:37,490 INFO L93 Difference]: Finished difference Result 2594 states and 3513 transitions. [2019-10-02 13:22:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:22:37,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 207 [2019-10-02 13:22:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:37,500 INFO L225 Difference]: With dead ends: 2594 [2019-10-02 13:22:37,501 INFO L226 Difference]: Without dead ends: 1581 [2019-10-02 13:22:37,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:22:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2019-10-02 13:22:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1568. [2019-10-02 13:22:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2019-10-02 13:22:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2146 transitions. [2019-10-02 13:22:37,585 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2146 transitions. Word has length 207 [2019-10-02 13:22:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:37,588 INFO L475 AbstractCegarLoop]: Abstraction has 1568 states and 2146 transitions. [2019-10-02 13:22:37,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:22:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2146 transitions. [2019-10-02 13:22:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:22:37,594 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:37,594 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:37,594 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash 722128924, now seen corresponding path program 1 times [2019-10-02 13:22:37,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:37,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:37,839 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:37,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:38,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 2918 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:38,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:22:38,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:38,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:22:38,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:22:38,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:22:38,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:22:38,671 INFO L87 Difference]: Start difference. First operand 1568 states and 2146 transitions. Second operand 12 states. [2019-10-02 13:22:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:43,564 INFO L93 Difference]: Finished difference Result 4986 states and 6869 transitions. [2019-10-02 13:22:43,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:22:43,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 207 [2019-10-02 13:22:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:43,589 INFO L225 Difference]: With dead ends: 4986 [2019-10-02 13:22:43,589 INFO L226 Difference]: Without dead ends: 3493 [2019-10-02 13:22:43,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:22:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3493 states. [2019-10-02 13:22:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3493 to 3462. [2019-10-02 13:22:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2019-10-02 13:22:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4727 transitions. [2019-10-02 13:22:43,766 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4727 transitions. Word has length 207 [2019-10-02 13:22:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:43,769 INFO L475 AbstractCegarLoop]: Abstraction has 3462 states and 4727 transitions. [2019-10-02 13:22:43,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:22:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4727 transitions. [2019-10-02 13:22:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:22:43,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:43,777 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:43,777 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:43,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:43,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1903193448, now seen corresponding path program 1 times [2019-10-02 13:22:43,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:43,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:43,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:43,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:22:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:22:44,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:22:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:22:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:22:44,037 INFO L87 Difference]: Start difference. First operand 3462 states and 4727 transitions. Second operand 12 states. [2019-10-02 13:22:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:55,316 INFO L93 Difference]: Finished difference Result 24223 states and 31970 transitions. [2019-10-02 13:22:55,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:22:55,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 208 [2019-10-02 13:22:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:55,454 INFO L225 Difference]: With dead ends: 24223 [2019-10-02 13:22:55,454 INFO L226 Difference]: Without dead ends: 18839 [2019-10-02 13:22:55,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:22:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18839 states. [2019-10-02 13:22:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18839 to 18047. [2019-10-02 13:22:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18047 states. [2019-10-02 13:22:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18047 states to 18047 states and 23739 transitions. [2019-10-02 13:22:56,804 INFO L78 Accepts]: Start accepts. Automaton has 18047 states and 23739 transitions. Word has length 208 [2019-10-02 13:22:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:56,805 INFO L475 AbstractCegarLoop]: Abstraction has 18047 states and 23739 transitions. [2019-10-02 13:22:56,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:22:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 18047 states and 23739 transitions. [2019-10-02 13:22:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:22:56,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:56,822 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:56,823 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1538326567, now seen corresponding path program 1 times [2019-10-02 13:22:56,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:56,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:22:57,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:57,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:22:57,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:22:57,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:22:57,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:57,295 INFO L87 Difference]: Start difference. First operand 18047 states and 23739 transitions. Second operand 18 states. [2019-10-02 13:22:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:58,753 INFO L93 Difference]: Finished difference Result 31382 states and 41029 transitions. [2019-10-02 13:22:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:22:58,754 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 209 [2019-10-02 13:22:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:58,839 INFO L225 Difference]: With dead ends: 31382 [2019-10-02 13:22:58,839 INFO L226 Difference]: Without dead ends: 11568 [2019-10-02 13:22:58,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 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-10-02 13:22:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11568 states. [2019-10-02 13:22:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11568 to 10647. [2019-10-02 13:22:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10647 states. [2019-10-02 13:22:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10647 states to 10647 states and 14082 transitions. [2019-10-02 13:22:59,483 INFO L78 Accepts]: Start accepts. Automaton has 10647 states and 14082 transitions. Word has length 209 [2019-10-02 13:22:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:59,485 INFO L475 AbstractCegarLoop]: Abstraction has 10647 states and 14082 transitions. [2019-10-02 13:22:59,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:22:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10647 states and 14082 transitions. [2019-10-02 13:22:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:22:59,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:59,494 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:59,494 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 39720836, now seen corresponding path program 1 times [2019-10-02 13:22:59,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:59,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:22:59,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:59,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:22:59,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:22:59,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:22:59,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:22:59,697 INFO L87 Difference]: Start difference. First operand 10647 states and 14082 transitions. Second operand 8 states. [2019-10-02 13:23:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:01,779 INFO L93 Difference]: Finished difference Result 29181 states and 38463 transitions. [2019-10-02 13:23:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:23:01,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 218 [2019-10-02 13:23:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:01,850 INFO L225 Difference]: With dead ends: 29181 [2019-10-02 13:23:01,851 INFO L226 Difference]: Without dead ends: 21130 [2019-10-02 13:23:01,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21130 states. [2019-10-02 13:23:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21130 to 20590. [2019-10-02 13:23:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20590 states. [2019-10-02 13:23:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20590 states to 20590 states and 27158 transitions. [2019-10-02 13:23:02,812 INFO L78 Accepts]: Start accepts. Automaton has 20590 states and 27158 transitions. Word has length 218 [2019-10-02 13:23:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:02,812 INFO L475 AbstractCegarLoop]: Abstraction has 20590 states and 27158 transitions. [2019-10-02 13:23:02,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:23:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20590 states and 27158 transitions. [2019-10-02 13:23:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 13:23:02,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:02,825 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:02,825 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash 59315416, now seen corresponding path program 1 times [2019-10-02 13:23:02,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:02,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:23:03,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:03,332 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:23:03,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:03,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 2963 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:23:03,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:23:04,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:04,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:23:04,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:23:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:23:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:23:04,021 INFO L87 Difference]: Start difference. First operand 20590 states and 27158 transitions. Second operand 20 states. [2019-10-02 13:23:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:10,294 INFO L93 Difference]: Finished difference Result 42116 states and 55934 transitions. [2019-10-02 13:23:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 13:23:10,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 219 [2019-10-02 13:23:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:10,366 INFO L225 Difference]: With dead ends: 42116 [2019-10-02 13:23:10,366 INFO L226 Difference]: Without dead ends: 21606 [2019-10-02 13:23:10,406 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=2721, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:23:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21606 states. [2019-10-02 13:23:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 20557. [2019-10-02 13:23:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20557 states. [2019-10-02 13:23:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20557 states to 20557 states and 27116 transitions. [2019-10-02 13:23:11,768 INFO L78 Accepts]: Start accepts. Automaton has 20557 states and 27116 transitions. Word has length 219 [2019-10-02 13:23:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:11,768 INFO L475 AbstractCegarLoop]: Abstraction has 20557 states and 27116 transitions. [2019-10-02 13:23:11,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:23:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 20557 states and 27116 transitions. [2019-10-02 13:23:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 13:23:11,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:11,784 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:11,785 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 77478431, now seen corresponding path program 1 times [2019-10-02 13:23:11,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:11,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:23:12,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:12,176 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:23:12,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:12,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 2963 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:23:12,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:23:12,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:12,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-10-02 13:23:12,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:23:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:23:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:23:12,889 INFO L87 Difference]: Start difference. First operand 20557 states and 27116 transitions. Second operand 30 states. [2019-10-02 13:23:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:21,526 INFO L93 Difference]: Finished difference Result 42512 states and 56473 transitions. [2019-10-02 13:23:21,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 13:23:21,526 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 220 [2019-10-02 13:23:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:21,604 INFO L225 Difference]: With dead ends: 42512 [2019-10-02 13:23:21,605 INFO L226 Difference]: Without dead ends: 21765 [2019-10-02 13:23:21,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=507, Invalid=4749, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 13:23:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21765 states. [2019-10-02 13:23:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21765 to 21017. [2019-10-02 13:23:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21017 states. [2019-10-02 13:23:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21017 states to 21017 states and 27726 transitions. [2019-10-02 13:23:23,511 INFO L78 Accepts]: Start accepts. Automaton has 21017 states and 27726 transitions. Word has length 220 [2019-10-02 13:23:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:23,512 INFO L475 AbstractCegarLoop]: Abstraction has 21017 states and 27726 transitions. [2019-10-02 13:23:23,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:23:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21017 states and 27726 transitions. [2019-10-02 13:23:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:23:23,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:23,523 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:23,524 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:23,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2017590837, now seen corresponding path program 1 times [2019-10-02 13:23:23,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:23,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:23,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:23:23,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:23,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:23:23,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:23:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:23:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:23,742 INFO L87 Difference]: Start difference. First operand 21017 states and 27726 transitions. Second operand 13 states. [2019-10-02 13:23:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:24,404 INFO L93 Difference]: Finished difference Result 33268 states and 44338 transitions. [2019-10-02 13:23:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:23:24,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 221 [2019-10-02 13:23:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:24,493 INFO L225 Difference]: With dead ends: 33268 [2019-10-02 13:23:24,493 INFO L226 Difference]: Without dead ends: 23051 [2019-10-02 13:23:24,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:23:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23051 states. [2019-10-02 13:23:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23051 to 22057. [2019-10-02 13:23:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22057 states. [2019-10-02 13:23:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22057 states to 22057 states and 29366 transitions. [2019-10-02 13:23:25,544 INFO L78 Accepts]: Start accepts. Automaton has 22057 states and 29366 transitions. Word has length 221 [2019-10-02 13:23:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:25,544 INFO L475 AbstractCegarLoop]: Abstraction has 22057 states and 29366 transitions. [2019-10-02 13:23:25,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:23:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 22057 states and 29366 transitions. [2019-10-02 13:23:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:23:25,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:25,555 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:25,555 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1910418545, now seen corresponding path program 2 times [2019-10-02 13:23:25,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:25,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:25,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:25,740 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:23:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:23:26,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:23:26,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:23:26,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 13:23:26,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:23:26,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:23:26,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:23:26,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:23:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:23:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:23:26,562 INFO L87 Difference]: Start difference. First operand 22057 states and 29366 transitions. Second operand 18 states. [2019-10-02 13:23:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:35,641 INFO L93 Difference]: Finished difference Result 58801 states and 78334 transitions. [2019-10-02 13:23:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:23:35,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 221 [2019-10-02 13:23:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:35,749 INFO L225 Difference]: With dead ends: 58801 [2019-10-02 13:23:35,749 INFO L226 Difference]: Without dead ends: 35200 [2019-10-02 13:23:35,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:23:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35200 states. [2019-10-02 13:23:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35200 to 29600. [2019-10-02 13:23:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29600 states. [2019-10-02 13:23:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29600 states to 29600 states and 39199 transitions. [2019-10-02 13:23:37,257 INFO L78 Accepts]: Start accepts. Automaton has 29600 states and 39199 transitions. Word has length 221 [2019-10-02 13:23:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:37,258 INFO L475 AbstractCegarLoop]: Abstraction has 29600 states and 39199 transitions. [2019-10-02 13:23:37,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:23:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 29600 states and 39199 transitions. [2019-10-02 13:23:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:23:37,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:37,283 INFO L411 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] [2019-10-02 13:23:37,283 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -336847062, now seen corresponding path program 1 times [2019-10-02 13:23:37,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:37,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:37,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:23:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:23:37,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:37,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:23:37,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:23:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:23:37,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:37,525 INFO L87 Difference]: Start difference. First operand 29600 states and 39199 transitions. Second operand 13 states. [2019-10-02 13:23:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:38,473 INFO L93 Difference]: Finished difference Result 44360 states and 59595 transitions. [2019-10-02 13:23:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:23:38,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 222 [2019-10-02 13:23:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:38,559 INFO L225 Difference]: With dead ends: 44360 [2019-10-02 13:23:38,559 INFO L226 Difference]: Without dead ends: 32508 [2019-10-02 13:23:38,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:23:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32508 states. [2019-10-02 13:23:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32508 to 30950. [2019-10-02 13:23:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30950 states. [2019-10-02 13:23:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30950 states to 30950 states and 41309 transitions. [2019-10-02 13:23:39,988 INFO L78 Accepts]: Start accepts. Automaton has 30950 states and 41309 transitions. Word has length 222 [2019-10-02 13:23:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:39,988 INFO L475 AbstractCegarLoop]: Abstraction has 30950 states and 41309 transitions. [2019-10-02 13:23:39,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:23:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 30950 states and 41309 transitions. [2019-10-02 13:23:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:23:40,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:40,005 INFO L411 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] [2019-10-02 13:23:40,005 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1258741139, now seen corresponding path program 1 times [2019-10-02 13:23:40,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:40,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:40,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:23:40,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:40,323 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:23:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:40,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 2963 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:23:40,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:40,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:23:40,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-10-02 13:23:41,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:23:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:23:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:23:41,003 INFO L87 Difference]: Start difference. First operand 30950 states and 41309 transitions. Second operand 20 states. [2019-10-02 13:23:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:47,044 INFO L93 Difference]: Finished difference Result 65752 states and 87784 transitions. [2019-10-02 13:23:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 13:23:47,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 222 [2019-10-02 13:23:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:47,160 INFO L225 Difference]: With dead ends: 65752 [2019-10-02 13:23:47,160 INFO L226 Difference]: Without dead ends: 33312 [2019-10-02 13:23:47,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 13:23:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33312 states. [2019-10-02 13:23:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33312 to 31495. [2019-10-02 13:23:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31495 states. [2019-10-02 13:23:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31495 states to 31495 states and 41945 transitions. [2019-10-02 13:23:48,374 INFO L78 Accepts]: Start accepts. Automaton has 31495 states and 41945 transitions. Word has length 222 [2019-10-02 13:23:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:48,375 INFO L475 AbstractCegarLoop]: Abstraction has 31495 states and 41945 transitions. [2019-10-02 13:23:48,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:23:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31495 states and 41945 transitions. [2019-10-02 13:23:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:23:48,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:48,386 INFO L411 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] [2019-10-02 13:23:48,386 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1299417234, now seen corresponding path program 1 times [2019-10-02 13:23:48,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:48,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:48,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:48,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:48,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:48,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:48,526 INFO L87 Difference]: Start difference. First operand 31495 states and 41945 transitions. Second operand 3 states. [2019-10-02 13:23:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:49,482 INFO L93 Difference]: Finished difference Result 63316 states and 84618 transitions. [2019-10-02 13:23:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:49,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-10-02 13:23:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:49,592 INFO L225 Difference]: With dead ends: 63316 [2019-10-02 13:23:49,593 INFO L226 Difference]: Without dead ends: 31991 [2019-10-02 13:23:49,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31991 states. [2019-10-02 13:23:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31991 to 31171. [2019-10-02 13:23:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31171 states. [2019-10-02 13:23:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31171 states to 31171 states and 41768 transitions. [2019-10-02 13:23:50,706 INFO L78 Accepts]: Start accepts. Automaton has 31171 states and 41768 transitions. Word has length 228 [2019-10-02 13:23:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:50,707 INFO L475 AbstractCegarLoop]: Abstraction has 31171 states and 41768 transitions. [2019-10-02 13:23:50,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31171 states and 41768 transitions. [2019-10-02 13:23:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:23:50,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:50,720 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 13:23:50,720 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:50,721 INFO L82 PathProgramCache]: Analyzing trace with hash 472566476, now seen corresponding path program 1 times [2019-10-02 13:23:50,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:50,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:50,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:50,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:50,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:23:50,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:23:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:23:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:23:50,863 INFO L87 Difference]: Start difference. First operand 31171 states and 41768 transitions. Second operand 6 states. [2019-10-02 13:23:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:51,915 INFO L93 Difference]: Finished difference Result 62078 states and 83172 transitions. [2019-10-02 13:23:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:23:51,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 13:23:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:51,995 INFO L225 Difference]: With dead ends: 62078 [2019-10-02 13:23:51,995 INFO L226 Difference]: Without dead ends: 31177 [2019-10-02 13:23:52,052 INFO L640 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-10-02 13:23:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31177 states. [2019-10-02 13:23:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31177 to 31171. [2019-10-02 13:23:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31171 states. [2019-10-02 13:23:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31171 states to 31171 states and 41756 transitions. [2019-10-02 13:23:53,076 INFO L78 Accepts]: Start accepts. Automaton has 31171 states and 41756 transitions. Word has length 229 [2019-10-02 13:23:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:53,076 INFO L475 AbstractCegarLoop]: Abstraction has 31171 states and 41756 transitions. [2019-10-02 13:23:53,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:23:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31171 states and 41756 transitions. [2019-10-02 13:23:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:23:53,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:53,085 INFO L411 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] [2019-10-02 13:23:53,085 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:53,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1067746013, now seen corresponding path program 1 times [2019-10-02 13:23:53,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:53,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:53,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:53,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:53,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:53,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:53,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:53,232 INFO L87 Difference]: Start difference. First operand 31171 states and 41756 transitions. Second operand 3 states. [2019-10-02 13:23:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:54,042 INFO L93 Difference]: Finished difference Result 63082 states and 85022 transitions. [2019-10-02 13:23:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:54,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-10-02 13:23:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:54,121 INFO L225 Difference]: With dead ends: 63082 [2019-10-02 13:23:54,121 INFO L226 Difference]: Without dead ends: 32093 [2019-10-02 13:23:54,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32093 states. [2019-10-02 13:23:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32093 to 31550. [2019-10-02 13:23:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31550 states. [2019-10-02 13:23:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31550 states to 31550 states and 42732 transitions. [2019-10-02 13:23:55,418 INFO L78 Accepts]: Start accepts. Automaton has 31550 states and 42732 transitions. Word has length 229 [2019-10-02 13:23:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:55,418 INFO L475 AbstractCegarLoop]: Abstraction has 31550 states and 42732 transitions. [2019-10-02 13:23:55,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31550 states and 42732 transitions. [2019-10-02 13:23:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:23:55,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:55,430 INFO L411 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] [2019-10-02 13:23:55,430 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1078134188, now seen corresponding path program 1 times [2019-10-02 13:23:55,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:55,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:55,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:55,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:55,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:55,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:55,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:55,550 INFO L87 Difference]: Start difference. First operand 31550 states and 42732 transitions. Second operand 3 states. [2019-10-02 13:23:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:56,354 INFO L93 Difference]: Finished difference Result 64672 states and 88482 transitions. [2019-10-02 13:23:56,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:56,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-02 13:23:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:56,439 INFO L225 Difference]: With dead ends: 64672 [2019-10-02 13:23:56,439 INFO L226 Difference]: Without dead ends: 33320 [2019-10-02 13:23:56,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33320 states. [2019-10-02 13:23:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33320 to 32940. [2019-10-02 13:23:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32940 states. [2019-10-02 13:23:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32940 states to 32940 states and 45430 transitions. [2019-10-02 13:23:57,911 INFO L78 Accepts]: Start accepts. Automaton has 32940 states and 45430 transitions. Word has length 230 [2019-10-02 13:23:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:57,911 INFO L475 AbstractCegarLoop]: Abstraction has 32940 states and 45430 transitions. [2019-10-02 13:23:57,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32940 states and 45430 transitions. [2019-10-02 13:23:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:23:57,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:57,931 INFO L411 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] [2019-10-02 13:23:57,932 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2072792483, now seen corresponding path program 1 times [2019-10-02 13:23:57,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:57,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:57,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:57,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:57,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:58,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:58,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:58,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:58,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:58,052 INFO L87 Difference]: Start difference. First operand 32940 states and 45430 transitions. Second operand 3 states. [2019-10-02 13:23:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:58,959 INFO L93 Difference]: Finished difference Result 69036 states and 96750 transitions. [2019-10-02 13:23:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:58,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 13:23:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:59,081 INFO L225 Difference]: With dead ends: 69036 [2019-10-02 13:23:59,082 INFO L226 Difference]: Without dead ends: 36318 [2019-10-02 13:23:59,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36318 states. [2019-10-02 13:24:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36318 to 36312. [2019-10-02 13:24:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36312 states. [2019-10-02 13:24:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36312 states to 36312 states and 51488 transitions. [2019-10-02 13:24:00,662 INFO L78 Accepts]: Start accepts. Automaton has 36312 states and 51488 transitions. Word has length 231 [2019-10-02 13:24:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:00,663 INFO L475 AbstractCegarLoop]: Abstraction has 36312 states and 51488 transitions. [2019-10-02 13:24:00,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 36312 states and 51488 transitions. [2019-10-02 13:24:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:24:00,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:00,702 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:00,702 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1968738860, now seen corresponding path program 1 times [2019-10-02 13:24:00,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:00,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:00,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:00,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:00,826 INFO L87 Difference]: Start difference. First operand 36312 states and 51488 transitions. Second operand 3 states. [2019-10-02 13:24:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:01,969 INFO L93 Difference]: Finished difference Result 78824 states and 114498 transitions. [2019-10-02 13:24:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:01,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 13:24:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:02,064 INFO L225 Difference]: With dead ends: 78824 [2019-10-02 13:24:02,064 INFO L226 Difference]: Without dead ends: 42754 [2019-10-02 13:24:02,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-10-02 13:24:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42748. [2019-10-02 13:24:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42748 states. [2019-10-02 13:24:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42748 states to 42748 states and 63106 transitions. [2019-10-02 13:24:05,355 INFO L78 Accepts]: Start accepts. Automaton has 42748 states and 63106 transitions. Word has length 232 [2019-10-02 13:24:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:05,356 INFO L475 AbstractCegarLoop]: Abstraction has 42748 states and 63106 transitions. [2019-10-02 13:24:05,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 42748 states and 63106 transitions. [2019-10-02 13:24:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:24:05,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:05,426 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:05,426 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -251172387, now seen corresponding path program 1 times [2019-10-02 13:24:05,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:05,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:05,547 INFO L87 Difference]: Start difference. First operand 42748 states and 63106 transitions. Second operand 3 states. [2019-10-02 13:24:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:07,495 INFO L93 Difference]: Finished difference Result 97540 states and 147988 transitions. [2019-10-02 13:24:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:07,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:24:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:07,615 INFO L225 Difference]: With dead ends: 97540 [2019-10-02 13:24:07,615 INFO L226 Difference]: Without dead ends: 55046 [2019-10-02 13:24:07,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55046 states. [2019-10-02 13:24:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55046 to 55040. [2019-10-02 13:24:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55040 states. [2019-10-02 13:24:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55040 states to 55040 states and 84804 transitions. [2019-10-02 13:24:11,877 INFO L78 Accepts]: Start accepts. Automaton has 55040 states and 84804 transitions. Word has length 233 [2019-10-02 13:24:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:11,877 INFO L475 AbstractCegarLoop]: Abstraction has 55040 states and 84804 transitions. [2019-10-02 13:24:11,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 55040 states and 84804 transitions. [2019-10-02 13:24:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:24:11,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:11,963 INFO L411 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] [2019-10-02 13:24:11,963 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1676402066, now seen corresponding path program 1 times [2019-10-02 13:24:11,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:11,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:24:12,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:12,456 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:24:12,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:13,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 3029 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:24:13,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 13:24:13,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:24:13,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2019-10-02 13:24:13,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 13:24:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 13:24:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:24:13,208 INFO L87 Difference]: Start difference. First operand 55040 states and 84804 transitions. Second operand 31 states. [2019-10-02 13:24:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:48,461 INFO L93 Difference]: Finished difference Result 285555 states and 434063 transitions. [2019-10-02 13:24:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 13:24:48,462 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 240 [2019-10-02 13:24:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:49,199 INFO L225 Difference]: With dead ends: 285555 [2019-10-02 13:24:49,199 INFO L226 Difference]: Without dead ends: 257351 [2019-10-02 13:24:49,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=877, Invalid=8053, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 13:24:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257351 states. [2019-10-02 13:25:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257351 to 249110. [2019-10-02 13:25:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249110 states. [2019-10-02 13:25:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249110 states to 249110 states and 384755 transitions. [2019-10-02 13:25:07,168 INFO L78 Accepts]: Start accepts. Automaton has 249110 states and 384755 transitions. Word has length 240 [2019-10-02 13:25:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:07,168 INFO L475 AbstractCegarLoop]: Abstraction has 249110 states and 384755 transitions. [2019-10-02 13:25:07,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 13:25:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 249110 states and 384755 transitions. [2019-10-02 13:25:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:25:07,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:07,632 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:07,632 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 597185813, now seen corresponding path program 1 times [2019-10-02 13:25:07,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:07,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:07,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:07,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:07,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:07,750 INFO L87 Difference]: Start difference. First operand 249110 states and 384755 transitions. Second operand 3 states. [2019-10-02 13:25:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:26,156 INFO L93 Difference]: Finished difference Result 595509 states and 949247 transitions. [2019-10-02 13:25:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:25:26,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 13:25:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:27,113 INFO L225 Difference]: With dead ends: 595509 [2019-10-02 13:25:27,113 INFO L226 Difference]: Without dead ends: 349362 [2019-10-02 13:25:27,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349362 states. [2019-10-02 13:25:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349362 to 341085. [2019-10-02 13:25:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341085 states. [2019-10-02 13:26:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341085 states to 341085 states and 554775 transitions. [2019-10-02 13:26:00,625 INFO L78 Accepts]: Start accepts. Automaton has 341085 states and 554775 transitions. Word has length 234 [2019-10-02 13:26:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:00,625 INFO L475 AbstractCegarLoop]: Abstraction has 341085 states and 554775 transitions. [2019-10-02 13:26:00,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 341085 states and 554775 transitions. [2019-10-02 13:26:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:26:02,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:02,576 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:02,576 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -420321338, now seen corresponding path program 1 times [2019-10-02 13:26:02,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:02,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:26:02,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:02,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:02,718 INFO L87 Difference]: Start difference. First operand 341085 states and 554775 transitions. Second operand 3 states. [2019-10-02 13:26:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:39,198 INFO L93 Difference]: Finished difference Result 863905 states and 1435865 transitions. [2019-10-02 13:26:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:39,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 13:26:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:40,798 INFO L225 Difference]: With dead ends: 863905 [2019-10-02 13:26:40,798 INFO L226 Difference]: Without dead ends: 526451 [2019-10-02 13:26:41,335 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526451 states. [2019-10-02 13:27:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526451 to 526235. [2019-10-02 13:27:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526235 states. [2019-10-02 13:27:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526235 states to 526235 states and 880040 transitions. [2019-10-02 13:27:46,469 INFO L78 Accepts]: Start accepts. Automaton has 526235 states and 880040 transitions. Word has length 235 [2019-10-02 13:27:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:46,470 INFO L475 AbstractCegarLoop]: Abstraction has 526235 states and 880040 transitions. [2019-10-02 13:27:46,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 526235 states and 880040 transitions. [2019-10-02 13:27:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:27:48,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:48,208 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:48,208 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1854859795, now seen corresponding path program 1 times [2019-10-02 13:27:48,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:48,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:48,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:27:48,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:48,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:48,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:48,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:48,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:48,328 INFO L87 Difference]: Start difference. First operand 526235 states and 880040 transitions. Second operand 3 states. [2019-10-02 13:28:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:59,539 INFO L93 Difference]: Finished difference Result 1398297 states and 2373919 transitions. [2019-10-02 13:28:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:59,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-02 13:28:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:29:02,617 INFO L225 Difference]: With dead ends: 1398297 [2019-10-02 13:29:02,617 INFO L226 Difference]: Without dead ends: 876885 [2019-10-02 13:29:04,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:29:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876885 states. [2019-10-02 13:30:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876885 to 876136. [2019-10-02 13:30:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876136 states.