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_spec8_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:46:27,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:46:27,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:46:27,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:46:27,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:46:27,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:46:27,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:46:27,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:46:27,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:46:27,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:46:27,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:46:27,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:46:27,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:46:27,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:46:27,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:46:27,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:46:27,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:46:27,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:46:27,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:46:27,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:46:27,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:46:27,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:46:27,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:46:27,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:46:27,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:46:27,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:46:27,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:46:27,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:46:27,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:46:27,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:46:27,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:46:27,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:46:27,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:46:27,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:46:27,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:46:27,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:46:27,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:46:27,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:46:27,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:46:27,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:46:27,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:46:27,385 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:46:27,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:46:27,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:46:27,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:46:27,410 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:46:27,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:46:27,411 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:46:27,411 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:46:27,412 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:46:27,412 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:46:27,412 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:46:27,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:46:27,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:46:27,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:46:27,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:46:27,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:46:27,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:46:27,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:46:27,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:46:27,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:46:27,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:46:27,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:46:27,417 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:46:27,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:46:27,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:46:27,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:46:27,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:46:27,418 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:46:27,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:46:27,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:46:27,419 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:46:27,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:46:27,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:46:27,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:46:27,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:46:27,494 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:46:27,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product35.cil.c [2019-09-10 02:46:27,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9748a737/ea2da6545285429f8c40305758f5737e/FLAGaeb291e47 [2019-09-10 02:46:28,172 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:46:28,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product35.cil.c [2019-09-10 02:46:28,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9748a737/ea2da6545285429f8c40305758f5737e/FLAGaeb291e47 [2019-09-10 02:46:28,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9748a737/ea2da6545285429f8c40305758f5737e [2019-09-10 02:46:28,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:46:28,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:46:28,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:46:28,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:46:28,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:46:28,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:46:28" (1/1) ... [2019-09-10 02:46:28,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7478ffe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:28, skipping insertion in model container [2019-09-10 02:46:28,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:46:28" (1/1) ... [2019-09-10 02:46:28,396 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:46:28,487 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:46:29,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:46:29,537 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:46:29,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:46:29,744 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:46:29,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29 WrapperNode [2019-09-10 02:46:29,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:46:29,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:46:29,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:46:29,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:46:29,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (1/1) ... [2019-09-10 02:46:29,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:46:29,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:46:29,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:46:29,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:46:29,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (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:46:30,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:46:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:46:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:46:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:46:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:46:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:46:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-10 02:46:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:46:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:46:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:46:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:46:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:46:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:46:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:46:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:46:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:46:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:46:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:46:30,007 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:46:30,008 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:46:30,008 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:46:30,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-10 02:46:30,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-10 02:46:30,008 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:46:30,008 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:46:30,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:46:30,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:46:30,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:46:30,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:46:30,009 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:46:30,009 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:46:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:46:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:46:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:46:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:46:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:46:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:46:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:46:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:46:30,013 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:46:30,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:46:30,014 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:46:30,014 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:46:30,014 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:46:30,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:46:30,014 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:46:30,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:46:30,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:46:30,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:46:30,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:46:30,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:46:30,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:46:30,016 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:46:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:46:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:46:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:46:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:46:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:46:30,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:46:30,018 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:46:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-10 02:46:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:46:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:46:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:46:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:46:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:46:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:46:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:46:30,022 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:46:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:46:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:46:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:46:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:46:30,023 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:46:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:46:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:46:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:46:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:46:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:46:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:46:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:46:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:46:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:46:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:46:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:46:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:46:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:46:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:46:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:46:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:46:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:46:30,027 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:46:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:46:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:46:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:46:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:46:30,028 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:46:30,029 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:46:30,029 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:46:30,029 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:46:30,029 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:46:30,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-10 02:46:30,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:46:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:46:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:46:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-10 02:46:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:46:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:46:30,030 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:46:30,031 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:46:30,031 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-10 02:46:30,031 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:46:30,031 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:46:30,031 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:46:30,031 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:46:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:46:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:46:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:46:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:46:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:46:30,032 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:46:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:46:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:46:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:46:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:46:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:46:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:46:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:46:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:46:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:46:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:46:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:46:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:46:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:46:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:46:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:46:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:46:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:46:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:46:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:46:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:46:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:46:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:46:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:46:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:46:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:46:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:46:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:46:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:46:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:46:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:46:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:46:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:46:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:46:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:46:30,038 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:46:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:46:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:46:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:46:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:46:30,039 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:46:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:46:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:46:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:46:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:46:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:46:30,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:46:30,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:46:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:46:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:46:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:46:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:46:30,042 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:46:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:46:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:46:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:46:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:46:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:46:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:46:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-10 02:46:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-10 02:46:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:46:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:46:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:46:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:46:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:46:32,364 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:46:32,365 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:46:32,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:46:32 BoogieIcfgContainer [2019-09-10 02:46:32,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:46:32,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:46:32,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:46:32,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:46:32,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:46:28" (1/3) ... [2019-09-10 02:46:32,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff68f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:46:32, skipping insertion in model container [2019-09-10 02:46:32,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:46:29" (2/3) ... [2019-09-10 02:46:32,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff68f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:46:32, skipping insertion in model container [2019-09-10 02:46:32,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:46:32" (3/3) ... [2019-09-10 02:46:32,375 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product35.cil.c [2019-09-10 02:46:32,385 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:46:32,397 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:46:32,414 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:46:32,450 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:46:32,451 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:46:32,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:46:32,452 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:46:32,452 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:46:32,452 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:46:32,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:46:32,452 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:46:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states. [2019-09-10 02:46:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:46:32,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:32,543 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:46:32,546 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:32,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2049044822, now seen corresponding path program 1 times [2019-09-10 02:46:32,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:32,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:32,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:32,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:32,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:46:33,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:33,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:46:33,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:33,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:46:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:46:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:46:33,336 INFO L87 Difference]: Start difference. First operand 687 states. Second operand 2 states. [2019-09-10 02:46:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:33,406 INFO L93 Difference]: Finished difference Result 667 states and 901 transitions. [2019-09-10 02:46:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:46:33,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-10 02:46:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:33,440 INFO L225 Difference]: With dead ends: 667 [2019-09-10 02:46:33,440 INFO L226 Difference]: Without dead ends: 658 [2019-09-10 02:46:33,443 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:46:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-09-10 02:46:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-09-10 02:46:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-10 02:46:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 890 transitions. [2019-09-10 02:46:33,549 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 890 transitions. Word has length 167 [2019-09-10 02:46:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:33,551 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 890 transitions. [2019-09-10 02:46:33,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:46:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 890 transitions. [2019-09-10 02:46:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:46:33,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:33,559 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:46:33,559 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1717757499, now seen corresponding path program 1 times [2019-09-10 02:46:33,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:33,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:33,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:46:33,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:33,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:33,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:33,920 INFO L87 Difference]: Start difference. First operand 658 states and 890 transitions. Second operand 3 states. [2019-09-10 02:46:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:33,991 INFO L93 Difference]: Finished difference Result 661 states and 893 transitions. [2019-09-10 02:46:33,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:33,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 02:46:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:34,007 INFO L225 Difference]: With dead ends: 661 [2019-09-10 02:46:34,008 INFO L226 Difference]: Without dead ends: 661 [2019-09-10 02:46:34,009 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:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-10 02:46:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 660. [2019-09-10 02:46:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 02:46:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 892 transitions. [2019-09-10 02:46:34,059 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 892 transitions. Word has length 168 [2019-09-10 02:46:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:34,060 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 892 transitions. [2019-09-10 02:46:34,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 892 transitions. [2019-09-10 02:46:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 02:46:34,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:34,064 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:46:34,064 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2093739956, now seen corresponding path program 1 times [2019-09-10 02:46:34,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:34,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:34,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:34,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:46:34,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:34,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:34,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:34,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:34,333 INFO L87 Difference]: Start difference. First operand 660 states and 892 transitions. Second operand 3 states. [2019-09-10 02:46:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:34,374 INFO L93 Difference]: Finished difference Result 705 states and 968 transitions. [2019-09-10 02:46:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:34,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 02:46:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:34,382 INFO L225 Difference]: With dead ends: 705 [2019-09-10 02:46:34,382 INFO L226 Difference]: Without dead ends: 705 [2019-09-10 02:46:34,383 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:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-10 02:46:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 704. [2019-09-10 02:46:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-10 02:46:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 967 transitions. [2019-09-10 02:46:34,421 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 967 transitions. Word has length 180 [2019-09-10 02:46:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:34,423 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 967 transitions. [2019-09-10 02:46:34,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 967 transitions. [2019-09-10 02:46:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 02:46:34,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:34,434 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:34,435 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1917860483, now seen corresponding path program 1 times [2019-09-10 02:46:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:34,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:34,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:46:34,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:34,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:34,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:34,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:34,621 INFO L87 Difference]: Start difference. First operand 704 states and 967 transitions. Second operand 3 states. [2019-09-10 02:46:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:34,649 INFO L93 Difference]: Finished difference Result 790 states and 1112 transitions. [2019-09-10 02:46:34,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:34,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 02:46:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:34,656 INFO L225 Difference]: With dead ends: 790 [2019-09-10 02:46:34,656 INFO L226 Difference]: Without dead ends: 790 [2019-09-10 02:46:34,657 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:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-10 02:46:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 789. [2019-09-10 02:46:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-10 02:46:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1111 transitions. [2019-09-10 02:46:34,690 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1111 transitions. Word has length 181 [2019-09-10 02:46:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:34,691 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1111 transitions. [2019-09-10 02:46:34,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1111 transitions. [2019-09-10 02:46:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 02:46:34,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:34,698 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:46:34,698 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash 556295988, now seen corresponding path program 1 times [2019-09-10 02:46:34,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:34,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:34,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 02:46:35,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:35,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:35,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:35,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:35,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:35,019 INFO L87 Difference]: Start difference. First operand 789 states and 1111 transitions. Second operand 3 states. [2019-09-10 02:46:35,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:35,046 INFO L93 Difference]: Finished difference Result 954 states and 1388 transitions. [2019-09-10 02:46:35,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:35,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 02:46:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:35,055 INFO L225 Difference]: With dead ends: 954 [2019-09-10 02:46:35,055 INFO L226 Difference]: Without dead ends: 954 [2019-09-10 02:46:35,056 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:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-10 02:46:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 953. [2019-09-10 02:46:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-10 02:46:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1387 transitions. [2019-09-10 02:46:35,093 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1387 transitions. Word has length 182 [2019-09-10 02:46:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:35,093 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1387 transitions. [2019-09-10 02:46:35,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1387 transitions. [2019-09-10 02:46:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 02:46:35,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:35,099 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:46:35,099 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash -398508003, now seen corresponding path program 1 times [2019-09-10 02:46:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:35,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:46:35,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:35,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:35,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:35,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:35,331 INFO L87 Difference]: Start difference. First operand 953 states and 1387 transitions. Second operand 3 states. [2019-09-10 02:46:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:35,368 INFO L93 Difference]: Finished difference Result 1094 states and 1587 transitions. [2019-09-10 02:46:35,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:35,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 02:46:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:35,377 INFO L225 Difference]: With dead ends: 1094 [2019-09-10 02:46:35,377 INFO L226 Difference]: Without dead ends: 1094 [2019-09-10 02:46:35,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-10 02:46:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1093. [2019-09-10 02:46:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-09-10 02:46:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1584 transitions. [2019-09-10 02:46:35,419 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1584 transitions. Word has length 184 [2019-09-10 02:46:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:35,420 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1584 transitions. [2019-09-10 02:46:35,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1584 transitions. [2019-09-10 02:46:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 02:46:35,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:35,431 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:35,431 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash -167553219, now seen corresponding path program 1 times [2019-09-10 02:46:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:35,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:35,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 02:46:35,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:35,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:46:35,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:35,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:46:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:46:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:46:35,948 INFO L87 Difference]: Start difference. First operand 1093 states and 1584 transitions. Second operand 6 states. [2019-09-10 02:46:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:36,841 INFO L93 Difference]: Finished difference Result 2137 states and 3120 transitions. [2019-09-10 02:46:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:46:36,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2019-09-10 02:46:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:36,856 INFO L225 Difference]: With dead ends: 2137 [2019-09-10 02:46:36,856 INFO L226 Difference]: Without dead ends: 2137 [2019-09-10 02:46:36,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:46:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-09-10 02:46:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2126. [2019-09-10 02:46:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-09-10 02:46:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3110 transitions. [2019-09-10 02:46:36,948 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3110 transitions. Word has length 340 [2019-09-10 02:46:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:36,951 INFO L475 AbstractCegarLoop]: Abstraction has 2126 states and 3110 transitions. [2019-09-10 02:46:36,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:46:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3110 transitions. [2019-09-10 02:46:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-10 02:46:36,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:36,967 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:36,967 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1752113541, now seen corresponding path program 1 times [2019-09-10 02:46:36,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:36,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:36,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-10 02:46:37,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:46:37,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:37,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:46:37,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:46:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:46:37,490 INFO L87 Difference]: Start difference. First operand 2126 states and 3110 transitions. Second operand 11 states. [2019-09-10 02:46:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:38,076 INFO L93 Difference]: Finished difference Result 2114 states and 3080 transitions. [2019-09-10 02:46:38,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:46:38,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 341 [2019-09-10 02:46:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:38,096 INFO L225 Difference]: With dead ends: 2114 [2019-09-10 02:46:38,097 INFO L226 Difference]: Without dead ends: 2100 [2019-09-10 02:46:38,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:46:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-09-10 02:46:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2096. [2019-09-10 02:46:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-10 02:46:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3059 transitions. [2019-09-10 02:46:38,190 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3059 transitions. Word has length 341 [2019-09-10 02:46:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:38,192 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3059 transitions. [2019-09-10 02:46:38,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:46:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3059 transitions. [2019-09-10 02:46:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-10 02:46:38,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:38,213 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,214 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash -678612977, now seen corresponding path program 1 times [2019-09-10 02:46:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-10 02:46:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:38,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:38,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:38,543 INFO L87 Difference]: Start difference. First operand 2096 states and 3059 transitions. Second operand 3 states. [2019-09-10 02:46:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:38,608 INFO L93 Difference]: Finished difference Result 2730 states and 4125 transitions. [2019-09-10 02:46:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:38,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-09-10 02:46:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:38,624 INFO L225 Difference]: With dead ends: 2730 [2019-09-10 02:46:38,624 INFO L226 Difference]: Without dead ends: 2730 [2019-09-10 02:46:38,626 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:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-09-10 02:46:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2728. [2019-09-10 02:46:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2019-09-10 02:46:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 4123 transitions. [2019-09-10 02:46:38,727 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 4123 transitions. Word has length 383 [2019-09-10 02:46:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:38,728 INFO L475 AbstractCegarLoop]: Abstraction has 2728 states and 4123 transitions. [2019-09-10 02:46:38,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 4123 transitions. [2019-09-10 02:46:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-10 02:46:38,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:38,749 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash 203542084, now seen corresponding path program 1 times [2019-09-10 02:46:38,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 02:46:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:39,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:39,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:39,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:39,026 INFO L87 Difference]: Start difference. First operand 2728 states and 4123 transitions. Second operand 3 states. [2019-09-10 02:46:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:39,075 INFO L93 Difference]: Finished difference Result 3946 states and 6157 transitions. [2019-09-10 02:46:39,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:39,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 367 [2019-09-10 02:46:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:39,100 INFO L225 Difference]: With dead ends: 3946 [2019-09-10 02:46:39,100 INFO L226 Difference]: Without dead ends: 3946 [2019-09-10 02:46:39,101 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:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-09-10 02:46:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3944. [2019-09-10 02:46:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-09-10 02:46:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 6155 transitions. [2019-09-10 02:46:39,231 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 6155 transitions. Word has length 367 [2019-09-10 02:46:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:39,231 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 6155 transitions. [2019-09-10 02:46:39,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 6155 transitions. [2019-09-10 02:46:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-10 02:46:39,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:39,257 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,257 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash 295157851, now seen corresponding path program 1 times [2019-09-10 02:46:39,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:39,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:39,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:39,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 02:46:39,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:39,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:39,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:39,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:39,575 INFO L87 Difference]: Start difference. First operand 3944 states and 6155 transitions. Second operand 3 states. [2019-09-10 02:46:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:39,629 INFO L93 Difference]: Finished difference Result 6282 states and 10029 transitions. [2019-09-10 02:46:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:39,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2019-09-10 02:46:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:39,675 INFO L225 Difference]: With dead ends: 6282 [2019-09-10 02:46:39,675 INFO L226 Difference]: Without dead ends: 6282 [2019-09-10 02:46:39,676 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:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2019-09-10 02:46:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6280. [2019-09-10 02:46:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2019-09-10 02:46:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 10027 transitions. [2019-09-10 02:46:39,875 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 10027 transitions. Word has length 368 [2019-09-10 02:46:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:39,876 INFO L475 AbstractCegarLoop]: Abstraction has 6280 states and 10027 transitions. [2019-09-10 02:46:39,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 10027 transitions. [2019-09-10 02:46:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-10 02:46:39,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:39,928 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,929 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1899067076, now seen corresponding path program 1 times [2019-09-10 02:46:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:39,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:39,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:39,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:39,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 02:46:40,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:40,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:46:40,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:40,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:46:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:46:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:46:40,384 INFO L87 Difference]: Start difference. First operand 6280 states and 10027 transitions. Second operand 3 states. [2019-09-10 02:46:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:40,465 INFO L93 Difference]: Finished difference Result 10762 states and 17389 transitions. [2019-09-10 02:46:40,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:46:40,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 369 [2019-09-10 02:46:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:40,535 INFO L225 Difference]: With dead ends: 10762 [2019-09-10 02:46:40,535 INFO L226 Difference]: Without dead ends: 10762 [2019-09-10 02:46:40,536 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:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10762 states. [2019-09-10 02:46:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10762 to 10760. [2019-09-10 02:46:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10760 states. [2019-09-10 02:46:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10760 states to 10760 states and 17387 transitions. [2019-09-10 02:46:40,939 INFO L78 Accepts]: Start accepts. Automaton has 10760 states and 17387 transitions. Word has length 369 [2019-09-10 02:46:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:40,940 INFO L475 AbstractCegarLoop]: Abstraction has 10760 states and 17387 transitions. [2019-09-10 02:46:40,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:46:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 10760 states and 17387 transitions. [2019-09-10 02:46:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-10 02:46:41,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:41,019 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:41,020 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1047746023, now seen corresponding path program 1 times [2019-09-10 02:46:41,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:41,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:41,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 02:46:42,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:46:42,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:46:42,022 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 350 with the following transitions: [2019-09-10 02:46:42,027 INFO L207 CegarAbsIntRunner]: [29], [30], [44], [47], [54], [56], [72], [75], [85], [116], [119], [129], [130], [133], [138], [140], [142], [159], [162], [163], [164], [166], [276], [278], [281], [282], [285], [286], [287], [290], [296], [297], [298], [318], [321], [327], [329], [332], [334], [336], [343], [346], [347], [349], [350], [353], [362], [373], [375], [378], [382], [383], [385], [386], [389], [399], [400], [401], [428], [430], [442], [464], [466], [467], [470], [472], [477], [481], [483], [497], [499], [500], [507], [510], [680], [682], [683], [684], [722], [725], [739], [778], [780], [782], [784], [785], [786], [797], [799], [802], [806], [820], [824], [827], [845], [848], [872], [875], [885], [886], [889], [914], [917], [920], [929], [933], [935], [937], [940], [947], [954], [957], [959], [1097], [1099], [1116], [1119], [1120], [1123], [1137], [1245], [1299], [1302], [1321], [1332], [1335], [1336], [1339], [1342], [1373], [1376], [1378], [1380], [1447], [1450], [1460], [1461], [1464], [1470], [1491], [1494], [1508], [1514], [1517], [1526], [1540], [1541], [1720], [1722], [1724], [1726], [1727], [1739], [1740], [1741], [1742], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1771], [1773], [1774], [1775], [1776], [1777], [1778], [1781], [1782], [1783], [1784], [1785], [1786], [1787], [1788], [1789], [1790], [1797], [1798], [1799], [1800], [1803], [1804], [1805], [1806], [1811], [1812], [1813], [1814], [1819], [1820], [1823], [1824], [1829], [1830], [1843], [1844], [1845], [1846], [1847], [1849], [1850], [1851], [1852], [1853], [1854], [1875], [1876], [1891], [1892], [1893], [1894], [1895], [1896], [1897], [1898], [1903], [1904], [1905], [1906], [1907], [1908], [1909], [1910], [1911], [1913], [1914], [1915], [1916], [1937], [1938], [1939], [1940], [1951], [1952], [1957], [1958], [1977], [1979], [1980], [1997], [1998], [1999], [2000], [2001], [2002], [2003], [2004], [2005], [2006], [2007], [2008], [2009], [2010], [2029], [2030], [2031], [2032], [2033], [2034], [2035], [2036], [2037] [2019-09-10 02:46:42,101 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:46:42,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:46:42,224 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:46:42,226 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 216 root evaluator evaluations with a maximum evaluation depth of 0. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 398 variables. [2019-09-10 02:46:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:42,231 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:46:42,342 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:46:42,342 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:46:42,355 INFO L420 sIntCurrentIteration]: We unified 348 AI predicates to 348 [2019-09-10 02:46:42,356 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:46:42,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:46:42,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [22] total 22 [2019-09-10 02:46:42,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:42,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:46:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:46:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:46:42,361 INFO L87 Difference]: Start difference. First operand 10760 states and 17387 transitions. Second operand 2 states. [2019-09-10 02:46:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:42,362 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:46:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:46:42,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 349 [2019-09-10 02:46:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:42,364 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:46:42,364 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:46:42,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 348 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:46:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:46:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:46:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:46:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:46:42,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 349 [2019-09-10 02:46:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:42,365 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:46:42,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:46:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:46:42,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:46:42,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:46:42 BoogieIcfgContainer [2019-09-10 02:46:42,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:46:42,374 INFO L168 Benchmark]: Toolchain (without parser) took 13993.93 ms. Allocated memory was 134.2 MB in the beginning and 771.2 MB in the end (delta: 637.0 MB). Free memory was 87.2 MB in the beginning and 633.5 MB in the end (delta: -546.3 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:42,376 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 108.4 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:46:42,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1364.36 ms. Allocated memory was 134.2 MB in the beginning and 207.1 MB in the end (delta: 72.9 MB). Free memory was 87.0 MB in the beginning and 134.2 MB in the end (delta: -47.2 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:42,383 INFO L168 Benchmark]: Boogie Preprocessor took 176.20 ms. Allocated memory is still 207.1 MB. Free memory was 134.2 MB in the beginning and 124.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:42,384 INFO L168 Benchmark]: RCFGBuilder took 2445.08 ms. Allocated memory was 207.1 MB in the beginning and 258.5 MB in the end (delta: 51.4 MB). Free memory was 124.8 MB in the beginning and 124.9 MB in the end (delta: -99.4 kB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:42,386 INFO L168 Benchmark]: TraceAbstraction took 10003.83 ms. Allocated memory was 258.5 MB in the beginning and 771.2 MB in the end (delta: 512.8 MB). Free memory was 124.9 MB in the beginning and 633.5 MB in the end (delta: -508.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:42,399 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1364.36 ms. Allocated memory was 134.2 MB in the beginning and 207.1 MB in the end (delta: 72.9 MB). Free memory was 87.0 MB in the beginning and 134.2 MB in the end (delta: -47.2 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 176.20 ms. Allocated memory is still 207.1 MB. Free memory was 134.2 MB in the beginning and 124.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2445.08 ms. Allocated memory was 207.1 MB in the beginning and 258.5 MB in the end (delta: 51.4 MB). Free memory was 124.8 MB in the beginning and 124.9 MB in the end (delta: -99.4 kB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10003.83 ms. Allocated memory was 258.5 MB in the beginning and 771.2 MB in the end (delta: 512.8 MB). Free memory was 124.9 MB in the beginning and 633.5 MB in the end (delta: -508.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 890]: 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 122 procedures, 846 locations, 1 error locations. SAFE Result, 9.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10954 SDtfs, 2652 SDslu, 18273 SDs, 0 SdLazy, 524 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10760occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.8218390804597702 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 28 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3579 NumberOfCodeBlocks, 3579 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3566 ConstructedInterpolants, 0 QuantifiedInterpolants, 1273616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1038/1049 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...