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_spec7_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:45:29,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:45:29,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:45:29,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:45:29,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:45:29,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:45:29,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:45:29,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:45:29,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:45:29,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:45:29,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:45:29,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:45:29,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:45:29,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:45:29,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:45:29,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:45:29,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:45:29,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:45:29,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:45:29,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:45:29,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:45:29,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:45:29,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:45:29,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:45:29,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:45:29,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:45:29,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:45:29,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:45:29,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:45:29,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:45:29,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:45:29,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:45:29,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:45:29,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:45:29,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:45:29,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:45:29,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:45:29,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:45:29,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:45:29,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:45:29,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:45:29,252 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:45:29,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:45:29,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:45:29,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:45:29,269 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:45:29,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:45:29,270 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:45:29,270 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:45:29,270 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:45:29,271 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:45:29,271 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:45:29,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:45:29,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:45:29,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:45:29,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:45:29,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:45:29,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:45:29,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:45:29,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:45:29,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:45:29,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:45:29,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:45:29,276 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:45:29,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:45:29,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:45:29,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:45:29,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:45:29,277 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:45:29,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:45:29,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:45:29,278 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:45:29,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:45:29,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:45:29,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:45:29,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:45:29,331 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:45:29,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product35.cil.c [2019-09-10 02:45:29,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f8092a1/2b9b80305b534e3097571636e6ad06e6/FLAGa3a048c17 [2019-09-10 02:45:30,019 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:45:30,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product35.cil.c [2019-09-10 02:45:30,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f8092a1/2b9b80305b534e3097571636e6ad06e6/FLAGa3a048c17 [2019-09-10 02:45:30,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f8092a1/2b9b80305b534e3097571636e6ad06e6 [2019-09-10 02:45:30,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:45:30,244 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:45:30,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:45:30,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:45:30,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:45:30,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:45:30" (1/1) ... [2019-09-10 02:45:30,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485875dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:30, skipping insertion in model container [2019-09-10 02:45:30,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:45:30" (1/1) ... [2019-09-10 02:45:30,261 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:45:30,337 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:45:31,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:45:31,157 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:45:31,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:45:31,406 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:45:31,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31 WrapperNode [2019-09-10 02:45:31,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:45:31,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:45:31,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:45:31,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:45:31,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (1/1) ... [2019-09-10 02:45:31,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:45:31,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:45:31,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:45:31,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:45:31,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (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:45:31,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:45:31,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:45:31,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:45:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:45:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:45:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-10 02:45:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-10 02:45:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:45:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:45:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:45:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:45:31,723 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:45:31,723 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:45:31,724 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:45:31,724 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:45:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-10 02:45:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:45:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:45:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:45:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:45:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:45:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:45:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:45:31,727 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:45:31,727 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:45:31,728 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:45:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:45:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:45:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:45:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:45:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:45:31,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:45:31,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:45:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:45:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:45:31,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:45:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:45:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:45:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:45:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:45:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:45:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-10 02:45:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:45:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:45:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:45:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:45:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:45:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:45:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:45:31,737 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:45:31,737 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:45:31,737 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:45:31,737 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:45:31,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:45:31,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:45:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:45:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:45:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:45:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:45:31,739 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:45:31,740 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:45:31,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:45:31,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:45:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:45:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:45:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:45:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:45:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:45:31,742 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:45:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:45:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:45:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:45:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:45:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:45:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:45:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:45:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:45:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:45:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:45:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:45:31,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:45:31,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:45:31,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:45:31,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:45:31,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:45:31,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:45:31,746 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:45:31,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:45:31,746 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:45:31,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:45:31,746 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:45:31,747 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:45:31,747 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:45:31,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:45:31,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:45:31,749 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:45:31,749 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:45:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:45:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:45:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:45:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:45:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:45:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:45:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:45:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:45:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:45:31,752 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:45:31,753 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:45:31,753 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:45:31,753 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:45:31,753 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:45:31,753 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:45:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:45:31,754 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:45:31,755 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:45:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:45:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:45:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-10 02:45:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-10 02:45:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:45:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:45:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:45:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:45:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:45:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:45:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:45:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:45:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:45:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:45:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:45:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:45:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:45:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:45:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:45:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:45:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:45:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:45:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:45:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:45:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:45:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:45:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:45:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:45:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:45:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:45:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:45:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:45:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:45:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-10 02:45:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:45:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:45:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-10 02:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:45:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:45:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:45:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:45:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:45:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:45:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:45:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:45:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:45:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:45:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:45:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:45:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:45:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:45:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:45:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:45:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:45:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:45:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:45:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:45:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:45:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:45:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:45:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:45:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:45:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:45:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:45:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:45:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:45:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:45:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:45:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:45:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:45:31,783 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:45:31,783 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:45:31,783 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:45:31,783 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:45:31,783 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:45:31,783 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:45:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:45:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:45:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:45:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:45:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:45:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:45:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:45:33,821 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:45:33,821 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:45:33,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:45:33 BoogieIcfgContainer [2019-09-10 02:45:33,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:45:33,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:45:33,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:45:33,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:45:33,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:45:30" (1/3) ... [2019-09-10 02:45:33,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2f69f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:45:33, skipping insertion in model container [2019-09-10 02:45:33,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:31" (2/3) ... [2019-09-10 02:45:33,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2f69f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:45:33, skipping insertion in model container [2019-09-10 02:45:33,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:45:33" (3/3) ... [2019-09-10 02:45:33,832 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product35.cil.c [2019-09-10 02:45:33,842 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:45:33,853 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:45:33,870 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:45:33,901 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:45:33,901 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:45:33,901 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:45:33,901 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:45:33,901 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:45:33,902 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:45:33,902 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:45:33,902 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:45:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states. [2019-09-10 02:45:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 02:45:33,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:33,988 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:33,991 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 704600627, now seen corresponding path program 1 times [2019-09-10 02:45:34,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:34,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:34,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:34,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:34,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:45:34,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:34,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:45:34,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:45:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:34,755 INFO L87 Difference]: Start difference. First operand 679 states. Second operand 2 states. [2019-09-10 02:45:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:34,812 INFO L93 Difference]: Finished difference Result 659 states and 891 transitions. [2019-09-10 02:45:34,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:45:34,814 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-09-10 02:45:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:34,845 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:45:34,846 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:45:34,847 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:45:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:45:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 02:45:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 02:45:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 880 transitions. [2019-09-10 02:45:34,942 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 880 transitions. Word has length 191 [2019-09-10 02:45:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:34,944 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 880 transitions. [2019-09-10 02:45:34,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:45:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 880 transitions. [2019-09-10 02:45:34,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 02:45:34,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:34,950 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:34,951 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:34,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1790532570, now seen corresponding path program 1 times [2019-09-10 02:45:34,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:34,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:34,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:35,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:35,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:35,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:35,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:35,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:35,191 INFO L87 Difference]: Start difference. First operand 650 states and 880 transitions. Second operand 3 states. [2019-09-10 02:45:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:35,265 INFO L93 Difference]: Finished difference Result 653 states and 883 transitions. [2019-09-10 02:45:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:35,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 02:45:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:35,278 INFO L225 Difference]: With dead ends: 653 [2019-09-10 02:45:35,279 INFO L226 Difference]: Without dead ends: 653 [2019-09-10 02:45:35,280 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:45:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-10 02:45:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 652. [2019-09-10 02:45:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-10 02:45:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 882 transitions. [2019-09-10 02:45:35,337 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 882 transitions. Word has length 192 [2019-09-10 02:45:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:35,340 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 882 transitions. [2019-09-10 02:45:35,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 882 transitions. [2019-09-10 02:45:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 02:45:35,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:35,347 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:35,348 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 94265161, now seen corresponding path program 1 times [2019-09-10 02:45:35,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:35,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:35,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:35,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:35,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:35,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:35,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:35,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:35,626 INFO L87 Difference]: Start difference. First operand 652 states and 882 transitions. Second operand 3 states. [2019-09-10 02:45:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:35,654 INFO L93 Difference]: Finished difference Result 697 states and 958 transitions. [2019-09-10 02:45:35,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:35,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 02:45:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:35,659 INFO L225 Difference]: With dead ends: 697 [2019-09-10 02:45:35,659 INFO L226 Difference]: Without dead ends: 697 [2019-09-10 02:45:35,660 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:45:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-10 02:45:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 696. [2019-09-10 02:45:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-10 02:45:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 957 transitions. [2019-09-10 02:45:35,684 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 957 transitions. Word has length 204 [2019-09-10 02:45:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:35,685 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 957 transitions. [2019-09-10 02:45:35,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 957 transitions. [2019-09-10 02:45:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 02:45:35,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:35,690 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:35,690 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1429937952, now seen corresponding path program 1 times [2019-09-10 02:45:35,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:35,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:35,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:35,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:35,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:35,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:35,845 INFO L87 Difference]: Start difference. First operand 696 states and 957 transitions. Second operand 3 states. [2019-09-10 02:45:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:35,879 INFO L93 Difference]: Finished difference Result 782 states and 1102 transitions. [2019-09-10 02:45:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:35,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-10 02:45:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:35,887 INFO L225 Difference]: With dead ends: 782 [2019-09-10 02:45:35,887 INFO L226 Difference]: Without dead ends: 782 [2019-09-10 02:45:35,888 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:45:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-09-10 02:45:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 781. [2019-09-10 02:45:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-10 02:45:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1101 transitions. [2019-09-10 02:45:35,921 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1101 transitions. Word has length 205 [2019-09-10 02:45:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:35,922 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1101 transitions. [2019-09-10 02:45:35,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1101 transitions. [2019-09-10 02:45:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 02:45:35,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:35,932 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:35,932 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1523480998, now seen corresponding path program 1 times [2019-09-10 02:45:35,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:35,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:36,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:45:36,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:36,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:45:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:45:36,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:45:36,643 INFO L87 Difference]: Start difference. First operand 781 states and 1101 transitions. Second operand 19 states. [2019-09-10 02:45:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:42,667 INFO L93 Difference]: Finished difference Result 2295 states and 3253 transitions. [2019-09-10 02:45:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:45:42,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 208 [2019-09-10 02:45:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:42,685 INFO L225 Difference]: With dead ends: 2295 [2019-09-10 02:45:42,685 INFO L226 Difference]: Without dead ends: 2295 [2019-09-10 02:45:42,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:45:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-09-10 02:45:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2258. [2019-09-10 02:45:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-09-10 02:45:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3200 transitions. [2019-09-10 02:45:42,797 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3200 transitions. Word has length 208 [2019-09-10 02:45:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:42,797 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3200 transitions. [2019-09-10 02:45:42,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:45:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3200 transitions. [2019-09-10 02:45:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:42,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:42,806 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:42,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1121180023, now seen corresponding path program 1 times [2019-09-10 02:45:42,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:42,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:42,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:42,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:43,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:43,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:45:43,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:43,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:45:43,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:45:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:43,066 INFO L87 Difference]: Start difference. First operand 2258 states and 3200 transitions. Second operand 13 states. [2019-09-10 02:45:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:43,666 INFO L93 Difference]: Finished difference Result 2408 states and 3446 transitions. [2019-09-10 02:45:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:45:43,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 209 [2019-09-10 02:45:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:43,688 INFO L225 Difference]: With dead ends: 2408 [2019-09-10 02:45:43,688 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 02:45:43,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:45:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 02:45:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2019-09-10 02:45:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-09-10 02:45:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3417 transitions. [2019-09-10 02:45:43,792 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3417 transitions. Word has length 209 [2019-09-10 02:45:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:43,793 INFO L475 AbstractCegarLoop]: Abstraction has 2392 states and 3417 transitions. [2019-09-10 02:45:43,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:45:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3417 transitions. [2019-09-10 02:45:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:43,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:43,803 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:43,804 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1128009189, now seen corresponding path program 1 times [2019-09-10 02:45:43,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:43,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:44,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:44,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:45:44,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:44,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:45:44,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:45:44,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:45:44,160 INFO L87 Difference]: Start difference. First operand 2392 states and 3417 transitions. Second operand 15 states. [2019-09-10 02:45:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:48,475 INFO L93 Difference]: Finished difference Result 2510 states and 3610 transitions. [2019-09-10 02:45:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:45:48,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 209 [2019-09-10 02:45:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:48,492 INFO L225 Difference]: With dead ends: 2510 [2019-09-10 02:45:48,492 INFO L226 Difference]: Without dead ends: 2510 [2019-09-10 02:45:48,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:45:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-09-10 02:45:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2473. [2019-09-10 02:45:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2473 states. [2019-09-10 02:45:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3557 transitions. [2019-09-10 02:45:48,592 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3557 transitions. Word has length 209 [2019-09-10 02:45:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:48,593 INFO L475 AbstractCegarLoop]: Abstraction has 2473 states and 3557 transitions. [2019-09-10 02:45:48,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:45:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3557 transitions. [2019-09-10 02:45:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 02:45:48,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:48,601 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:48,601 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:48,602 INFO L82 PathProgramCache]: Analyzing trace with hash 932196291, now seen corresponding path program 1 times [2019-09-10 02:45:48,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:48,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:48,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:48,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:48,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:45:48,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:48,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:48,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:48,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:48,790 INFO L87 Difference]: Start difference. First operand 2473 states and 3557 transitions. Second operand 5 states. [2019-09-10 02:45:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:48,883 INFO L93 Difference]: Finished difference Result 2029 states and 2926 transitions. [2019-09-10 02:45:48,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:48,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-10 02:45:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:48,897 INFO L225 Difference]: With dead ends: 2029 [2019-09-10 02:45:48,897 INFO L226 Difference]: Without dead ends: 2026 [2019-09-10 02:45:48,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-09-10 02:45:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2019-09-10 02:45:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2019-09-10 02:45:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2922 transitions. [2019-09-10 02:45:48,977 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2922 transitions. Word has length 212 [2019-09-10 02:45:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:48,977 INFO L475 AbstractCegarLoop]: Abstraction has 2026 states and 2922 transitions. [2019-09-10 02:45:48,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2922 transitions. [2019-09-10 02:45:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:48,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:48,984 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:48,985 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash -151920076, now seen corresponding path program 1 times [2019-09-10 02:45:48,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:48,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:49,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:49,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:45:49,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:49,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:45:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:45:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:45:49,303 INFO L87 Difference]: Start difference. First operand 2026 states and 2922 transitions. Second operand 18 states. [2019-09-10 02:45:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:49,877 INFO L93 Difference]: Finished difference Result 2058 states and 2954 transitions. [2019-09-10 02:45:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:45:49,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 209 [2019-09-10 02:45:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:49,891 INFO L225 Difference]: With dead ends: 2058 [2019-09-10 02:45:49,891 INFO L226 Difference]: Without dead ends: 2058 [2019-09-10 02:45:49,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:45:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2019-09-10 02:45:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2056. [2019-09-10 02:45:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-10 02:45:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2951 transitions. [2019-09-10 02:45:49,976 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2951 transitions. Word has length 209 [2019-09-10 02:45:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:49,979 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2951 transitions. [2019-09-10 02:45:49,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:45:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2951 transitions. [2019-09-10 02:45:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:49,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:49,991 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:49,991 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 712856251, now seen corresponding path program 1 times [2019-09-10 02:45:49,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:49,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:49,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:50,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:50,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:50,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:50,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:50,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:50,202 INFO L87 Difference]: Start difference. First operand 2056 states and 2951 transitions. Second operand 5 states. [2019-09-10 02:45:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:51,633 INFO L93 Difference]: Finished difference Result 4507 states and 6471 transitions. [2019-09-10 02:45:51,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:45:51,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-09-10 02:45:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:51,661 INFO L225 Difference]: With dead ends: 4507 [2019-09-10 02:45:51,662 INFO L226 Difference]: Without dead ends: 4507 [2019-09-10 02:45:51,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:45:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-09-10 02:45:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4493. [2019-09-10 02:45:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4493 states. [2019-09-10 02:45:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 6451 transitions. [2019-09-10 02:45:51,828 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 6451 transitions. Word has length 209 [2019-09-10 02:45:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:51,828 INFO L475 AbstractCegarLoop]: Abstraction has 4493 states and 6451 transitions. [2019-09-10 02:45:51,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 6451 transitions. [2019-09-10 02:45:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:51,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:51,840 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:51,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 733193626, now seen corresponding path program 1 times [2019-09-10 02:45:51,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:51,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:52,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:45:52,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:52,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:45:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:45:52,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:45:52,152 INFO L87 Difference]: Start difference. First operand 4493 states and 6451 transitions. Second operand 7 states. [2019-09-10 02:45:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:54,705 INFO L93 Difference]: Finished difference Result 11171 states and 16987 transitions. [2019-09-10 02:45:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:45:54,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-09-10 02:45:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:54,783 INFO L225 Difference]: With dead ends: 11171 [2019-09-10 02:45:54,783 INFO L226 Difference]: Without dead ends: 11171 [2019-09-10 02:45:54,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2019-09-10 02:45:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 11161. [2019-09-10 02:45:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11161 states. [2019-09-10 02:45:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 16971 transitions. [2019-09-10 02:45:55,184 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 16971 transitions. Word has length 209 [2019-09-10 02:45:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:55,184 INFO L475 AbstractCegarLoop]: Abstraction has 11161 states and 16971 transitions. [2019-09-10 02:45:55,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:45:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 16971 transitions. [2019-09-10 02:45:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:45:55,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:55,195 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:55,196 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 588620997, now seen corresponding path program 1 times [2019-09-10 02:45:55,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:55,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:55,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:55,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 02:45:55,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:55,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:45:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:45:55,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:45:55,859 INFO L87 Difference]: Start difference. First operand 11161 states and 16971 transitions. Second operand 28 states. [2019-09-10 02:45:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:56,955 INFO L93 Difference]: Finished difference Result 11512 states and 17485 transitions. [2019-09-10 02:45:56,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:45:56,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 210 [2019-09-10 02:45:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:57,019 INFO L225 Difference]: With dead ends: 11512 [2019-09-10 02:45:57,019 INFO L226 Difference]: Without dead ends: 11512 [2019-09-10 02:45:57,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:45:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11512 states. [2019-09-10 02:45:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11512 to 11487. [2019-09-10 02:45:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-09-10 02:45:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 17430 transitions. [2019-09-10 02:45:57,446 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 17430 transitions. Word has length 210 [2019-09-10 02:45:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:57,447 INFO L475 AbstractCegarLoop]: Abstraction has 11487 states and 17430 transitions. [2019-09-10 02:45:57,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:45:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 17430 transitions. [2019-09-10 02:45:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-10 02:45:57,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:57,462 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:57,462 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -410361531, now seen corresponding path program 1 times [2019-09-10 02:45:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:57,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:57,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:57,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:57,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:57,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:45:57,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:57,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:45:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:45:57,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:45:57,662 INFO L87 Difference]: Start difference. First operand 11487 states and 17430 transitions. Second operand 10 states. [2019-09-10 02:45:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:57,876 INFO L93 Difference]: Finished difference Result 11583 states and 17582 transitions. [2019-09-10 02:45:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:45:57,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-09-10 02:45:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:57,932 INFO L225 Difference]: With dead ends: 11583 [2019-09-10 02:45:57,932 INFO L226 Difference]: Without dead ends: 11583 [2019-09-10 02:45:57,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:45:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2019-09-10 02:45:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 11583. [2019-09-10 02:45:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11583 states. [2019-09-10 02:45:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11583 states to 11583 states and 17582 transitions. [2019-09-10 02:45:58,345 INFO L78 Accepts]: Start accepts. Automaton has 11583 states and 17582 transitions. Word has length 214 [2019-09-10 02:45:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:58,346 INFO L475 AbstractCegarLoop]: Abstraction has 11583 states and 17582 transitions. [2019-09-10 02:45:58,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:45:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11583 states and 17582 transitions. [2019-09-10 02:45:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 02:45:58,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:58,362 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:58,362 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -180221892, now seen corresponding path program 1 times [2019-09-10 02:45:58,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:58,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:58,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:58,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:58,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:58,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:58,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:58,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:58,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:58,553 INFO L87 Difference]: Start difference. First operand 11583 states and 17582 transitions. Second operand 5 states. [2019-09-10 02:45:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:58,647 INFO L93 Difference]: Finished difference Result 11838 states and 18310 transitions. [2019-09-10 02:45:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:58,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-10 02:45:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:58,704 INFO L225 Difference]: With dead ends: 11838 [2019-09-10 02:45:58,705 INFO L226 Difference]: Without dead ends: 11838 [2019-09-10 02:45:58,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2019-09-10 02:45:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 11687. [2019-09-10 02:45:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11687 states. [2019-09-10 02:45:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11687 states to 11687 states and 17699 transitions. [2019-09-10 02:45:59,174 INFO L78 Accepts]: Start accepts. Automaton has 11687 states and 17699 transitions. Word has length 219 [2019-09-10 02:45:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:59,175 INFO L475 AbstractCegarLoop]: Abstraction has 11687 states and 17699 transitions. [2019-09-10 02:45:59,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 11687 states and 17699 transitions. [2019-09-10 02:45:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 02:45:59,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:59,186 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:59,187 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1951283172, now seen corresponding path program 1 times [2019-09-10 02:45:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:59,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:59,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:59,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:59,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:59,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:59,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:59,358 INFO L87 Difference]: Start difference. First operand 11687 states and 17699 transitions. Second operand 6 states. [2019-09-10 02:46:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:00,224 INFO L93 Difference]: Finished difference Result 23493 states and 36127 transitions. [2019-09-10 02:46:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:46:00,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2019-09-10 02:46:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:00,331 INFO L225 Difference]: With dead ends: 23493 [2019-09-10 02:46:00,331 INFO L226 Difference]: Without dead ends: 23493 [2019-09-10 02:46:00,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:46:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23493 states. [2019-09-10 02:46:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23493 to 23163. [2019-09-10 02:46:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23163 states. [2019-09-10 02:46:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23163 states to 23163 states and 35113 transitions. [2019-09-10 02:46:01,182 INFO L78 Accepts]: Start accepts. Automaton has 23163 states and 35113 transitions. Word has length 220 [2019-09-10 02:46:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:01,183 INFO L475 AbstractCegarLoop]: Abstraction has 23163 states and 35113 transitions. [2019-09-10 02:46:01,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:46:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 23163 states and 35113 transitions. [2019-09-10 02:46:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:46:01,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:01,211 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,212 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1686908772, now seen corresponding path program 1 times [2019-09-10 02:46:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:01,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:01,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:46:01,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:01,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:01,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:01,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:01,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:01,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:01,407 INFO L87 Difference]: Start difference. First operand 23163 states and 35113 transitions. Second operand 3 states. [2019-09-10 02:46:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:01,566 INFO L93 Difference]: Finished difference Result 24153 states and 36991 transitions. [2019-09-10 02:46:01,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:01,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-10 02:46:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:02,497 INFO L225 Difference]: With dead ends: 24153 [2019-09-10 02:46:02,497 INFO L226 Difference]: Without dead ends: 24153 [2019-09-10 02:46:02,498 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:46:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24153 states. [2019-09-10 02:46:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24153 to 24147. [2019-09-10 02:46:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24147 states. [2019-09-10 02:46:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24147 states to 24147 states and 36985 transitions. [2019-09-10 02:46:03,230 INFO L78 Accepts]: Start accepts. Automaton has 24147 states and 36985 transitions. Word has length 240 [2019-09-10 02:46:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:03,231 INFO L475 AbstractCegarLoop]: Abstraction has 24147 states and 36985 transitions. [2019-09-10 02:46:03,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24147 states and 36985 transitions. [2019-09-10 02:46:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 02:46:03,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:03,265 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:03,265 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1442139440, now seen corresponding path program 1 times [2019-09-10 02:46:03,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:03,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:03,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:46:03,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:03,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:46:03,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:03,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:46:03,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:46:03,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:03,487 INFO L87 Difference]: Start difference. First operand 24147 states and 36985 transitions. Second operand 8 states. [2019-09-10 02:46:05,759 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-09-10 02:46:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:09,506 INFO L93 Difference]: Finished difference Result 48973 states and 77095 transitions. [2019-09-10 02:46:09,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:46:09,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-09-10 02:46:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:09,731 INFO L225 Difference]: With dead ends: 48973 [2019-09-10 02:46:09,731 INFO L226 Difference]: Without dead ends: 48973 [2019-09-10 02:46:09,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:46:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48973 states. [2019-09-10 02:46:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48973 to 27873. [2019-09-10 02:46:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27873 states. [2019-09-10 02:46:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27873 states to 27873 states and 44809 transitions. [2019-09-10 02:46:11,104 INFO L78 Accepts]: Start accepts. Automaton has 27873 states and 44809 transitions. Word has length 256 [2019-09-10 02:46:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:11,104 INFO L475 AbstractCegarLoop]: Abstraction has 27873 states and 44809 transitions. [2019-09-10 02:46:11,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:46:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 27873 states and 44809 transitions. [2019-09-10 02:46:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:46:11,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:11,151 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:11,151 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1422359178, now seen corresponding path program 1 times [2019-09-10 02:46:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:11,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:11,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:46:11,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:46:11,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:11,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:46:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:46:11,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:11,360 INFO L87 Difference]: Start difference. First operand 27873 states and 44809 transitions. Second operand 8 states. [2019-09-10 02:46:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:18,334 INFO L93 Difference]: Finished difference Result 57229 states and 96109 transitions. [2019-09-10 02:46:18,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:46:18,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 257 [2019-09-10 02:46:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:18,664 INFO L225 Difference]: With dead ends: 57229 [2019-09-10 02:46:18,664 INFO L226 Difference]: Without dead ends: 57229 [2019-09-10 02:46:18,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:46:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57229 states. [2019-09-10 02:46:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57229 to 35505. [2019-09-10 02:46:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35505 states. [2019-09-10 02:46:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35505 states to 35505 states and 62053 transitions. [2019-09-10 02:46:20,943 INFO L78 Accepts]: Start accepts. Automaton has 35505 states and 62053 transitions. Word has length 257 [2019-09-10 02:46:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:20,944 INFO L475 AbstractCegarLoop]: Abstraction has 35505 states and 62053 transitions. [2019-09-10 02:46:20,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:46:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35505 states and 62053 transitions. [2019-09-10 02:46:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 02:46:21,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:21,013 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,013 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1999003081, now seen corresponding path program 1 times [2019-09-10 02:46:21,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:21,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:21,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:21,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:21,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:46:21,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:21,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:46:21,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:21,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:46:21,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:46:21,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:21,205 INFO L87 Difference]: Start difference. First operand 35505 states and 62053 transitions. Second operand 8 states. [2019-09-10 02:46:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:27,096 INFO L93 Difference]: Finished difference Result 73969 states and 137263 transitions. [2019-09-10 02:46:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:46:27,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-09-10 02:46:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:27,469 INFO L225 Difference]: With dead ends: 73969 [2019-09-10 02:46:27,469 INFO L226 Difference]: Without dead ends: 73969 [2019-09-10 02:46:27,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:46:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73969 states. [2019-09-10 02:46:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73969 to 50961. [2019-09-10 02:46:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50961 states. [2019-09-10 02:46:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50961 states to 50961 states and 99523 transitions. [2019-09-10 02:46:30,508 INFO L78 Accepts]: Start accepts. Automaton has 50961 states and 99523 transitions. Word has length 243 [2019-09-10 02:46:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:30,508 INFO L475 AbstractCegarLoop]: Abstraction has 50961 states and 99523 transitions. [2019-09-10 02:46:30,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:46:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 50961 states and 99523 transitions. [2019-09-10 02:46:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 02:46:30,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:30,631 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:30,631 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1699977440, now seen corresponding path program 1 times [2019-09-10 02:46:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:30,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:46:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:46:30,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:30,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:46:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:46:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:30,814 INFO L87 Difference]: Start difference. First operand 50961 states and 99523 transitions. Second operand 8 states. [2019-09-10 02:46:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:32,751 INFO L93 Difference]: Finished difference Result 103522 states and 203428 transitions. [2019-09-10 02:46:32,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:46:32,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-09-10 02:46:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:33,240 INFO L225 Difference]: With dead ends: 103522 [2019-09-10 02:46:33,240 INFO L226 Difference]: Without dead ends: 103522 [2019-09-10 02:46:33,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:46:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103522 states. [2019-09-10 02:46:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103522 to 103371. [2019-09-10 02:46:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103371 states. [2019-09-10 02:46:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103371 states to 103371 states and 203203 transitions. [2019-09-10 02:46:38,258 INFO L78 Accepts]: Start accepts. Automaton has 103371 states and 203203 transitions. Word has length 239 [2019-09-10 02:46:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:38,259 INFO L475 AbstractCegarLoop]: Abstraction has 103371 states and 203203 transitions. [2019-09-10 02:46:38,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:46:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 103371 states and 203203 transitions. [2019-09-10 02:46:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:46:38,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:38,615 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:38,616 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:38,616 INFO L82 PathProgramCache]: Analyzing trace with hash -546975224, now seen corresponding path program 1 times [2019-09-10 02:46:38,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:46:38,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:46:38,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:38,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:46:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:46:38,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:46:38,903 INFO L87 Difference]: Start difference. First operand 103371 states and 203203 transitions. Second operand 15 states. [2019-09-10 02:46:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:43,300 INFO L93 Difference]: Finished difference Result 103140 states and 202477 transitions. [2019-09-10 02:46:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:46:43,301 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 240 [2019-09-10 02:46:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:47,127 INFO L225 Difference]: With dead ends: 103140 [2019-09-10 02:46:47,127 INFO L226 Difference]: Without dead ends: 103140 [2019-09-10 02:46:47,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:46:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103140 states. [2019-09-10 02:46:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103140 to 102466. [2019-09-10 02:46:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102466 states. [2019-09-10 02:46:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102466 states to 102466 states and 201092 transitions. [2019-09-10 02:46:49,796 INFO L78 Accepts]: Start accepts. Automaton has 102466 states and 201092 transitions. Word has length 240 [2019-09-10 02:46:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:49,797 INFO L475 AbstractCegarLoop]: Abstraction has 102466 states and 201092 transitions. [2019-09-10 02:46:49,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:46:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 102466 states and 201092 transitions. [2019-09-10 02:46:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:46:50,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:50,096 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:50,096 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1705630931, now seen corresponding path program 1 times [2019-09-10 02:46:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:50,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:50,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:46:50,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:50,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:46:50,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:50,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:46:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:46:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:46:50,330 INFO L87 Difference]: Start difference. First operand 102466 states and 201092 transitions. Second operand 7 states. [2019-09-10 02:46:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:57,864 INFO L93 Difference]: Finished difference Result 238936 states and 503386 transitions. [2019-09-10 02:46:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:46:57,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-09-10 02:46:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:58,807 INFO L225 Difference]: With dead ends: 238936 [2019-09-10 02:46:58,807 INFO L226 Difference]: Without dead ends: 238936 [2019-09-10 02:46:58,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:46:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238936 states. [2019-09-10 02:47:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238936 to 205679. [2019-09-10 02:47:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205679 states. [2019-09-10 02:47:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205679 states to 205679 states and 406409 transitions. [2019-09-10 02:47:09,259 INFO L78 Accepts]: Start accepts. Automaton has 205679 states and 406409 transitions. Word has length 240 [2019-09-10 02:47:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:09,259 INFO L475 AbstractCegarLoop]: Abstraction has 205679 states and 406409 transitions. [2019-09-10 02:47:09,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:47:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 205679 states and 406409 transitions. [2019-09-10 02:47:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:47:09,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:09,917 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:09,917 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash -395326311, now seen corresponding path program 2 times [2019-09-10 02:47:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:09,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:09,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:47:10,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:47:10,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:47:10,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:47:10,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:47:10,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:47:10,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:47:10,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:47:10,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:47:11,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:47:11,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:47:11,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 3123 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:47:11,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:47:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:47:11,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:47:12,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:47:12,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:47:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:47:12,442 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:47:12,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 21 [2019-09-10 02:47:12,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:12,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:47:12,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:47:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:47:12,444 INFO L87 Difference]: Start difference. First operand 205679 states and 406409 transitions. Second operand 7 states. [2019-09-10 02:47:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:15,284 INFO L93 Difference]: Finished difference Result 205917 states and 406750 transitions. [2019-09-10 02:47:15,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:47:15,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-09-10 02:47:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:23,113 INFO L225 Difference]: With dead ends: 205917 [2019-09-10 02:47:23,113 INFO L226 Difference]: Without dead ends: 205913 [2019-09-10 02:47:23,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:47:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205913 states. [2019-09-10 02:47:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205913 to 205913. [2019-09-10 02:47:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205913 states. [2019-09-10 02:47:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205913 states to 205913 states and 406744 transitions. [2019-09-10 02:47:32,067 INFO L78 Accepts]: Start accepts. Automaton has 205913 states and 406744 transitions. Word has length 240 [2019-09-10 02:47:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:32,068 INFO L475 AbstractCegarLoop]: Abstraction has 205913 states and 406744 transitions. [2019-09-10 02:47:32,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:47:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 205913 states and 406744 transitions. [2019-09-10 02:47:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 02:47:33,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:33,165 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,165 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash 65348662, now seen corresponding path program 1 times [2019-09-10 02:47:33,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:33,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:33,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:47:33,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:33,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:47:33,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:47:33,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:47:33,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-09-10 02:47:33,369 INFO L207 CegarAbsIntRunner]: [79], [82], [83], [86], [92], [116], [119], [129], [130], [132], [137], [141], [157], [160], [169], [170], [173], [174], [175], [177], [259], [262], [268], [287], [289], [293], [296], [297], [298], [301], [307], [343], [345], [347], [354], [361], [364], [373], [384], [386], [389], [393], [394], [396], [397], [400], [410], [439], [478], [479], [482], [491], [498], [671], [673], [674], [675], [713], [716], [730], [769], [771], [774], [775], [776], [779], [785], [786], [788], [791], [795], [819], [823], [826], [834], [837], [875], [877], [880], [882], [885], [887], [889], [892], [908], [917], [921], [923], [925], [928], [935], [942], [945], [947], [1085], [1087], [1104], [1108], [1111], [1125], [1233], [1287], [1309], [1320], [1323], [1324], [1327], [1331], [1335], [1361], [1364], [1366], [1435], [1438], [1444], [1479], [1482], [1484], [1487], [1496], [1502], [1505], [1514], [1708], [1710], [1712], [1714], [1715], [1751], [1752], [1753], [1755], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1776], [1777], [1779], [1780], [1781], [1782], [1795], [1796], [1797], [1798], [1803], [1811], [1812], [1815], [1816], [1821], [1837], [1838], [1839], [1863], [1864], [1879], [1880], [1881], [1883], [1884], [1889], [1890], [1891], [1892], [1893], [1894], [1895], [1896], [1897], [1899], [1900], [1901], [1902], [1923], [1924], [1925], [1926], [1927], [1928], [1929], [1930], [1931], [1932], [1933], [1934], [1935], [1941], [1942], [1961], [1963], [1964], [1981], [1983], [1984], [1985], [1987], [1988], [1989], [1990], [1991], [1992], [1993], [2013], [2014], [2015], [2016], [2017], [2018], [2019], [2020], [2021] [2019-09-10 02:47:33,453 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:47:33,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:47:33,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:47:33,674 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 193 root evaluator evaluations with a maximum evaluation depth of 0. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 380 variables. [2019-09-10 02:47:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:33,681 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:47:33,847 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:47:33,847 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:47:33,859 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-09-10 02:47:33,860 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:47:33,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:47:33,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:47:33,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:33,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:47:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:47:33,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:47:33,864 INFO L87 Difference]: Start difference. First operand 205913 states and 406744 transitions. Second operand 2 states. [2019-09-10 02:47:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:33,865 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:47:33,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:47:33,866 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 241 [2019-09-10 02:47:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:33,866 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:47:33,867 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:47:33,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 240 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:47:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:47:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:47:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:47:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:47:33,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-09-10 02:47:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:33,869 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:47:33,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:47:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:47:33,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:47:33,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:47:33 BoogieIcfgContainer [2019-09-10 02:47:33,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:47:33,881 INFO L168 Benchmark]: Toolchain (without parser) took 123636.74 ms. Allocated memory was 134.2 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 86.0 MB in the beginning and 1.0 GB in the end (delta: -924.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-10 02:47:33,882 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:47:33,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1163.05 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 85.6 MB in the beginning and 124.7 MB in the end (delta: -39.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:33,886 INFO L168 Benchmark]: Boogie Preprocessor took 228.06 ms. Allocated memory is still 201.9 MB. Free memory was 124.7 MB in the beginning and 115.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:33,893 INFO L168 Benchmark]: RCFGBuilder took 2186.59 ms. Allocated memory was 201.9 MB in the beginning and 261.1 MB in the end (delta: 59.2 MB). Free memory was 115.7 MB in the beginning and 132.8 MB in the end (delta: -17.1 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:47:33,894 INFO L168 Benchmark]: TraceAbstraction took 120054.25 ms. Allocated memory was 261.1 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 132.8 MB in the beginning and 1.0 GB in the end (delta: -877.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-10 02:47:33,908 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.24 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1163.05 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 85.6 MB in the beginning and 124.7 MB in the end (delta: -39.2 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 228.06 ms. Allocated memory is still 201.9 MB. Free memory was 124.7 MB in the beginning and 115.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2186.59 ms. Allocated memory was 201.9 MB in the beginning and 261.1 MB in the end (delta: 59.2 MB). Free memory was 115.7 MB in the beginning and 132.8 MB in the end (delta: -17.1 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120054.25 ms. Allocated memory was 261.1 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 132.8 MB in the beginning and 1.0 GB in the end (delta: -877.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2129]: 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 121 procedures, 838 locations, 1 error locations. SAFE Result, 119.9s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 69.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24673 SDtfs, 19559 SDslu, 136230 SDs, 0 SdLazy, 37513 SolverSat, 4507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1186 GetRequests, 839 SyntacticMatches, 2 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205913occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.058333333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 37.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 100529 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5556 NumberOfCodeBlocks, 5537 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5770 ConstructedInterpolants, 0 QuantifiedInterpolants, 1755266 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3123 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 26 InterpolantComputations, 24 PerfectInterpolantSequences, 1020/1025 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...