java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec27_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:12:47,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:12:47,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:12:47,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:12:47,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:12:47,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:12:47,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:12:47,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:12:47,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:12:47,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:12:47,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:12:47,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:12:47,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:12:47,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:12:47,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:12:47,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:12:47,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:12:47,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:12:47,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:12:47,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:12:47,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:12:47,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:12:47,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:12:47,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:12:47,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:12:47,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:12:47,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:12:47,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:12:47,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:12:47,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:12:47,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:12:47,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:12:47,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:12:47,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:12:47,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:12:47,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:12:47,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:12:47,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:12:47,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:12:47,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:12:47,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:12:47,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:12:47,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:12:47,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:12:47,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:12:47,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:12:47,411 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:12:47,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:12:47,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:12:47,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:12:47,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:12:47,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:12:47,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:12:47,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:12:47,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:12:47,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:12:47,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:12:47,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:12:47,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:12:47,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:12:47,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:12:47,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:12:47,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:12:47,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:12:47,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:12:47,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:12:47,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:12:47,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:12:47,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:12:47,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:12:47,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:12:47,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:12:47,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:12:47,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:12:47,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:12:47,465 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:12:47,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product33.cil.c [2019-10-02 13:12:47,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51cb8606/927fdd6082384ef4b0eeb63f91943691/FLAG471f34636 [2019-10-02 13:12:48,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:12:48,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product33.cil.c [2019-10-02 13:12:48,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51cb8606/927fdd6082384ef4b0eeb63f91943691/FLAG471f34636 [2019-10-02 13:12:48,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51cb8606/927fdd6082384ef4b0eeb63f91943691 [2019-10-02 13:12:48,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:12:48,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:12:48,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:12:48,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:12:48,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:12:48,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:12:48" (1/1) ... [2019-10-02 13:12:48,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c635417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:48, skipping insertion in model container [2019-10-02 13:12:48,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:12:48" (1/1) ... [2019-10-02 13:12:48,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:12:48,478 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:12:49,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:12:49,441 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:12:49,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:12:49,668 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:12:49,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49 WrapperNode [2019-10-02 13:12:49,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:12:49,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:12:49,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:12:49,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:12:49,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... [2019-10-02 13:12:49,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:12:49,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:12:49,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:12:49,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:12:49,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:12:49,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:12:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:12:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:12:49,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:12:49,927 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:12:49,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:12:49,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:12:49,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:12:49,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:12:49,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:12:49,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:12:49,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:12:49,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:12:49,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:12:49,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:12:49,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:12:49,930 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:12:49,931 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:12:49,931 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:12:49,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:12:49,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:12:49,931 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:12:49,932 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:12:49,932 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:12:49,932 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:12:49,932 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:12:49,932 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:12:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 13:12:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:12:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:12:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:12:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:12:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:12:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:12:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:12:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:12:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:12:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:12:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:12:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:12:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:12:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:12:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:12:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:12:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:12:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:12:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:12:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:12:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:12:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:12:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:12:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:12:49,943 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:12:49,944 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:12:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:12:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:12:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:12:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:12:49,945 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:12:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:12:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:12:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:12:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:12:49,946 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:12:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:12:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:12:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:12:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:12:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:12:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:12:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:12:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:12:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:12:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:12:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:12:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:12:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:12:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:12:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:12:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:12:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:12:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:12:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:12:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:12:49,950 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:12:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:12:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:12:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:12:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:12:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:12:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:12:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:12:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:12:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:12:49,952 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:12:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:12:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:12:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:12:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:12:49,953 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:12:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:12:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:12:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:12:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:12:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:12:49,954 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:12:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:12:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:12:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:12:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:12:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:12:49,955 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:12:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:12:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:12:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:12:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:12:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:12:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:12:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:12:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:12:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:12:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:12:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:12:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:12:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:12:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:12:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:12:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:12:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:12:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:12:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:12:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:12:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:12:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:12:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:12:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:12:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:12:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:12:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:12:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:12:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:12:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:12:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 13:12:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:12:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:12:49,962 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:12:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:12:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:12:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:12:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:12:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:12:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:12:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:12:49,966 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:12:49,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:12:49,966 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:12:49,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:12:49,966 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:12:49,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:12:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:12:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:12:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:12:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:12:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:12:49,968 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:12:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:12:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:12:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:12:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:12:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:12:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:12:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:12:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:12:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:12:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:12:49,970 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:12:49,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:12:49,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:12:49,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:12:52,155 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:12:52,157 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:12:52,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:12:52 BoogieIcfgContainer [2019-10-02 13:12:52,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:12:52,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:12:52,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:12:52,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:12:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:12:48" (1/3) ... [2019-10-02 13:12:52,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48033af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:12:52, skipping insertion in model container [2019-10-02 13:12:52,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:12:49" (2/3) ... [2019-10-02 13:12:52,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48033af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:12:52, skipping insertion in model container [2019-10-02 13:12:52,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:12:52" (3/3) ... [2019-10-02 13:12:52,172 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product33.cil.c [2019-10-02 13:12:52,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:12:52,198 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:12:52,219 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:12:52,266 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:12:52,272 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:12:52,272 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:12:52,273 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:12:52,273 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:12:52,280 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:12:52,280 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:12:52,280 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:12:52,280 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:12:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states. [2019-10-02 13:12:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 13:12:52,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:52,371 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:52,375 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1585064684, now seen corresponding path program 1 times [2019-10-02 13:12:52,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:52,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:52,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:52,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:52,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:53,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:12:53,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:12:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:12:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:12:53,161 INFO L87 Difference]: Start difference. First operand 592 states. Second operand 2 states. [2019-10-02 13:12:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:53,241 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions. [2019-10-02 13:12:53,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:12:53,245 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 213 [2019-10-02 13:12:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:53,284 INFO L225 Difference]: With dead ends: 915 [2019-10-02 13:12:53,284 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 13:12:53,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:12:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 13:12:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 13:12:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 13:12:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 752 transitions. [2019-10-02 13:12:53,405 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 752 transitions. Word has length 213 [2019-10-02 13:12:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:53,407 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 752 transitions. [2019-10-02 13:12:53,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:12:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 752 transitions. [2019-10-02 13:12:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:12:53,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:53,415 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:53,415 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash -871145054, now seen corresponding path program 1 times [2019-10-02 13:12:53,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:53,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:53,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:53,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:53,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:53,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:53,722 INFO L87 Difference]: Start difference. First operand 569 states and 752 transitions. Second operand 3 states. [2019-10-02 13:12:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:53,805 INFO L93 Difference]: Finished difference Result 898 states and 1170 transitions. [2019-10-02 13:12:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:53,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-10-02 13:12:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:53,813 INFO L225 Difference]: With dead ends: 898 [2019-10-02 13:12:53,813 INFO L226 Difference]: Without dead ends: 572 [2019-10-02 13:12:53,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-02 13:12:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 571. [2019-10-02 13:12:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 13:12:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 754 transitions. [2019-10-02 13:12:53,901 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 754 transitions. Word has length 214 [2019-10-02 13:12:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:53,902 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 754 transitions. [2019-10-02 13:12:53,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 754 transitions. [2019-10-02 13:12:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 13:12:53,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:53,912 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:53,912 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:53,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash 169428497, now seen corresponding path program 1 times [2019-10-02 13:12:53,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:53,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:53,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:53,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:53,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:54,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:54,179 INFO L87 Difference]: Start difference. First operand 571 states and 754 transitions. Second operand 3 states. [2019-10-02 13:12:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:54,228 INFO L93 Difference]: Finished difference Result 1120 states and 1509 transitions. [2019-10-02 13:12:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:54,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-02 13:12:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:54,237 INFO L225 Difference]: With dead ends: 1120 [2019-10-02 13:12:54,237 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 13:12:54,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 13:12:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 613. [2019-10-02 13:12:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 13:12:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 826 transitions. [2019-10-02 13:12:54,289 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 826 transitions. Word has length 226 [2019-10-02 13:12:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:54,291 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 826 transitions. [2019-10-02 13:12:54,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 826 transitions. [2019-10-02 13:12:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 13:12:54,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:54,299 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:54,299 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1807873467, now seen corresponding path program 1 times [2019-10-02 13:12:54,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:54,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:54,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:54,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:54,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:54,532 INFO L87 Difference]: Start difference. First operand 613 states and 826 transitions. Second operand 3 states. [2019-10-02 13:12:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:54,597 INFO L93 Difference]: Finished difference Result 1243 states and 1720 transitions. [2019-10-02 13:12:54,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:54,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-02 13:12:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:54,612 INFO L225 Difference]: With dead ends: 1243 [2019-10-02 13:12:54,612 INFO L226 Difference]: Without dead ends: 695 [2019-10-02 13:12:54,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-10-02 13:12:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2019-10-02 13:12:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 13:12:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 964 transitions. [2019-10-02 13:12:54,669 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 964 transitions. Word has length 227 [2019-10-02 13:12:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:54,670 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 964 transitions. [2019-10-02 13:12:54,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 964 transitions. [2019-10-02 13:12:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:12:54,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:54,681 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:54,681 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:54,682 INFO L82 PathProgramCache]: Analyzing trace with hash -351968527, now seen corresponding path program 1 times [2019-10-02 13:12:54,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:54,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:54,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:54,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:12:55,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:55,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:55,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:55,138 INFO L87 Difference]: Start difference. First operand 694 states and 964 transitions. Second operand 3 states. [2019-10-02 13:12:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:55,191 INFO L93 Difference]: Finished difference Result 1480 states and 2124 transitions. [2019-10-02 13:12:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:55,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-10-02 13:12:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:55,198 INFO L225 Difference]: With dead ends: 1480 [2019-10-02 13:12:55,199 INFO L226 Difference]: Without dead ends: 851 [2019-10-02 13:12:55,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-10-02 13:12:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 850. [2019-10-02 13:12:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-10-02 13:12:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1228 transitions. [2019-10-02 13:12:55,254 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1228 transitions. Word has length 228 [2019-10-02 13:12:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:55,255 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1228 transitions. [2019-10-02 13:12:55,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1228 transitions. [2019-10-02 13:12:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:12:55,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:55,261 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:12:55,262 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash -624836209, now seen corresponding path program 1 times [2019-10-02 13:12:55,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:12:55,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:12:55,751 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:12:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:56,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 3007 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:12:56,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:12:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:12:56,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:12:56,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:12:56,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:12:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:12:56,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:12:56,971 INFO L87 Difference]: Start difference. First operand 850 states and 1228 transitions. Second operand 26 states. [2019-10-02 13:13:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:07,389 INFO L93 Difference]: Finished difference Result 3187 states and 4625 transitions. [2019-10-02 13:13:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:13:07,390 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 230 [2019-10-02 13:13:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:07,432 INFO L225 Difference]: With dead ends: 3187 [2019-10-02 13:13:07,432 INFO L226 Difference]: Without dead ends: 2373 [2019-10-02 13:13:07,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:13:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-10-02 13:13:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2336. [2019-10-02 13:13:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-10-02 13:13:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3363 transitions. [2019-10-02 13:13:07,605 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3363 transitions. Word has length 230 [2019-10-02 13:13:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:07,607 INFO L475 AbstractCegarLoop]: Abstraction has 2336 states and 3363 transitions. [2019-10-02 13:13:07,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:13:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3363 transitions. [2019-10-02 13:13:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:13:07,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:07,619 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:07,619 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1373971187, now seen corresponding path program 1 times [2019-10-02 13:13:07,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:07,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:07,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:07,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:07,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:08,160 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:13:08,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:08,161 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:13:08,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:08,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 3009 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:08,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 13:13:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:09,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:13:09,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:13:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:13:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:13:09,148 INFO L87 Difference]: Start difference. First operand 2336 states and 3363 transitions. Second operand 20 states. [2019-10-02 13:13:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:17,297 INFO L93 Difference]: Finished difference Result 4727 states and 6881 transitions. [2019-10-02 13:13:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:13:17,298 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 232 [2019-10-02 13:13:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:17,314 INFO L225 Difference]: With dead ends: 4727 [2019-10-02 13:13:17,314 INFO L226 Difference]: Without dead ends: 2442 [2019-10-02 13:13:17,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:13:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-10-02 13:13:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2410. [2019-10-02 13:13:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-10-02 13:13:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3483 transitions. [2019-10-02 13:13:17,460 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3483 transitions. Word has length 232 [2019-10-02 13:13:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:17,461 INFO L475 AbstractCegarLoop]: Abstraction has 2410 states and 3483 transitions. [2019-10-02 13:13:17,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:13:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3483 transitions. [2019-10-02 13:13:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:13:17,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:17,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:17,476 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 485938979, now seen corresponding path program 1 times [2019-10-02 13:13:17,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:17,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 13:13:17,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:17,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:13:17,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:13:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:13:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:13:17,686 INFO L87 Difference]: Start difference. First operand 2410 states and 3483 transitions. Second operand 5 states. [2019-10-02 13:13:17,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:17,822 INFO L93 Difference]: Finished difference Result 3435 states and 4830 transitions. [2019-10-02 13:13:17,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:13:17,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-10-02 13:13:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:17,843 INFO L225 Difference]: With dead ends: 3435 [2019-10-02 13:13:17,843 INFO L226 Difference]: Without dead ends: 2047 [2019-10-02 13:13:17,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:13:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2019-10-02 13:13:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2047. [2019-10-02 13:13:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-10-02 13:13:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2988 transitions. [2019-10-02 13:13:18,022 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2988 transitions. Word has length 237 [2019-10-02 13:13:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:18,023 INFO L475 AbstractCegarLoop]: Abstraction has 2047 states and 2988 transitions. [2019-10-02 13:13:18,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:13:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2988 transitions. [2019-10-02 13:13:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:13:18,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:18,048 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:18,049 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:18,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1809448881, now seen corresponding path program 1 times [2019-10-02 13:13:18,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:18,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:13:18,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:18,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:13:18,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:13:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:13:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:13:18,608 INFO L87 Difference]: Start difference. First operand 2047 states and 2988 transitions. Second operand 16 states. [2019-10-02 13:13:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:19,025 INFO L93 Difference]: Finished difference Result 3144 states and 4451 transitions. [2019-10-02 13:13:19,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:13:19,026 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 233 [2019-10-02 13:13:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:19,039 INFO L225 Difference]: With dead ends: 3144 [2019-10-02 13:13:19,039 INFO L226 Difference]: Without dead ends: 2099 [2019-10-02 13:13:19,044 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:13:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2019-10-02 13:13:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2081. [2019-10-02 13:13:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 13:13:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3032 transitions. [2019-10-02 13:13:19,147 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3032 transitions. Word has length 233 [2019-10-02 13:13:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:19,149 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3032 transitions. [2019-10-02 13:13:19,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:13:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3032 transitions. [2019-10-02 13:13:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:13:19,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:19,158 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:19,159 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1470071557, now seen corresponding path program 1 times [2019-10-02 13:13:19,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:19,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:19,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:19,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:19,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:19,399 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:19,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:20,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 3010 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:20,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:20,221 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:13:20,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:20,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:20,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:20,243 INFO L87 Difference]: Start difference. First operand 2081 states and 3032 transitions. Second operand 12 states. [2019-10-02 13:13:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:25,032 INFO L93 Difference]: Finished difference Result 6332 states and 9239 transitions. [2019-10-02 13:13:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:13:25,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 233 [2019-10-02 13:13:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:25,062 INFO L225 Difference]: With dead ends: 6332 [2019-10-02 13:13:25,062 INFO L226 Difference]: Without dead ends: 4312 [2019-10-02 13:13:25,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 235 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:13:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2019-10-02 13:13:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4281. [2019-10-02 13:13:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-10-02 13:13:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 6181 transitions. [2019-10-02 13:13:25,294 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 6181 transitions. Word has length 233 [2019-10-02 13:13:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:25,295 INFO L475 AbstractCegarLoop]: Abstraction has 4281 states and 6181 transitions. [2019-10-02 13:13:25,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 6181 transitions. [2019-10-02 13:13:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:13:25,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:25,312 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:25,312 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash -342591528, now seen corresponding path program 1 times [2019-10-02 13:13:25,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:25,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:25,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:25,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:25,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:25,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:25,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:25,678 INFO L87 Difference]: Start difference. First operand 4281 states and 6181 transitions. Second operand 7 states. [2019-10-02 13:13:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:28,052 INFO L93 Difference]: Finished difference Result 12411 states and 17592 transitions. [2019-10-02 13:13:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:13:28,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2019-10-02 13:13:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:28,131 INFO L225 Difference]: With dead ends: 12411 [2019-10-02 13:13:28,131 INFO L226 Difference]: Without dead ends: 9767 [2019-10-02 13:13:28,147 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:13:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-10-02 13:13:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9749. [2019-10-02 13:13:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9749 states. [2019-10-02 13:13:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 13795 transitions. [2019-10-02 13:13:29,272 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 13795 transitions. Word has length 234 [2019-10-02 13:13:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:29,273 INFO L475 AbstractCegarLoop]: Abstraction has 9749 states and 13795 transitions. [2019-10-02 13:13:29,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:13:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 13795 transitions. [2019-10-02 13:13:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:13:29,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:29,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:29,290 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:29,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2027569839, now seen corresponding path program 1 times [2019-10-02 13:13:29,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:29,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:13:29,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:13:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:13:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:13:29,823 INFO L87 Difference]: Start difference. First operand 9749 states and 13795 transitions. Second operand 24 states. [2019-10-02 13:13:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:30,729 INFO L93 Difference]: Finished difference Result 17980 states and 25305 transitions. [2019-10-02 13:13:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:13:30,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 235 [2019-10-02 13:13:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:30,779 INFO L225 Difference]: With dead ends: 17980 [2019-10-02 13:13:30,779 INFO L226 Difference]: Without dead ends: 9098 [2019-10-02 13:13:30,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:13:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-10-02 13:13:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8982. [2019-10-02 13:13:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8982 states. [2019-10-02 13:13:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8982 states to 8982 states and 12761 transitions. [2019-10-02 13:13:31,272 INFO L78 Accepts]: Start accepts. Automaton has 8982 states and 12761 transitions. Word has length 235 [2019-10-02 13:13:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:31,275 INFO L475 AbstractCegarLoop]: Abstraction has 8982 states and 12761 transitions. [2019-10-02 13:13:31,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:13:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8982 states and 12761 transitions. [2019-10-02 13:13:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:13:31,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:31,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:31,293 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 684385333, now seen corresponding path program 1 times [2019-10-02 13:13:31,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:31,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:31,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:31,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:31,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:13:31,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:13:31,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:13:31,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:13:31,661 INFO L87 Difference]: Start difference. First operand 8982 states and 12761 transitions. Second operand 10 states. [2019-10-02 13:13:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:31,930 INFO L93 Difference]: Finished difference Result 15347 states and 21480 transitions. [2019-10-02 13:13:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:13:31,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2019-10-02 13:13:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:31,985 INFO L225 Difference]: With dead ends: 15347 [2019-10-02 13:13:31,985 INFO L226 Difference]: Without dead ends: 9462 [2019-10-02 13:13:32,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:13:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9462 states. [2019-10-02 13:13:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9462 to 9078. [2019-10-02 13:13:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9078 states. [2019-10-02 13:13:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9078 states to 9078 states and 12865 transitions. [2019-10-02 13:13:32,463 INFO L78 Accepts]: Start accepts. Automaton has 9078 states and 12865 transitions. Word has length 239 [2019-10-02 13:13:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:32,464 INFO L475 AbstractCegarLoop]: Abstraction has 9078 states and 12865 transitions. [2019-10-02 13:13:32,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:13:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 9078 states and 12865 transitions. [2019-10-02 13:13:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 13:13:32,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:32,484 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:32,484 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1380931015, now seen corresponding path program 1 times [2019-10-02 13:13:32,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:32,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:32,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:13:32,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:32,651 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:32,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:33,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:33,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:13:33,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:33,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:33,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:33,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:33,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:33,510 INFO L87 Difference]: Start difference. First operand 9078 states and 12865 transitions. Second operand 12 states. [2019-10-02 13:13:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:36,100 INFO L93 Difference]: Finished difference Result 18252 states and 25977 transitions. [2019-10-02 13:13:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:13:36,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 244 [2019-10-02 13:13:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:36,148 INFO L225 Difference]: With dead ends: 18252 [2019-10-02 13:13:36,148 INFO L226 Difference]: Without dead ends: 9249 [2019-10-02 13:13:36,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9249 states. [2019-10-02 13:13:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9249 to 9160. [2019-10-02 13:13:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9160 states. [2019-10-02 13:13:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9160 states to 9160 states and 13003 transitions. [2019-10-02 13:13:36,639 INFO L78 Accepts]: Start accepts. Automaton has 9160 states and 13003 transitions. Word has length 244 [2019-10-02 13:13:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:36,639 INFO L475 AbstractCegarLoop]: Abstraction has 9160 states and 13003 transitions. [2019-10-02 13:13:36,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 9160 states and 13003 transitions. [2019-10-02 13:13:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 13:13:36,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:36,659 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:36,659 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1164618804, now seen corresponding path program 1 times [2019-10-02 13:13:36,660 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:36,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:36,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:13:36,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:36,893 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:37,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:37,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:37,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:13:37,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:37,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 13:13:37,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:13:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:13:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:13:37,760 INFO L87 Difference]: Start difference. First operand 9160 states and 13003 transitions. Second operand 16 states. [2019-10-02 13:13:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:40,139 INFO L93 Difference]: Finished difference Result 18254 states and 25987 transitions. [2019-10-02 13:13:40,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:13:40,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 245 [2019-10-02 13:13:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:40,177 INFO L225 Difference]: With dead ends: 18254 [2019-10-02 13:13:40,177 INFO L226 Difference]: Without dead ends: 9174 [2019-10-02 13:13:40,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:13:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9174 states. [2019-10-02 13:13:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9174 to 9122. [2019-10-02 13:13:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9122 states. [2019-10-02 13:13:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 12928 transitions. [2019-10-02 13:13:40,640 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 12928 transitions. Word has length 245 [2019-10-02 13:13:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:40,640 INFO L475 AbstractCegarLoop]: Abstraction has 9122 states and 12928 transitions. [2019-10-02 13:13:40,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:13:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 12928 transitions. [2019-10-02 13:13:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:13:40,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:40,659 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:40,659 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -450557509, now seen corresponding path program 1 times [2019-10-02 13:13:40,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:40,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 13:13:40,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:40,849 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:41,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:41,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:41,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:41,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:13:41,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:13:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:13:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:13:41,631 INFO L87 Difference]: Start difference. First operand 9122 states and 12928 transitions. Second operand 11 states. [2019-10-02 13:13:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:44,184 INFO L93 Difference]: Finished difference Result 27289 states and 38950 transitions. [2019-10-02 13:13:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:13:44,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2019-10-02 13:13:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:44,265 INFO L225 Difference]: With dead ends: 27289 [2019-10-02 13:13:44,265 INFO L226 Difference]: Without dead ends: 18247 [2019-10-02 13:13:44,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:13:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18247 states. [2019-10-02 13:13:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18247 to 18071. [2019-10-02 13:13:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18071 states. [2019-10-02 13:13:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18071 states to 18071 states and 25804 transitions. [2019-10-02 13:13:45,523 INFO L78 Accepts]: Start accepts. Automaton has 18071 states and 25804 transitions. Word has length 247 [2019-10-02 13:13:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:45,523 INFO L475 AbstractCegarLoop]: Abstraction has 18071 states and 25804 transitions. [2019-10-02 13:13:45,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:13:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18071 states and 25804 transitions. [2019-10-02 13:13:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 13:13:45,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:45,603 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:45,603 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1754298430, now seen corresponding path program 1 times [2019-10-02 13:13:45,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:45,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:45,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:45,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:13:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:45,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:45,841 INFO L87 Difference]: Start difference. First operand 18071 states and 25804 transitions. Second operand 7 states. [2019-10-02 13:13:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:49,492 INFO L93 Difference]: Finished difference Result 47641 states and 66378 transitions. [2019-10-02 13:13:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:13:49,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2019-10-02 13:13:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:49,628 INFO L225 Difference]: With dead ends: 47641 [2019-10-02 13:13:49,628 INFO L226 Difference]: Without dead ends: 33168 [2019-10-02 13:13:49,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:13:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33168 states. [2019-10-02 13:13:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33168 to 32903. [2019-10-02 13:13:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32903 states. [2019-10-02 13:13:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32903 states to 32903 states and 46160 transitions. [2019-10-02 13:13:52,569 INFO L78 Accepts]: Start accepts. Automaton has 32903 states and 46160 transitions. Word has length 249 [2019-10-02 13:13:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:52,570 INFO L475 AbstractCegarLoop]: Abstraction has 32903 states and 46160 transitions. [2019-10-02 13:13:52,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:13:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 32903 states and 46160 transitions. [2019-10-02 13:13:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 13:13:52,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:52,599 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:52,600 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1284300722, now seen corresponding path program 1 times [2019-10-02 13:13:52,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:52,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:52,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:13:53,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:53,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 13:13:53,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:13:53,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:13:53,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:13:53,173 INFO L87 Difference]: Start difference. First operand 32903 states and 46160 transitions. Second operand 30 states. [2019-10-02 13:13:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:55,357 INFO L93 Difference]: Finished difference Result 64505 states and 89742 transitions. [2019-10-02 13:13:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:13:55,358 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 250 [2019-10-02 13:13:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:55,512 INFO L225 Difference]: With dead ends: 64505 [2019-10-02 13:13:55,512 INFO L226 Difference]: Without dead ends: 33904 [2019-10-02 13:13:55,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:13:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33904 states. [2019-10-02 13:13:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33904 to 33743. [2019-10-02 13:13:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33743 states. [2019-10-02 13:13:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33743 states to 33743 states and 47076 transitions. [2019-10-02 13:13:56,977 INFO L78 Accepts]: Start accepts. Automaton has 33743 states and 47076 transitions. Word has length 250 [2019-10-02 13:13:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:56,977 INFO L475 AbstractCegarLoop]: Abstraction has 33743 states and 47076 transitions. [2019-10-02 13:13:56,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:13:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33743 states and 47076 transitions. [2019-10-02 13:13:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 13:13:57,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:57,012 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:57,012 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash 941120324, now seen corresponding path program 1 times [2019-10-02 13:13:57,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:57,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:57,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:13:57,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:57,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:13:57,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:13:57,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:13:57,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:13:57,300 INFO L87 Difference]: Start difference. First operand 33743 states and 47076 transitions. Second operand 8 states. [2019-10-02 13:14:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:05,699 INFO L93 Difference]: Finished difference Result 129287 states and 180672 transitions. [2019-10-02 13:14:05,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:14:05,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 281 [2019-10-02 13:14:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:06,196 INFO L225 Difference]: With dead ends: 129287 [2019-10-02 13:14:06,197 INFO L226 Difference]: Without dead ends: 99174 [2019-10-02 13:14:06,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:14:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99174 states. [2019-10-02 13:14:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99174 to 99004. [2019-10-02 13:14:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99004 states. [2019-10-02 13:14:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99004 states to 99004 states and 138362 transitions. [2019-10-02 13:14:12,199 INFO L78 Accepts]: Start accepts. Automaton has 99004 states and 138362 transitions. Word has length 281 [2019-10-02 13:14:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:12,200 INFO L475 AbstractCegarLoop]: Abstraction has 99004 states and 138362 transitions. [2019-10-02 13:14:12,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:14:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 99004 states and 138362 transitions. [2019-10-02 13:14:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 13:14:12,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:12,244 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:12,244 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:12,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1784117294, now seen corresponding path program 1 times [2019-10-02 13:14:12,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:12,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:12,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:14:12,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:14:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:14:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:14:12,689 INFO L87 Difference]: Start difference. First operand 99004 states and 138362 transitions. Second operand 22 states. [2019-10-02 13:14:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:17,636 INFO L93 Difference]: Finished difference Result 148199 states and 205383 transitions. [2019-10-02 13:14:17,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 13:14:17,637 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 282 [2019-10-02 13:14:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:17,988 INFO L225 Difference]: With dead ends: 148199 [2019-10-02 13:14:17,988 INFO L226 Difference]: Without dead ends: 78318 [2019-10-02 13:14:18,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:14:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78318 states. [2019-10-02 13:14:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78318 to 75766. [2019-10-02 13:14:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75766 states. [2019-10-02 13:14:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75766 states to 75766 states and 106294 transitions. [2019-10-02 13:14:20,936 INFO L78 Accepts]: Start accepts. Automaton has 75766 states and 106294 transitions. Word has length 282 [2019-10-02 13:14:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:20,937 INFO L475 AbstractCegarLoop]: Abstraction has 75766 states and 106294 transitions. [2019-10-02 13:14:20,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:14:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 75766 states and 106294 transitions. [2019-10-02 13:14:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 13:14:20,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:20,977 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:20,977 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1684989870, now seen corresponding path program 1 times [2019-10-02 13:14:20,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:20,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:20,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:21,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:21,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:14:21,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:14:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:14:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:14:21,216 INFO L87 Difference]: Start difference. First operand 75766 states and 106294 transitions. Second operand 8 states. [2019-10-02 13:14:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:27,599 INFO L93 Difference]: Finished difference Result 213057 states and 297572 transitions. [2019-10-02 13:14:27,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:14:27,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 291 [2019-10-02 13:14:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:28,161 INFO L225 Difference]: With dead ends: 213057 [2019-10-02 13:14:28,161 INFO L226 Difference]: Without dead ends: 151935 [2019-10-02 13:14:28,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:14:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151935 states. [2019-10-02 13:14:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151935 to 150694. [2019-10-02 13:14:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150694 states. [2019-10-02 13:14:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150694 states to 150694 states and 210667 transitions. [2019-10-02 13:14:34,079 INFO L78 Accepts]: Start accepts. Automaton has 150694 states and 210667 transitions. Word has length 291 [2019-10-02 13:14:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:34,079 INFO L475 AbstractCegarLoop]: Abstraction has 150694 states and 210667 transitions. [2019-10-02 13:14:34,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:14:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 150694 states and 210667 transitions. [2019-10-02 13:14:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 13:14:34,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:34,182 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:34,182 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash -849290948, now seen corresponding path program 1 times [2019-10-02 13:14:34,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:34,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:34,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 13:14:37,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:14:37,743 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:14:37,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:38,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 3209 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:14:38,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:14:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:14:38,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:14:38,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-10-02 13:14:38,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:14:38,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:14:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:14:38,472 INFO L87 Difference]: Start difference. First operand 150694 states and 210667 transitions. Second operand 17 states. [2019-10-02 13:14:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:46,404 INFO L93 Difference]: Finished difference Result 304798 states and 428043 transitions. [2019-10-02 13:14:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:14:46,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 292 [2019-10-02 13:14:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:46,910 INFO L225 Difference]: With dead ends: 304798 [2019-10-02 13:14:46,911 INFO L226 Difference]: Without dead ends: 156961 [2019-10-02 13:14:47,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:14:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156961 states. [2019-10-02 13:14:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156961 to 150790. [2019-10-02 13:14:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150790 states. [2019-10-02 13:14:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150790 states to 150790 states and 210817 transitions. [2019-10-02 13:14:58,036 INFO L78 Accepts]: Start accepts. Automaton has 150790 states and 210817 transitions. Word has length 292 [2019-10-02 13:14:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:58,036 INFO L475 AbstractCegarLoop]: Abstraction has 150790 states and 210817 transitions. [2019-10-02 13:14:58,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:14:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 150790 states and 210817 transitions. [2019-10-02 13:14:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 13:14:58,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:58,116 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:58,116 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -325839103, now seen corresponding path program 1 times [2019-10-02 13:14:58,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:58,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:14:58,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:58,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:14:58,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:14:58,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:14:58,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:14:58,260 INFO L87 Difference]: Start difference. First operand 150790 states and 210817 transitions. Second operand 3 states. [2019-10-02 13:15:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:06,633 INFO L93 Difference]: Finished difference Result 303266 states and 424897 transitions. [2019-10-02 13:15:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:15:06,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-10-02 13:15:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:07,200 INFO L225 Difference]: With dead ends: 303266 [2019-10-02 13:15:07,200 INFO L226 Difference]: Without dead ends: 152608 [2019-10-02 13:15:07,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152608 states. [2019-10-02 13:15:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152608 to 152602. [2019-10-02 13:15:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152602 states. [2019-10-02 13:15:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152602 states to 152602 states and 214188 transitions. [2019-10-02 13:15:14,136 INFO L78 Accepts]: Start accepts. Automaton has 152602 states and 214188 transitions. Word has length 291 [2019-10-02 13:15:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:14,137 INFO L475 AbstractCegarLoop]: Abstraction has 152602 states and 214188 transitions. [2019-10-02 13:15:14,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:15:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 152602 states and 214188 transitions. [2019-10-02 13:15:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 13:15:14,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:14,215 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:14,215 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash -370600705, now seen corresponding path program 1 times [2019-10-02 13:15:14,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:14,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:14,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:14,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:14,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:15:14,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:14,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:15:14,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:15:14,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:15:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:14,364 INFO L87 Difference]: Start difference. First operand 152602 states and 214188 transitions. Second operand 3 states. [2019-10-02 13:15:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:22,597 INFO L93 Difference]: Finished difference Result 308525 states and 434635 transitions. [2019-10-02 13:15:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:15:22,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-02 13:15:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:23,128 INFO L225 Difference]: With dead ends: 308525 [2019-10-02 13:15:23,128 INFO L226 Difference]: Without dead ends: 156076 [2019-10-02 13:15:23,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156076 states. [2019-10-02 13:15:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156076 to 156070. [2019-10-02 13:15:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156070 states. [2019-10-02 13:15:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156070 states to 156070 states and 220535 transitions. [2019-10-02 13:15:29,843 INFO L78 Accepts]: Start accepts. Automaton has 156070 states and 220535 transitions. Word has length 292 [2019-10-02 13:15:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:29,844 INFO L475 AbstractCegarLoop]: Abstraction has 156070 states and 220535 transitions. [2019-10-02 13:15:29,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:15:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 156070 states and 220535 transitions. [2019-10-02 13:15:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 13:15:30,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:30,875 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:30,875 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1866562657, now seen corresponding path program 1 times [2019-10-02 13:15:30,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:30,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:30,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:15:31,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:31,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:15:31,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:15:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:15:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:31,008 INFO L87 Difference]: Start difference. First operand 156070 states and 220535 transitions. Second operand 3 states. [2019-10-02 13:15:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:39,049 INFO L93 Difference]: Finished difference Result 318603 states and 453349 transitions. [2019-10-02 13:15:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:15:39,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-10-02 13:15:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:39,664 INFO L225 Difference]: With dead ends: 318603 [2019-10-02 13:15:39,665 INFO L226 Difference]: Without dead ends: 162702 [2019-10-02 13:15:39,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162702 states. [2019-10-02 13:15:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162702 to 162696. [2019-10-02 13:15:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162696 states. [2019-10-02 13:15:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162696 states to 162696 states and 232824 transitions. [2019-10-02 13:15:50,711 INFO L78 Accepts]: Start accepts. Automaton has 162696 states and 232824 transitions. Word has length 293 [2019-10-02 13:15:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:50,711 INFO L475 AbstractCegarLoop]: Abstraction has 162696 states and 232824 transitions. [2019-10-02 13:15:50,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:15:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 162696 states and 232824 transitions. [2019-10-02 13:15:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:15:50,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:50,832 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:50,832 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 399320991, now seen corresponding path program 1 times [2019-10-02 13:15:50,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:50,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:15:50,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:50,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:15:50,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:15:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:15:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:50,976 INFO L87 Difference]: Start difference. First operand 162696 states and 232824 transitions. Second operand 3 states. [2019-10-02 13:15:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:57,805 INFO L93 Difference]: Finished difference Result 337897 states and 489247 transitions. [2019-10-02 13:15:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:15:57,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-10-02 13:15:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:58,328 INFO L225 Difference]: With dead ends: 337897 [2019-10-02 13:15:58,328 INFO L226 Difference]: Without dead ends: 175376 [2019-10-02 13:15:58,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175376 states. [2019-10-02 13:16:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175376 to 175370. [2019-10-02 13:16:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175370 states. [2019-10-02 13:16:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175370 states to 175370 states and 256249 transitions. [2019-10-02 13:16:11,918 INFO L78 Accepts]: Start accepts. Automaton has 175370 states and 256249 transitions. Word has length 294 [2019-10-02 13:16:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:11,919 INFO L475 AbstractCegarLoop]: Abstraction has 175370 states and 256249 transitions. [2019-10-02 13:16:11,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:16:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 175370 states and 256249 transitions. [2019-10-02 13:16:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 13:16:12,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:12,127 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:12,127 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1926139455, now seen corresponding path program 1 times [2019-10-02 13:16:12,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:12,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:12,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:16:12,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:12,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:16:12,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:16:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:16:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:12,283 INFO L87 Difference]: Start difference. First operand 175370 states and 256249 transitions. Second operand 3 states. [2019-10-02 13:16:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:23,056 INFO L93 Difference]: Finished difference Result 376297 states and 559900 transitions. [2019-10-02 13:16:23,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:16:23,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-10-02 13:16:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:23,716 INFO L225 Difference]: With dead ends: 376297 [2019-10-02 13:16:23,717 INFO L226 Difference]: Without dead ends: 201106 [2019-10-02 13:16:23,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201106 states. [2019-10-02 13:16:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201106 to 201100. [2019-10-02 13:16:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201100 states. [2019-10-02 13:16:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201100 states to 201100 states and 303098 transitions. [2019-10-02 13:16:34,026 INFO L78 Accepts]: Start accepts. Automaton has 201100 states and 303098 transitions. Word has length 295 [2019-10-02 13:16:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:34,027 INFO L475 AbstractCegarLoop]: Abstraction has 201100 states and 303098 transitions. [2019-10-02 13:16:34,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:16:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 201100 states and 303098 transitions. [2019-10-02 13:16:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:16:34,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:34,348 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:34,348 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -578573761, now seen corresponding path program 1 times [2019-10-02 13:16:34,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:34,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:16:34,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:34,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:16:34,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:16:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:16:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:34,503 INFO L87 Difference]: Start difference. First operand 201100 states and 303098 transitions. Second operand 3 states. [2019-10-02 13:16:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:47,486 INFO L93 Difference]: Finished difference Result 449644 states and 691222 transitions. [2019-10-02 13:16:47,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:16:47,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-10-02 13:16:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:48,388 INFO L225 Difference]: With dead ends: 449644 [2019-10-02 13:16:48,389 INFO L226 Difference]: Without dead ends: 248734 [2019-10-02 13:16:48,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248734 states. [2019-10-02 13:17:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248734 to 248728. [2019-10-02 13:17:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248728 states. [2019-10-02 13:17:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248728 states to 248728 states and 386821 transitions. [2019-10-02 13:17:06,941 INFO L78 Accepts]: Start accepts. Automaton has 248728 states and 386821 transitions. Word has length 296 [2019-10-02 13:17:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:17:06,941 INFO L475 AbstractCegarLoop]: Abstraction has 248728 states and 386821 transitions. [2019-10-02 13:17:06,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:17:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 248728 states and 386821 transitions. [2019-10-02 13:17:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:17:07,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:17:07,457 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:17:07,458 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:17:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:17:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1097977699, now seen corresponding path program 1 times [2019-10-02 13:17:07,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:17:07,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:17:07,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:07,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:07,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:17:07,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:17:07,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:17:07,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:17:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:17:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:17:07,629 INFO L87 Difference]: Start difference. First operand 248728 states and 386821 transitions. Second operand 3 states. [2019-10-02 13:17:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:17:28,649 INFO L93 Difference]: Finished difference Result 587882 states and 937744 transitions. [2019-10-02 13:17:28,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:17:28,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-10-02 13:17:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:17:29,837 INFO L225 Difference]: With dead ends: 587882 [2019-10-02 13:17:29,837 INFO L226 Difference]: Without dead ends: 339360 [2019-10-02 13:17:30,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:17:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339360 states. [2019-10-02 13:17:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339360 to 339354. [2019-10-02 13:17:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339354 states. [2019-10-02 13:18:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339354 states to 339354 states and 548102 transitions. [2019-10-02 13:18:00,954 INFO L78 Accepts]: Start accepts. Automaton has 339354 states and 548102 transitions. Word has length 297 [2019-10-02 13:18:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:18:00,955 INFO L475 AbstractCegarLoop]: Abstraction has 339354 states and 548102 transitions. [2019-10-02 13:18:00,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:18:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 339354 states and 548102 transitions. [2019-10-02 13:18:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:18:02,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:18:02,035 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:18:02,035 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:18:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:18:02,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1500620063, now seen corresponding path program 1 times [2019-10-02 13:18:02,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:18:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:18:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:18:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:18:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:18:02,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:18:02,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:18:02,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:18:02,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:18:02,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:02,217 INFO L87 Difference]: Start difference. First operand 339354 states and 548102 transitions. Second operand 3 states. [2019-10-02 13:18:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:18:30,409 INFO L93 Difference]: Finished difference Result 659205 states and 1051699 transitions. [2019-10-02 13:18:30,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:18:30,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-02 13:18:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:18:33,422 INFO L225 Difference]: With dead ends: 659205 [2019-10-02 13:18:33,423 INFO L226 Difference]: Without dead ends: 511368 [2019-10-02 13:18:33,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511368 states. [2019-10-02 13:19:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511368 to 511362. [2019-10-02 13:19:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511362 states. [2019-10-02 13:19:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511362 states to 511362 states and 839911 transitions. [2019-10-02 13:19:24,586 INFO L78 Accepts]: Start accepts. Automaton has 511362 states and 839911 transitions. Word has length 298 [2019-10-02 13:19:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:24,586 INFO L475 AbstractCegarLoop]: Abstraction has 511362 states and 839911 transitions. [2019-10-02 13:19:24,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 511362 states and 839911 transitions. [2019-10-02 13:19:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 13:19:28,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:28,233 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:28,233 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 126805123, now seen corresponding path program 1 times [2019-10-02 13:19:28,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:19:28,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:19:28,644 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:19:28,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:29,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 3236 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:19:29,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:19:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:19:29,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:19:29,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 37 [2019-10-02 13:19:29,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 13:19:29,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 13:19:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:19:29,841 INFO L87 Difference]: Start difference. First operand 511362 states and 839911 transitions. Second operand 37 states. [2019-10-02 13:20:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:17,733 INFO L93 Difference]: Finished difference Result 679362 states and 1089585 transitions. [2019-10-02 13:20:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-02 13:20:17,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 299 [2019-10-02 13:20:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:19,844 INFO L225 Difference]: With dead ends: 679362 [2019-10-02 13:20:19,845 INFO L226 Difference]: Without dead ends: 571765 [2019-10-02 13:20:20,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=881, Invalid=8821, Unknown=0, NotChecked=0, Total=9702 [2019-10-02 13:20:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571765 states. [2019-10-02 13:21:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571765 to 562080. [2019-10-02 13:21:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562080 states. [2019-10-02 13:21:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562080 states to 562080 states and 919519 transitions. [2019-10-02 13:21:25,082 INFO L78 Accepts]: Start accepts. Automaton has 562080 states and 919519 transitions. Word has length 299 [2019-10-02 13:21:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:25,082 INFO L475 AbstractCegarLoop]: Abstraction has 562080 states and 919519 transitions. [2019-10-02 13:21:25,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 13:21:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 562080 states and 919519 transitions. [2019-10-02 13:21:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:21:26,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:26,896 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:26,896 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -344291383, now seen corresponding path program 1 times [2019-10-02 13:21:26,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:26,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 13:21:27,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:27,130 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:21:27,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:27,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 3235 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 13:21:27,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:21:29,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:21:29,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:21:29,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:21:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:21:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:21:29,757 INFO L87 Difference]: Start difference. First operand 562080 states and 919519 transitions. Second operand 18 states.