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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product40.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:38:47,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:38:47,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:38:47,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:38:47,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:38:47,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:38:47,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:38:47,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:38:47,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:38:47,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:38:47,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:38:47,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:38:47,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:38:47,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:38:47,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:38:47,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:38:47,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:38:47,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:38:47,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:38:47,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:38:47,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:38:47,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:38:47,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:38:47,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:38:47,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:38:47,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:38:47,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:38:47,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:38:47,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:38:47,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:38:47,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:38:47,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:38:47,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:38:47,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:38:47,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:38:47,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:38:47,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:38:47,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:38:47,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:38:47,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:38:47,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:38:47,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:38:47,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:38:47,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:38:47,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:38:47,531 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:38:47,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:38:47,532 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:38:47,532 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:38:47,533 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:38:47,533 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:38:47,533 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:38:47,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:38:47,536 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:38:47,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:38:47,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:38:47,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:38:47,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:38:47,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:38:47,537 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:38:47,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:38:47,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:38:47,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:38:47,538 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:38:47,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:38:47,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:38:47,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:38:47,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:38:47,539 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:38:47,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:38:47,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:38:47,540 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:38:47,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:38:47,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:38:47,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:38:47,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:38:47,606 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:38:47,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product40.cil.c [2019-09-10 02:38:47,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e48c429/25ff34abe06c41d69b560940ba3d99e8/FLAG88bd3e239 [2019-09-10 02:38:48,385 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:38:48,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product40.cil.c [2019-09-10 02:38:48,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e48c429/25ff34abe06c41d69b560940ba3d99e8/FLAG88bd3e239 [2019-09-10 02:38:48,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e48c429/25ff34abe06c41d69b560940ba3d99e8 [2019-09-10 02:38:48,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:38:48,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:38:48,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:38:48,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:38:48,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:38:48,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:38:48" (1/1) ... [2019-09-10 02:38:48,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75411fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:48, skipping insertion in model container [2019-09-10 02:38:48,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:38:48" (1/1) ... [2019-09-10 02:38:48,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:38:48,658 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:38:49,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:38:49,560 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:38:49,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:38:49,876 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:38:49,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49 WrapperNode [2019-09-10 02:38:49,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:38:49,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:38:49,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:38:49,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:38:49,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:49,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:49,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:49,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:50,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:50,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:50,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (1/1) ... [2019-09-10 02:38:50,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:38:50,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:38:50,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:38:50,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:38:50,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38: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-09-10 02:38:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:38:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:38:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:38:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:38:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:38:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:38:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:38:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:38:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:38:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:38:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:38:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:38:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:38:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:38:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:38:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:38:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:38:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:38:50,146 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:38:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:38:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:38:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:38:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:38:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:38:50,148 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:38:50,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:38:50,148 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:38:50,148 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:38:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:38:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:38:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-09-10 02:38:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-10 02:38:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:38:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:38:50,150 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:38:50,150 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:38:50,150 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:38:50,150 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:38:50,150 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:38:50,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:38:50,151 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:38:50,151 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:38:50,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:38:50,151 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:38:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:38:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:38:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:38:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:38:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:38:50,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:38:50,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:38:50,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:38:50,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:38:50,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:38:50,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:38:50,154 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:38:50,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:38:50,154 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:38:50,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:38:50,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:38:50,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:38:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:38:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:38:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:38:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:38:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:38:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:38:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:38:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:38:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:38:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:38:50,157 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:38:50,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:38:50,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:38:50,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:38:50,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:38:50,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:38:50,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:38:50,158 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:38:50,159 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:38:50,159 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:38:50,159 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:38:50,159 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:38:50,159 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:38:50,160 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:38:50,160 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:38:50,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:38:50,160 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:38:50,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:38:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:38:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:38:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:38:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:38:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:38:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:38:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:38:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:38:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:38:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:38:50,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:38:50,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:38:50,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:38:50,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:38:50,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:38:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:38:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:38:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:38:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:38:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:38:50,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:38:50,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:38:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:38:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:38:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:38:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:38:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:38:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:38:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:38:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:38:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:38:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:38:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:38:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:38:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:38:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:38:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:38:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:38:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:38:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:38:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:38:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:38:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:38:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:38:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:38:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:38:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:38:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:38:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:38:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:38:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:38:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:38:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:38:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:38:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:38:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:38:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:38:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:38:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:38:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:38:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:38:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:38:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:38:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:38:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:38:50,174 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:38:50,174 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:38:50,174 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:38:50,174 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:38:50,174 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:38:50,175 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:38:50,176 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-10 02:38:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:38:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:38:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:38:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:38:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:38:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:38:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:38:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:38:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:38:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:38:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:38:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:38:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:38:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:38:52,437 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:38:52,437 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:38:52,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:38:52 BoogieIcfgContainer [2019-09-10 02:38:52,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:38:52,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:38:52,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:38:52,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:38:52,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:38:48" (1/3) ... [2019-09-10 02:38:52,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7e340a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:38:52, skipping insertion in model container [2019-09-10 02:38:52,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:38:49" (2/3) ... [2019-09-10 02:38:52,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7e340a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:38:52, skipping insertion in model container [2019-09-10 02:38:52,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:38:52" (3/3) ... [2019-09-10 02:38:52,447 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product40.cil.c [2019-09-10 02:38:52,458 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:38:52,467 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:38:52,485 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:38:52,514 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:38:52,514 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:38:52,515 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:38:52,515 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:38:52,515 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:38:52,515 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:38:52,515 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:38:52,515 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:38:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states. [2019-09-10 02:38:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 02:38:52,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:52,575 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:38:52,579 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2061409221, now seen corresponding path program 1 times [2019-09-10 02:38:52,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:52,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:53,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:53,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:38:53,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:53,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:38:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:38:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:53,387 INFO L87 Difference]: Start difference. First operand 511 states. Second operand 2 states. [2019-09-10 02:38:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:53,443 INFO L93 Difference]: Finished difference Result 491 states and 666 transitions. [2019-09-10 02:38:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:38:53,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 177 [2019-09-10 02:38:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:53,470 INFO L225 Difference]: With dead ends: 491 [2019-09-10 02:38:53,471 INFO L226 Difference]: Without dead ends: 482 [2019-09-10 02:38:53,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-10 02:38:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-09-10 02:38:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-10 02:38:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 655 transitions. [2019-09-10 02:38:53,579 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 655 transitions. Word has length 177 [2019-09-10 02:38:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:53,582 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 655 transitions. [2019-09-10 02:38:53,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:38:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 655 transitions. [2019-09-10 02:38:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 02:38:53,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:53,594 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:38:53,595 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:53,595 INFO L82 PathProgramCache]: Analyzing trace with hash -956753639, now seen corresponding path program 1 times [2019-09-10 02:38:53,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:53,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:53,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:53,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:53,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:53,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:53,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:53,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:53,849 INFO L87 Difference]: Start difference. First operand 482 states and 655 transitions. Second operand 3 states. [2019-09-10 02:38:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:53,899 INFO L93 Difference]: Finished difference Result 485 states and 658 transitions. [2019-09-10 02:38:53,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:53,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 02:38:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:53,907 INFO L225 Difference]: With dead ends: 485 [2019-09-10 02:38:53,907 INFO L226 Difference]: Without dead ends: 485 [2019-09-10 02:38:53,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-10 02:38:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-09-10 02:38:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-10 02:38:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 657 transitions. [2019-09-10 02:38:53,938 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 657 transitions. Word has length 178 [2019-09-10 02:38:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:53,939 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 657 transitions. [2019-09-10 02:38:53,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 657 transitions. [2019-09-10 02:38:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 02:38:53,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:53,949 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:53,949 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash 239347080, now seen corresponding path program 1 times [2019-09-10 02:38:53,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:53,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:53,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:54,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:54,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:54,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:54,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:54,133 INFO L87 Difference]: Start difference. First operand 484 states and 657 transitions. Second operand 3 states. [2019-09-10 02:38:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:54,157 INFO L93 Difference]: Finished difference Result 529 states and 733 transitions. [2019-09-10 02:38:54,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:54,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 02:38:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:54,162 INFO L225 Difference]: With dead ends: 529 [2019-09-10 02:38:54,163 INFO L226 Difference]: Without dead ends: 529 [2019-09-10 02:38:54,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-10 02:38:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 528. [2019-09-10 02:38:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-10 02:38:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 732 transitions. [2019-09-10 02:38:54,184 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 732 transitions. Word has length 190 [2019-09-10 02:38:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:54,185 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 732 transitions. [2019-09-10 02:38:54,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 732 transitions. [2019-09-10 02:38:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 02:38:54,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:54,190 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:54,190 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 459421880, now seen corresponding path program 1 times [2019-09-10 02:38:54,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:54,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:54,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:54,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:54,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:54,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:54,358 INFO L87 Difference]: Start difference. First operand 528 states and 732 transitions. Second operand 3 states. [2019-09-10 02:38:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:54,396 INFO L93 Difference]: Finished difference Result 614 states and 877 transitions. [2019-09-10 02:38:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:54,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-10 02:38:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:54,406 INFO L225 Difference]: With dead ends: 614 [2019-09-10 02:38:54,406 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:38:54,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:38:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 613. [2019-09-10 02:38:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-10 02:38:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 876 transitions. [2019-09-10 02:38:54,444 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 876 transitions. Word has length 191 [2019-09-10 02:38:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:54,445 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 876 transitions. [2019-09-10 02:38:54,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 876 transitions. [2019-09-10 02:38:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 02:38:54,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:54,452 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:54,453 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash 655741416, now seen corresponding path program 1 times [2019-09-10 02:38:54,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:54,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:54,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:54,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:54,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:54,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:54,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:54,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:54,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:54,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:54,676 INFO L87 Difference]: Start difference. First operand 613 states and 876 transitions. Second operand 3 states. [2019-09-10 02:38:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:54,700 INFO L93 Difference]: Finished difference Result 778 states and 1153 transitions. [2019-09-10 02:38:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:54,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 02:38:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:54,707 INFO L225 Difference]: With dead ends: 778 [2019-09-10 02:38:54,707 INFO L226 Difference]: Without dead ends: 778 [2019-09-10 02:38:54,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-10 02:38:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 777. [2019-09-10 02:38:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-10 02:38:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1152 transitions. [2019-09-10 02:38:54,749 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1152 transitions. Word has length 192 [2019-09-10 02:38:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:54,750 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1152 transitions. [2019-09-10 02:38:54,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1152 transitions. [2019-09-10 02:38:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 02:38:54,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:54,760 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:54,760 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1935139716, now seen corresponding path program 1 times [2019-09-10 02:38:54,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:54,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:54,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:55,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:55,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:38:55,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:55,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:38:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:38:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:38:55,033 INFO L87 Difference]: Start difference. First operand 777 states and 1152 transitions. Second operand 13 states. [2019-09-10 02:38:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:58,028 INFO L93 Difference]: Finished difference Result 1504 states and 2251 transitions. [2019-09-10 02:38:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:38:58,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2019-09-10 02:38:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:58,039 INFO L225 Difference]: With dead ends: 1504 [2019-09-10 02:38:58,039 INFO L226 Difference]: Without dead ends: 1504 [2019-09-10 02:38:58,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:38:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-09-10 02:38:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1496. [2019-09-10 02:38:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-09-10 02:38:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-09-10 02:38:58,106 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 194 [2019-09-10 02:38:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:58,107 INFO L475 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-09-10 02:38:58,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:38:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-09-10 02:38:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:38:58,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:58,116 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:58,117 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1955843160, now seen corresponding path program 1 times [2019-09-10 02:38:58,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:58,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:58,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:38:58,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:58,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:58,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:58,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:58,255 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-09-10 02:38:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:58,286 INFO L93 Difference]: Finished difference Result 2130 states and 3305 transitions. [2019-09-10 02:38:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:58,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-10 02:38:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:58,302 INFO L225 Difference]: With dead ends: 2130 [2019-09-10 02:38:58,302 INFO L226 Difference]: Without dead ends: 2130 [2019-09-10 02:38:58,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-09-10 02:38:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2128. [2019-09-10 02:38:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-09-10 02:38:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3303 transitions. [2019-09-10 02:38:58,419 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3303 transitions. Word has length 193 [2019-09-10 02:38:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:58,419 INFO L475 AbstractCegarLoop]: Abstraction has 2128 states and 3303 transitions. [2019-09-10 02:38:58,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3303 transitions. [2019-09-10 02:38:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:38:58,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:58,438 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:58,439 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1693972236, now seen corresponding path program 1 times [2019-09-10 02:38:58,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:58,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:58,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:58,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:58,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:38:58,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:58,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:38:58,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:58,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:38:58,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:38:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:58,861 INFO L87 Difference]: Start difference. First operand 2128 states and 3303 transitions. Second operand 9 states. [2019-09-10 02:38:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:59,067 INFO L93 Difference]: Finished difference Result 2151 states and 3335 transitions. [2019-09-10 02:38:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:38:59,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-09-10 02:38:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:59,084 INFO L225 Difference]: With dead ends: 2151 [2019-09-10 02:38:59,085 INFO L226 Difference]: Without dead ends: 2151 [2019-09-10 02:38:59,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:38:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-09-10 02:38:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2139. [2019-09-10 02:38:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-09-10 02:38:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3317 transitions. [2019-09-10 02:38:59,183 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 3317 transitions. Word has length 195 [2019-09-10 02:38:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:59,184 INFO L475 AbstractCegarLoop]: Abstraction has 2139 states and 3317 transitions. [2019-09-10 02:38:59,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3317 transitions. [2019-09-10 02:38:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:38:59,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:59,197 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:59,197 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash 839709138, now seen corresponding path program 1 times [2019-09-10 02:38:59,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:59,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:59,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:38:59,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:59,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:59,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:59,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:59,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:59,383 INFO L87 Difference]: Start difference. First operand 2139 states and 3317 transitions. Second operand 6 states. [2019-09-10 02:38:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:59,926 INFO L93 Difference]: Finished difference Result 4229 states and 6613 transitions. [2019-09-10 02:38:59,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:59,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-10 02:38:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:59,958 INFO L225 Difference]: With dead ends: 4229 [2019-09-10 02:38:59,959 INFO L226 Difference]: Without dead ends: 4229 [2019-09-10 02:38:59,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2019-09-10 02:39:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 4218. [2019-09-10 02:39:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4218 states. [2019-09-10 02:39:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4218 states to 4218 states and 6603 transitions. [2019-09-10 02:39:00,230 INFO L78 Accepts]: Start accepts. Automaton has 4218 states and 6603 transitions. Word has length 195 [2019-09-10 02:39:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:00,231 INFO L475 AbstractCegarLoop]: Abstraction has 4218 states and 6603 transitions. [2019-09-10 02:39:00,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:39:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4218 states and 6603 transitions. [2019-09-10 02:39:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 02:39:00,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:00,255 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:00,255 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1262166346, now seen corresponding path program 1 times [2019-09-10 02:39:00,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:00,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:00,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:00,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:39:00,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:00,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:39:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:39:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:39:00,432 INFO L87 Difference]: Start difference. First operand 4218 states and 6603 transitions. Second operand 6 states. [2019-09-10 02:39:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:00,973 INFO L93 Difference]: Finished difference Result 8415 states and 13253 transitions. [2019-09-10 02:39:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:39:00,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-10 02:39:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:01,029 INFO L225 Difference]: With dead ends: 8415 [2019-09-10 02:39:01,030 INFO L226 Difference]: Without dead ends: 8415 [2019-09-10 02:39:01,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:39:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2019-09-10 02:39:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 8376. [2019-09-10 02:39:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8376 states. [2019-09-10 02:39:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8376 states to 8376 states and 13209 transitions. [2019-09-10 02:39:01,488 INFO L78 Accepts]: Start accepts. Automaton has 8376 states and 13209 transitions. Word has length 196 [2019-09-10 02:39:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:01,491 INFO L475 AbstractCegarLoop]: Abstraction has 8376 states and 13209 transitions. [2019-09-10 02:39:01,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:39:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8376 states and 13209 transitions. [2019-09-10 02:39:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:39:01,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:01,538 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:39:01,539 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:01,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2024527560, now seen corresponding path program 1 times [2019-09-10 02:39:01,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:01,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:01,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:01,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:01,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:01,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:01,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:39:01,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:01,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:39:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:39:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:39:01,747 INFO L87 Difference]: Start difference. First operand 8376 states and 13209 transitions. Second operand 9 states. [2019-09-10 02:39:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:01,943 INFO L93 Difference]: Finished difference Result 8496 states and 13373 transitions. [2019-09-10 02:39:01,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:39:01,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2019-09-10 02:39:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:02,030 INFO L225 Difference]: With dead ends: 8496 [2019-09-10 02:39:02,031 INFO L226 Difference]: Without dead ends: 8496 [2019-09-10 02:39:02,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:39:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2019-09-10 02:39:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 8456. [2019-09-10 02:39:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8456 states. [2019-09-10 02:39:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 13321 transitions. [2019-09-10 02:39:02,418 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 13321 transitions. Word has length 197 [2019-09-10 02:39:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:02,420 INFO L475 AbstractCegarLoop]: Abstraction has 8456 states and 13321 transitions. [2019-09-10 02:39:02,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:39:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 13321 transitions. [2019-09-10 02:39:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:39:02,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:02,465 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:39:02,465 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:02,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1416443918, now seen corresponding path program 1 times [2019-09-10 02:39:02,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:02,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:02,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:02,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:02,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:39:02,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:02,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:39:02,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:39:02,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:39:02,735 INFO L87 Difference]: Start difference. First operand 8456 states and 13321 transitions. Second operand 9 states. [2019-09-10 02:39:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:02,937 INFO L93 Difference]: Finished difference Result 8496 states and 13351 transitions. [2019-09-10 02:39:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:39:02,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2019-09-10 02:39:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:02,982 INFO L225 Difference]: With dead ends: 8496 [2019-09-10 02:39:02,982 INFO L226 Difference]: Without dead ends: 8496 [2019-09-10 02:39:02,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:39:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2019-09-10 02:39:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 8456. [2019-09-10 02:39:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8456 states. [2019-09-10 02:39:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8456 states to 8456 states and 13299 transitions. [2019-09-10 02:39:03,337 INFO L78 Accepts]: Start accepts. Automaton has 8456 states and 13299 transitions. Word has length 197 [2019-09-10 02:39:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:03,337 INFO L475 AbstractCegarLoop]: Abstraction has 8456 states and 13299 transitions. [2019-09-10 02:39:03,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:39:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8456 states and 13299 transitions. [2019-09-10 02:39:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:39:03,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:03,382 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:03,382 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash -457825732, now seen corresponding path program 1 times [2019-09-10 02:39:03,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:03,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:03,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:39:03,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:03,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:39:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:39:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:39:03,555 INFO L87 Difference]: Start difference. First operand 8456 states and 13299 transitions. Second operand 6 states. [2019-09-10 02:39:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:04,237 INFO L93 Difference]: Finished difference Result 16835 states and 26631 transitions. [2019-09-10 02:39:04,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:39:04,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-09-10 02:39:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:04,307 INFO L225 Difference]: With dead ends: 16835 [2019-09-10 02:39:04,307 INFO L226 Difference]: Without dead ends: 16468 [2019-09-10 02:39:04,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:39:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16468 states. [2019-09-10 02:39:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16468 to 16407. [2019-09-10 02:39:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16407 states. [2019-09-10 02:39:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16407 states to 16407 states and 26017 transitions. [2019-09-10 02:39:04,835 INFO L78 Accepts]: Start accepts. Automaton has 16407 states and 26017 transitions. Word has length 198 [2019-09-10 02:39:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:04,836 INFO L475 AbstractCegarLoop]: Abstraction has 16407 states and 26017 transitions. [2019-09-10 02:39:04,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:39:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 16407 states and 26017 transitions. [2019-09-10 02:39:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:39:04,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:04,889 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-09-10 02:39:04,890 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash -125865389, now seen corresponding path program 1 times [2019-09-10 02:39:04,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:04,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:04,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:39:05,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:39:05,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:05,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:39:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:39:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:05,048 INFO L87 Difference]: Start difference. First operand 16407 states and 26017 transitions. Second operand 3 states. [2019-09-10 02:39:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:05,195 INFO L93 Difference]: Finished difference Result 26149 states and 42511 transitions. [2019-09-10 02:39:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:39:05,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 02:39:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:05,309 INFO L225 Difference]: With dead ends: 26149 [2019-09-10 02:39:05,310 INFO L226 Difference]: Without dead ends: 26149 [2019-09-10 02:39:05,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:39:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26149 states. [2019-09-10 02:39:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26149 to 26135. [2019-09-10 02:39:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26135 states. [2019-09-10 02:39:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26135 states to 26135 states and 42497 transitions. [2019-09-10 02:39:06,823 INFO L78 Accepts]: Start accepts. Automaton has 26135 states and 42497 transitions. Word has length 201 [2019-09-10 02:39:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:06,824 INFO L475 AbstractCegarLoop]: Abstraction has 26135 states and 42497 transitions. [2019-09-10 02:39:06,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:39:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 26135 states and 42497 transitions. [2019-09-10 02:39:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:39:06,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:06,914 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-09-10 02:39:06,914 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1306151587, now seen corresponding path program 1 times [2019-09-10 02:39:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:06,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:06,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:06,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:06,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:39:07,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:07,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:39:07,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:07,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:39:07,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:39:07,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:39:07,116 INFO L87 Difference]: Start difference. First operand 26135 states and 42497 transitions. Second operand 8 states. [2019-09-10 02:39:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:07,432 INFO L93 Difference]: Finished difference Result 26132 states and 42481 transitions. [2019-09-10 02:39:07,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:39:07,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 202 [2019-09-10 02:39:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:07,433 INFO L225 Difference]: With dead ends: 26132 [2019-09-10 02:39:07,433 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:39:07,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:39:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:39:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:39:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:39:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:39:07,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2019-09-10 02:39:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:07,435 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:39:07,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:39:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:39:07,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:39:07,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:39:07 BoogieIcfgContainer [2019-09-10 02:39:07,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:39:07,443 INFO L168 Benchmark]: Toolchain (without parser) took 18884.26 ms. Allocated memory was 135.3 MB in the beginning and 813.2 MB in the end (delta: 677.9 MB). Free memory was 88.7 MB in the beginning and 611.0 MB in the end (delta: -522.3 MB). Peak memory consumption was 590.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:07,444 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 109.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:39:07,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1319.16 ms. Allocated memory was 135.3 MB in the beginning and 208.1 MB in the end (delta: 72.9 MB). Free memory was 88.5 MB in the beginning and 143.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:07,451 INFO L168 Benchmark]: Boogie Preprocessor took 185.62 ms. Allocated memory is still 208.1 MB. Free memory was 143.1 MB in the beginning and 134.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:07,452 INFO L168 Benchmark]: RCFGBuilder took 2374.46 ms. Allocated memory was 208.1 MB in the beginning and 254.3 MB in the end (delta: 46.1 MB). Free memory was 134.8 MB in the beginning and 165.9 MB in the end (delta: -31.1 MB). Peak memory consumption was 87.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:07,452 INFO L168 Benchmark]: TraceAbstraction took 15000.63 ms. Allocated memory was 254.3 MB in the beginning and 813.2 MB in the end (delta: 558.9 MB). Free memory was 164.0 MB in the beginning and 611.0 MB in the end (delta: -446.9 MB). Peak memory consumption was 546.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:07,456 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 109.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1319.16 ms. Allocated memory was 135.3 MB in the beginning and 208.1 MB in the end (delta: 72.9 MB). Free memory was 88.5 MB in the beginning and 143.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 185.62 ms. Allocated memory is still 208.1 MB. Free memory was 143.1 MB in the beginning and 134.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2374.46 ms. Allocated memory was 208.1 MB in the beginning and 254.3 MB in the end (delta: 46.1 MB). Free memory was 134.8 MB in the beginning and 165.9 MB in the end (delta: -31.1 MB). Peak memory consumption was 87.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15000.63 ms. Allocated memory was 254.3 MB in the beginning and 813.2 MB in the end (delta: 558.9 MB). Free memory was 164.0 MB in the beginning and 611.0 MB in the end (delta: -446.9 MB). Peak memory consumption was 546.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 387]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 111 procedures, 743 locations, 1 error locations. SAFE Result, 14.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10687 SDtfs, 3424 SDslu, 38761 SDs, 0 SdLazy, 3280 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26135occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 231 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2896 NumberOfCodeBlocks, 2896 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2881 ConstructedInterpolants, 0 QuantifiedInterpolants, 674997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 498/498 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...