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_spec6_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:43:43,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:43:43,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:43:43,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:43:43,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:43:43,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:43:43,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:43:43,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:43:43,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:43:43,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:43:43,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:43:43,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:43:43,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:43:43,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:43:43,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:43:43,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:43:43,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:43:43,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:43:43,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:43:43,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:43:43,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:43:43,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:43:43,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:43:43,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:43:43,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:43:43,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:43:43,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:43:43,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:43:43,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:43:43,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:43:43,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:43:43,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:43:43,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:43:43,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:43:43,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:43:43,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:43:43,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:43:43,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:43:43,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:43:43,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:43:43,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:43:43,834 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:43:43,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:43:43,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:43:43,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:43:43,851 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:43:43,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:43:43,852 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:43:43,852 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:43:43,852 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:43:43,853 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:43:43,853 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:43:43,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:43:43,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:43:43,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:43:43,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:43:43,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:43:43,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:43:43,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:43:43,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:43:43,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:43:43,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:43:43,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:43:43,856 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:43:43,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:43:43,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:43:43,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:43:43,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:43:43,857 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:43:43,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:43:43,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:43:43,858 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:43:43,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:43:43,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:43:43,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:43:43,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:43:43,916 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:43:43,917 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product33.cil.c [2019-09-10 02:43:43,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066caa4b9/1581b43538e24698b005cf4dcda74cbf/FLAG705b099df [2019-09-10 02:43:44,678 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:43:44,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product33.cil.c [2019-09-10 02:43:44,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066caa4b9/1581b43538e24698b005cf4dcda74cbf/FLAG705b099df [2019-09-10 02:43:44,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066caa4b9/1581b43538e24698b005cf4dcda74cbf [2019-09-10 02:43:44,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:43:44,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:43:44,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:43:44,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:43:44,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:43:44,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:43:44" (1/1) ... [2019-09-10 02:43:44,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8c5937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:44, skipping insertion in model container [2019-09-10 02:43:44,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:43:44" (1/1) ... [2019-09-10 02:43:44,917 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:43:45,008 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:43:45,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:43:45,772 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:43:45,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:43:46,011 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:43:46,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46 WrapperNode [2019-09-10 02:43:46,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:43:46,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:43:46,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:43:46,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:43:46,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (1/1) ... [2019-09-10 02:43:46,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:43:46,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:43:46,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:43:46,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:43:46,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (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:43:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:43:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:43:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:43:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:43:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:43:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:43:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:43:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:43:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:43:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:43:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:43:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:43:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:43:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:43:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:43:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:43:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:43:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:43:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:43:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:43:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:43:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:43:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:43:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:43:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:43:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:43:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:43:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:43:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:43:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:43:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:43:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:43:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:43:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:43:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:43:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:43:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:43:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:43:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:43:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:43:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:43:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:43:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:43:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:43:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:43:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:43:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:43:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:43:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:43:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:43:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:43:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:43:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:43:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:43:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:43:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:43:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:43:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:43:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:43:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:43:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:43:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:43:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:43:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:43:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:43:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:43:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:43:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:43:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:43:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:43:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:43:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:43:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:43:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:43:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:43:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:43:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:43:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:43:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:43:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:43:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:43:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:43:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:43:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:43:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:43:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:43:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:43:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:43:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:43:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:43:46,365 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:43:46,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:43:46,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:43:46,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:43:46,365 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:43:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:43:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:43:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:43:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:43:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:43:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:43:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-10 02:43:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-10 02:43:46,367 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:43:46,368 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:43:46,368 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:43:46,368 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:43:46,368 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:43:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:43:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:43:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:43:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:43:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:43:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:43:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:43:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:43:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:43:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:43:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:43:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:43:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:43:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:43:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:43:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:43:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:43:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:43:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:43:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:43:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:43:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:43:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:43:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:43:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:43:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:43:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:43:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:43:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:43:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:43:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:43:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:43:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:43:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:43:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:43:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:43:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:43:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:43:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:43:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:43:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:43:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:43:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:43:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:43:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:43:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:43:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:43:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:43:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:43:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:43:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:43:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:43:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:43:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:43:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:43:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:43:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:43:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:43:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:43:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:43:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:43:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:43:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:43:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:43:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:43:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:43:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:43:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:43:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:43:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:43:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:43:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:43:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:43:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:43:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:43:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:43:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:43:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:43:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:43:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:43:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:43:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:43:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:43:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:43:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:43:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-10 02:43:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-10 02:43:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:43:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:43:46,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:43:48,798 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:43:48,798 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:43:48,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:43:48 BoogieIcfgContainer [2019-09-10 02:43:48,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:43:48,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:43:48,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:43:48,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:43:48,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:43:44" (1/3) ... [2019-09-10 02:43:48,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afc263d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:43:48, skipping insertion in model container [2019-09-10 02:43:48,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:46" (2/3) ... [2019-09-10 02:43:48,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afc263d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:43:48, skipping insertion in model container [2019-09-10 02:43:48,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:43:48" (3/3) ... [2019-09-10 02:43:48,813 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product33.cil.c [2019-09-10 02:43:48,825 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:43:48,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:43:48,859 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:43:48,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:43:48,908 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:43:48,916 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:43:48,916 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:43:48,916 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:43:48,916 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:43:48,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:43:48,917 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:43:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-09-10 02:43:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 02:43:49,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:49,009 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:49,014 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1571971609, now seen corresponding path program 1 times [2019-09-10 02:43:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:49,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:49,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:49,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:49,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:49,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:49,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:43:49,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:49,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:43:49,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:43:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:43:49,869 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-09-10 02:43:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:49,957 INFO L93 Difference]: Finished difference Result 584 states and 770 transitions. [2019-09-10 02:43:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:43:49,959 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 189 [2019-09-10 02:43:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:49,993 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:43:49,993 INFO L226 Difference]: Without dead ends: 575 [2019-09-10 02:43:49,996 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:43:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-10 02:43:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-10 02:43:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-10 02:43:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 759 transitions. [2019-09-10 02:43:50,093 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 759 transitions. Word has length 189 [2019-09-10 02:43:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:50,097 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 759 transitions. [2019-09-10 02:43:50,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:43:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 759 transitions. [2019-09-10 02:43:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 02:43:50,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:50,113 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:50,113 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash -84280545, now seen corresponding path program 1 times [2019-09-10 02:43:50,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:50,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:50,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:50,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:50,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:50,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:50,396 INFO L87 Difference]: Start difference. First operand 575 states and 759 transitions. Second operand 3 states. [2019-09-10 02:43:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:50,470 INFO L93 Difference]: Finished difference Result 578 states and 762 transitions. [2019-09-10 02:43:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:50,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 02:43:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:50,479 INFO L225 Difference]: With dead ends: 578 [2019-09-10 02:43:50,479 INFO L226 Difference]: Without dead ends: 578 [2019-09-10 02:43:50,480 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:43:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-10 02:43:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2019-09-10 02:43:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-10 02:43:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 761 transitions. [2019-09-10 02:43:50,536 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 761 transitions. Word has length 190 [2019-09-10 02:43:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:50,538 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 761 transitions. [2019-09-10 02:43:50,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 761 transitions. [2019-09-10 02:43:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:43:50,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:50,545 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:50,545 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 364513166, now seen corresponding path program 1 times [2019-09-10 02:43:50,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:50,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:50,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:50,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:50,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:50,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:50,831 INFO L87 Difference]: Start difference. First operand 577 states and 761 transitions. Second operand 3 states. [2019-09-10 02:43:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:50,859 INFO L93 Difference]: Finished difference Result 620 states and 834 transitions. [2019-09-10 02:43:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:50,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 02:43:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:50,865 INFO L225 Difference]: With dead ends: 620 [2019-09-10 02:43:50,865 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:43:50,866 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:43:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:43:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 619. [2019-09-10 02:43:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-10 02:43:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 833 transitions. [2019-09-10 02:43:50,892 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 833 transitions. Word has length 202 [2019-09-10 02:43:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:50,892 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 833 transitions. [2019-09-10 02:43:50,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 833 transitions. [2019-09-10 02:43:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 02:43:50,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:50,898 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:50,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:50,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1378845606, now seen corresponding path program 1 times [2019-09-10 02:43:50,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:51,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:51,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:51,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:51,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:51,052 INFO L87 Difference]: Start difference. First operand 619 states and 833 transitions. Second operand 3 states. [2019-09-10 02:43:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:51,079 INFO L93 Difference]: Finished difference Result 701 states and 972 transitions. [2019-09-10 02:43:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:51,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 02:43:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:51,086 INFO L225 Difference]: With dead ends: 701 [2019-09-10 02:43:51,086 INFO L226 Difference]: Without dead ends: 701 [2019-09-10 02:43:51,086 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:43:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-09-10 02:43:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-09-10 02:43:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-10 02:43:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 971 transitions. [2019-09-10 02:43:51,113 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 971 transitions. Word has length 203 [2019-09-10 02:43:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:51,113 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 971 transitions. [2019-09-10 02:43:51,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 971 transitions. [2019-09-10 02:43:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 02:43:51,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:51,119 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:51,119 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash 402895277, now seen corresponding path program 1 times [2019-09-10 02:43:51,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:51,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:51,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:51,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:51,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:51,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:51,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:43:51,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:51,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:43:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:43:51,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:43:51,572 INFO L87 Difference]: Start difference. First operand 700 states and 971 transitions. Second operand 11 states. [2019-09-10 02:43:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:57,853 INFO L93 Difference]: Finished difference Result 3057 states and 4096 transitions. [2019-09-10 02:43:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:43:57,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 206 [2019-09-10 02:43:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:57,875 INFO L225 Difference]: With dead ends: 3057 [2019-09-10 02:43:57,876 INFO L226 Difference]: Without dead ends: 2603 [2019-09-10 02:43:57,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:43:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-09-10 02:43:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2588. [2019-09-10 02:43:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-09-10 02:43:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3416 transitions. [2019-09-10 02:43:58,015 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3416 transitions. Word has length 206 [2019-09-10 02:43:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:58,016 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 3416 transitions. [2019-09-10 02:43:58,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:43:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3416 transitions. [2019-09-10 02:43:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:43:58,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:58,021 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:58,021 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash 932962740, now seen corresponding path program 1 times [2019-09-10 02:43:58,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:58,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:58,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:58,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:58,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:43:58,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:58,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:43:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:43:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:43:58,354 INFO L87 Difference]: Start difference. First operand 2588 states and 3416 transitions. Second operand 18 states. [2019-09-10 02:43:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:58,815 INFO L93 Difference]: Finished difference Result 2533 states and 3347 transitions. [2019-09-10 02:43:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:43:58,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 207 [2019-09-10 02:43:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:58,828 INFO L225 Difference]: With dead ends: 2533 [2019-09-10 02:43:58,828 INFO L226 Difference]: Without dead ends: 2087 [2019-09-10 02:43:58,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:43:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2019-09-10 02:43:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2047. [2019-09-10 02:43:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-09-10 02:43:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2703 transitions. [2019-09-10 02:43:58,908 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2703 transitions. Word has length 207 [2019-09-10 02:43:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:58,909 INFO L475 AbstractCegarLoop]: Abstraction has 2047 states and 2703 transitions. [2019-09-10 02:43:58,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:43:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2703 transitions. [2019-09-10 02:43:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 02:43:58,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:58,914 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:58,915 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1982112620, now seen corresponding path program 1 times [2019-09-10 02:43:58,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:58,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:59,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:59,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:59,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:59,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:59,156 INFO L87 Difference]: Start difference. First operand 2047 states and 2703 transitions. Second operand 6 states. [2019-09-10 02:43:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:59,834 INFO L93 Difference]: Finished difference Result 4085 states and 5425 transitions. [2019-09-10 02:43:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:43:59,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2019-09-10 02:43:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:59,856 INFO L225 Difference]: With dead ends: 4085 [2019-09-10 02:43:59,857 INFO L226 Difference]: Without dead ends: 4085 [2019-09-10 02:43:59,857 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:43:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-09-10 02:43:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4014. [2019-09-10 02:43:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4014 states. [2019-09-10 02:43:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 5337 transitions. [2019-09-10 02:43:59,982 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 5337 transitions. Word has length 216 [2019-09-10 02:43:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:59,982 INFO L475 AbstractCegarLoop]: Abstraction has 4014 states and 5337 transitions. [2019-09-10 02:43:59,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 5337 transitions. [2019-09-10 02:43:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 02:43:59,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:59,990 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:59,990 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash -824209956, now seen corresponding path program 1 times [2019-09-10 02:43:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:59,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:59,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:44:00,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:00,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:44:00,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:00,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:44:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:44:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:44:00,201 INFO L87 Difference]: Start difference. First operand 4014 states and 5337 transitions. Second operand 11 states. [2019-09-10 02:44:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:00,661 INFO L93 Difference]: Finished difference Result 4050 states and 5385 transitions. [2019-09-10 02:44:00,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:44:00,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 217 [2019-09-10 02:44:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:00,685 INFO L225 Difference]: With dead ends: 4050 [2019-09-10 02:44:00,685 INFO L226 Difference]: Without dead ends: 4032 [2019-09-10 02:44:00,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:44:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-09-10 02:44:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 4002. [2019-09-10 02:44:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4002 states. [2019-09-10 02:44:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5311 transitions. [2019-09-10 02:44:00,810 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 5311 transitions. Word has length 217 [2019-09-10 02:44:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:00,810 INFO L475 AbstractCegarLoop]: Abstraction has 4002 states and 5311 transitions. [2019-09-10 02:44:00,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:44:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 5311 transitions. [2019-09-10 02:44:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 02:44:00,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:00,818 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:00,818 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash -237433837, now seen corresponding path program 1 times [2019-09-10 02:44:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:00,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:00,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:44:01,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:01,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:44:01,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:01,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:44:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:44:01,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:44:01,048 INFO L87 Difference]: Start difference. First operand 4002 states and 5311 transitions. Second operand 5 states. [2019-09-10 02:44:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:02,661 INFO L93 Difference]: Finished difference Result 10686 states and 14177 transitions. [2019-09-10 02:44:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:44:02,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-09-10 02:44:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:02,725 INFO L225 Difference]: With dead ends: 10686 [2019-09-10 02:44:02,725 INFO L226 Difference]: Without dead ends: 9442 [2019-09-10 02:44:02,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:44:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9442 states. [2019-09-10 02:44:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9442 to 9162. [2019-09-10 02:44:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9162 states. [2019-09-10 02:44:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9162 states to 9162 states and 12207 transitions. [2019-09-10 02:44:03,009 INFO L78 Accepts]: Start accepts. Automaton has 9162 states and 12207 transitions. Word has length 217 [2019-09-10 02:44:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:03,010 INFO L475 AbstractCegarLoop]: Abstraction has 9162 states and 12207 transitions. [2019-09-10 02:44:03,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:44:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 9162 states and 12207 transitions. [2019-09-10 02:44:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 02:44:03,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:03,023 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:03,023 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash -111913891, now seen corresponding path program 1 times [2019-09-10 02:44:03,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:03,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:03,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:44:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:03,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:03,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:03,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:03,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:03,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:03,255 INFO L87 Difference]: Start difference. First operand 9162 states and 12207 transitions. Second operand 3 states. [2019-09-10 02:44:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:03,367 INFO L93 Difference]: Finished difference Result 9790 states and 13357 transitions. [2019-09-10 02:44:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:03,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 02:44:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:03,423 INFO L225 Difference]: With dead ends: 9790 [2019-09-10 02:44:03,424 INFO L226 Difference]: Without dead ends: 9790 [2019-09-10 02:44:03,424 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:44:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2019-09-10 02:44:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 9786. [2019-09-10 02:44:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9786 states. [2019-09-10 02:44:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 13353 transitions. [2019-09-10 02:44:03,757 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 13353 transitions. Word has length 238 [2019-09-10 02:44:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:03,759 INFO L475 AbstractCegarLoop]: Abstraction has 9786 states and 13353 transitions. [2019-09-10 02:44:03,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 13353 transitions. [2019-09-10 02:44:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 02:44:03,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:03,788 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:03,788 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:03,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:03,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1314396235, now seen corresponding path program 1 times [2019-09-10 02:44:03,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:03,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:03,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:03,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:03,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:44:04,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:04,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:44:04,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:04,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:44:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:44:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:04,051 INFO L87 Difference]: Start difference. First operand 9786 states and 13353 transitions. Second operand 8 states. [2019-09-10 02:44:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:09,211 INFO L93 Difference]: Finished difference Result 20003 states and 28425 transitions. [2019-09-10 02:44:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:44:09,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-09-10 02:44:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:09,314 INFO L225 Difference]: With dead ends: 20003 [2019-09-10 02:44:09,315 INFO L226 Difference]: Without dead ends: 20003 [2019-09-10 02:44:09,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:44:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20003 states. [2019-09-10 02:44:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20003 to 12038. [2019-09-10 02:44:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12038 states. [2019-09-10 02:44:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12038 states to 12038 states and 17849 transitions. [2019-09-10 02:44:09,896 INFO L78 Accepts]: Start accepts. Automaton has 12038 states and 17849 transitions. Word has length 239 [2019-09-10 02:44:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:09,897 INFO L475 AbstractCegarLoop]: Abstraction has 12038 states and 17849 transitions. [2019-09-10 02:44:09,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:44:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 12038 states and 17849 transitions. [2019-09-10 02:44:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 02:44:09,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:09,944 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:09,945 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash -554622569, now seen corresponding path program 1 times [2019-09-10 02:44:09,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:09,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:09,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:09,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:44:10,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:44:10,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:10,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:44:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:44:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:10,241 INFO L87 Difference]: Start difference. First operand 12038 states and 17849 transitions. Second operand 8 states. [2019-09-10 02:44:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:15,466 INFO L93 Difference]: Finished difference Result 25043 states and 39321 transitions. [2019-09-10 02:44:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:44:15,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 255 [2019-09-10 02:44:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:15,582 INFO L225 Difference]: With dead ends: 25043 [2019-09-10 02:44:15,582 INFO L226 Difference]: Without dead ends: 25043 [2019-09-10 02:44:15,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:44:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25043 states. [2019-09-10 02:44:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25043 to 16662. [2019-09-10 02:44:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16662 states. [2019-09-10 02:44:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16662 states to 16662 states and 27681 transitions. [2019-09-10 02:44:16,977 INFO L78 Accepts]: Start accepts. Automaton has 16662 states and 27681 transitions. Word has length 255 [2019-09-10 02:44:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:16,977 INFO L475 AbstractCegarLoop]: Abstraction has 16662 states and 27681 transitions. [2019-09-10 02:44:16,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:44:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 16662 states and 27681 transitions. [2019-09-10 02:44:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 02:44:17,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:17,085 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:17,085 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 846449969, now seen corresponding path program 1 times [2019-09-10 02:44:17,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:17,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:17,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:17,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:17,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:44:17,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:17,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:44:17,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:17,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:44:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:44:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:17,381 INFO L87 Difference]: Start difference. First operand 16662 states and 27681 transitions. Second operand 8 states. [2019-09-10 02:44:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:22,461 INFO L93 Difference]: Finished difference Result 35275 states and 62749 transitions. [2019-09-10 02:44:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:44:22,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-09-10 02:44:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:22,667 INFO L225 Difference]: With dead ends: 35275 [2019-09-10 02:44:22,667 INFO L226 Difference]: Without dead ends: 35275 [2019-09-10 02:44:22,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:44:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35275 states. [2019-09-10 02:44:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35275 to 26038. [2019-09-10 02:44:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26038 states. [2019-09-10 02:44:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26038 states to 26038 states and 48885 transitions. [2019-09-10 02:44:24,881 INFO L78 Accepts]: Start accepts. Automaton has 26038 states and 48885 transitions. Word has length 241 [2019-09-10 02:44:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:24,881 INFO L475 AbstractCegarLoop]: Abstraction has 26038 states and 48885 transitions. [2019-09-10 02:44:24,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:44:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 26038 states and 48885 transitions. [2019-09-10 02:44:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 02:44:25,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:25,119 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:25,119 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1917598313, now seen corresponding path program 1 times [2019-09-10 02:44:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:25,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:25,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:44:25,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:25,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:44:25,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:25,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:44:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:44:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:44:25,353 INFO L87 Difference]: Start difference. First operand 26038 states and 48885 transitions. Second operand 11 states. [2019-09-10 02:44:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:26,612 INFO L93 Difference]: Finished difference Result 32860 states and 57821 transitions. [2019-09-10 02:44:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:44:26,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 245 [2019-09-10 02:44:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:26,754 INFO L225 Difference]: With dead ends: 32860 [2019-09-10 02:44:26,754 INFO L226 Difference]: Without dead ends: 32856 [2019-09-10 02:44:26,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:44:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32856 states. [2019-09-10 02:44:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32856 to 32546. [2019-09-10 02:44:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32546 states. [2019-09-10 02:44:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32546 states to 32546 states and 57413 transitions. [2019-09-10 02:44:27,959 INFO L78 Accepts]: Start accepts. Automaton has 32546 states and 57413 transitions. Word has length 245 [2019-09-10 02:44:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:27,960 INFO L475 AbstractCegarLoop]: Abstraction has 32546 states and 57413 transitions. [2019-09-10 02:44:27,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:44:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 32546 states and 57413 transitions. [2019-09-10 02:44:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 02:44:28,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:28,102 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:28,102 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1297200505, now seen corresponding path program 1 times [2019-09-10 02:44:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:28,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:28,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-10 02:44:28,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:28,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:44:28,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:28,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:44:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:44:28,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:44:28,309 INFO L87 Difference]: Start difference. First operand 32546 states and 57413 transitions. Second operand 6 states. [2019-09-10 02:44:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:29,039 INFO L93 Difference]: Finished difference Result 32624 states and 57497 transitions. [2019-09-10 02:44:29,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:44:29,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-10 02:44:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:29,169 INFO L225 Difference]: With dead ends: 32624 [2019-09-10 02:44:29,169 INFO L226 Difference]: Without dead ends: 32624 [2019-09-10 02:44:29,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:44:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32624 states. [2019-09-10 02:44:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32624 to 32622. [2019-09-10 02:44:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-09-10 02:44:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 57495 transitions. [2019-09-10 02:44:30,325 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 57495 transitions. Word has length 263 [2019-09-10 02:44:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:30,325 INFO L475 AbstractCegarLoop]: Abstraction has 32622 states and 57495 transitions. [2019-09-10 02:44:30,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:44:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 57495 transitions. [2019-09-10 02:44:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 02:44:30,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:30,409 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:30,410 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -99357324, now seen corresponding path program 1 times [2019-09-10 02:44:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:30,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:44:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:30,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:30,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:30,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:30,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:30,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:30,563 INFO L87 Difference]: Start difference. First operand 32622 states and 57495 transitions. Second operand 3 states. [2019-09-10 02:44:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:30,784 INFO L93 Difference]: Finished difference Result 42226 states and 80795 transitions. [2019-09-10 02:44:30,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:30,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 02:44:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:30,967 INFO L225 Difference]: With dead ends: 42226 [2019-09-10 02:44:30,968 INFO L226 Difference]: Without dead ends: 42226 [2019-09-10 02:44:30,968 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:44:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42226 states. [2019-09-10 02:44:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42226 to 42222. [2019-09-10 02:44:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42222 states. [2019-09-10 02:44:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42222 states to 42222 states and 80791 transitions. [2019-09-10 02:44:33,347 INFO L78 Accepts]: Start accepts. Automaton has 42222 states and 80791 transitions. Word has length 262 [2019-09-10 02:44:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:33,348 INFO L475 AbstractCegarLoop]: Abstraction has 42222 states and 80791 transitions. [2019-09-10 02:44:33,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 42222 states and 80791 transitions. [2019-09-10 02:44:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 02:44:33,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:33,466 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:33,466 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1923426308, now seen corresponding path program 1 times [2019-09-10 02:44:33,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:33,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:33,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:33,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:33,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:44:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:33,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:44:33,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:33,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:44:33,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:44:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:44:33,666 INFO L87 Difference]: Start difference. First operand 42222 states and 80791 transitions. Second operand 6 states. [2019-09-10 02:44:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:34,629 INFO L93 Difference]: Finished difference Result 42342 states and 80353 transitions. [2019-09-10 02:44:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:44:34,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-09-10 02:44:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:34,772 INFO L225 Difference]: With dead ends: 42342 [2019-09-10 02:44:34,773 INFO L226 Difference]: Without dead ends: 42342 [2019-09-10 02:44:34,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42342 states. [2019-09-10 02:44:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42342 to 42342. [2019-09-10 02:44:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42342 states. [2019-09-10 02:44:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42342 states to 42342 states and 80353 transitions. [2019-09-10 02:44:36,121 INFO L78 Accepts]: Start accepts. Automaton has 42342 states and 80353 transitions. Word has length 264 [2019-09-10 02:44:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:36,122 INFO L475 AbstractCegarLoop]: Abstraction has 42342 states and 80353 transitions. [2019-09-10 02:44:36,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:44:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42342 states and 80353 transitions. [2019-09-10 02:44:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 02:44:36,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:36,320 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:36,320 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 858254355, now seen corresponding path program 1 times [2019-09-10 02:44:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:36,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:36,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:44:36,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:36,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 02:44:36,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:36,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:44:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:44:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:44:36,748 INFO L87 Difference]: Start difference. First operand 42342 states and 80353 transitions. Second operand 22 states. [2019-09-10 02:44:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:58,338 INFO L93 Difference]: Finished difference Result 95995 states and 179677 transitions. [2019-09-10 02:44:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:44:58,338 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 265 [2019-09-10 02:44:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:00,594 INFO L225 Difference]: With dead ends: 95995 [2019-09-10 02:45:00,595 INFO L226 Difference]: Without dead ends: 95995 [2019-09-10 02:45:00,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:45:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95995 states. [2019-09-10 02:45:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95995 to 94284. [2019-09-10 02:45:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94284 states. [2019-09-10 02:45:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94284 states to 94284 states and 176562 transitions. [2019-09-10 02:45:03,119 INFO L78 Accepts]: Start accepts. Automaton has 94284 states and 176562 transitions. Word has length 265 [2019-09-10 02:45:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:03,120 INFO L475 AbstractCegarLoop]: Abstraction has 94284 states and 176562 transitions. [2019-09-10 02:45:03,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:45:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 94284 states and 176562 transitions. [2019-09-10 02:45:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 02:45:03,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:03,335 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:03,335 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2036117031, now seen corresponding path program 1 times [2019-09-10 02:45:03,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:03,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:03,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:03,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:03,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:03,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:03,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:03,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:03,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:03,533 INFO L87 Difference]: Start difference. First operand 94284 states and 176562 transitions. Second operand 6 states. [2019-09-10 02:45:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:04,643 INFO L93 Difference]: Finished difference Result 94030 states and 157041 transitions. [2019-09-10 02:45:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:45:04,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-09-10 02:45:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:04,951 INFO L225 Difference]: With dead ends: 94030 [2019-09-10 02:45:04,951 INFO L226 Difference]: Without dead ends: 94030 [2019-09-10 02:45:04,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94030 states. [2019-09-10 02:45:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94030 to 94028. [2019-09-10 02:45:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94028 states. [2019-09-10 02:45:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94028 states to 94028 states and 157039 transitions. [2019-09-10 02:45:07,652 INFO L78 Accepts]: Start accepts. Automaton has 94028 states and 157039 transitions. Word has length 264 [2019-09-10 02:45:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:07,652 INFO L475 AbstractCegarLoop]: Abstraction has 94028 states and 157039 transitions. [2019-09-10 02:45:07,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 94028 states and 157039 transitions. [2019-09-10 02:45:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 02:45:07,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:07,828 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:07,829 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 314108724, now seen corresponding path program 1 times [2019-09-10 02:45:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:08,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:45:08,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:08,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:45:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:45:08,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:45:08,140 INFO L87 Difference]: Start difference. First operand 94028 states and 157039 transitions. Second operand 18 states. [2019-09-10 02:45:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:27,093 INFO L93 Difference]: Finished difference Result 98081 states and 164094 transitions. [2019-09-10 02:45:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:45:27,094 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 248 [2019-09-10 02:45:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:27,517 INFO L225 Difference]: With dead ends: 98081 [2019-09-10 02:45:27,517 INFO L226 Difference]: Without dead ends: 98081 [2019-09-10 02:45:27,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:45:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98081 states. [2019-09-10 02:45:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98081 to 96352. [2019-09-10 02:45:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96352 states. [2019-09-10 02:45:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96352 states to 96352 states and 161205 transitions. [2019-09-10 02:45:29,958 INFO L78 Accepts]: Start accepts. Automaton has 96352 states and 161205 transitions. Word has length 248 [2019-09-10 02:45:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:29,958 INFO L475 AbstractCegarLoop]: Abstraction has 96352 states and 161205 transitions. [2019-09-10 02:45:29,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:45:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 96352 states and 161205 transitions. [2019-09-10 02:45:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 02:45:30,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:30,148 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:30,149 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -306981794, now seen corresponding path program 1 times [2019-09-10 02:45:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:30,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:45:30,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:30,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:30,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:30,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:30,334 INFO L87 Difference]: Start difference. First operand 96352 states and 161205 transitions. Second operand 5 states. [2019-09-10 02:45:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:30,820 INFO L93 Difference]: Finished difference Result 82961 states and 141843 transitions. [2019-09-10 02:45:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:30,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 267 [2019-09-10 02:45:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:31,079 INFO L225 Difference]: With dead ends: 82961 [2019-09-10 02:45:31,080 INFO L226 Difference]: Without dead ends: 81002 [2019-09-10 02:45:31,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81002 states. [2019-09-10 02:45:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81002 to 80623. [2019-09-10 02:45:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80623 states. [2019-09-10 02:45:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80623 states to 80623 states and 138405 transitions. [2019-09-10 02:45:33,657 INFO L78 Accepts]: Start accepts. Automaton has 80623 states and 138405 transitions. Word has length 267 [2019-09-10 02:45:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:33,658 INFO L475 AbstractCegarLoop]: Abstraction has 80623 states and 138405 transitions. [2019-09-10 02:45:33,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 80623 states and 138405 transitions. [2019-09-10 02:45:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 02:45:33,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:33,821 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:33,821 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1619222820, now seen corresponding path program 1 times [2019-09-10 02:45:33,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:33,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:33,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:33,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:33,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:45:34,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:34,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 02:45:34,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:34,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:45:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:45:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:45:34,106 INFO L87 Difference]: Start difference. First operand 80623 states and 138405 transitions. Second operand 16 states. [2019-09-10 02:45:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:34,789 INFO L93 Difference]: Finished difference Result 80439 states and 137809 transitions. [2019-09-10 02:45:34,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:45:34,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 266 [2019-09-10 02:45:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:35,133 INFO L225 Difference]: With dead ends: 80439 [2019-09-10 02:45:35,133 INFO L226 Difference]: Without dead ends: 79989 [2019-09-10 02:45:35,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:45:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79989 states. [2019-09-10 02:45:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79989 to 76548. [2019-09-10 02:45:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76548 states. [2019-09-10 02:45:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76548 states to 76548 states and 132504 transitions. [2019-09-10 02:45:37,464 INFO L78 Accepts]: Start accepts. Automaton has 76548 states and 132504 transitions. Word has length 266 [2019-09-10 02:45:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:37,464 INFO L475 AbstractCegarLoop]: Abstraction has 76548 states and 132504 transitions. [2019-09-10 02:45:37,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:45:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 76548 states and 132504 transitions. [2019-09-10 02:45:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 02:45:37,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:37,634 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:37,634 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1875992005, now seen corresponding path program 1 times [2019-09-10 02:45:37,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:37,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:45:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:37,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:37,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:37,813 INFO L87 Difference]: Start difference. First operand 76548 states and 132504 transitions. Second operand 5 states. [2019-09-10 02:45:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:38,239 INFO L93 Difference]: Finished difference Result 76838 states and 132685 transitions. [2019-09-10 02:45:38,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:38,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2019-09-10 02:45:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:38,473 INFO L225 Difference]: With dead ends: 76838 [2019-09-10 02:45:38,474 INFO L226 Difference]: Without dead ends: 75898 [2019-09-10 02:45:38,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75898 states. [2019-09-10 02:45:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75898 to 75551. [2019-09-10 02:45:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75551 states. [2019-09-10 02:45:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75551 states to 75551 states and 130842 transitions. [2019-09-10 02:45:40,712 INFO L78 Accepts]: Start accepts. Automaton has 75551 states and 130842 transitions. Word has length 266 [2019-09-10 02:45:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:40,713 INFO L475 AbstractCegarLoop]: Abstraction has 75551 states and 130842 transitions. [2019-09-10 02:45:40,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75551 states and 130842 transitions. [2019-09-10 02:45:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:45:40,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:40,892 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:40,892 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1818417830, now seen corresponding path program 1 times [2019-09-10 02:45:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:40,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:41,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:41,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:45:41,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:41,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:45:41,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:45:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:45:41,192 INFO L87 Difference]: Start difference. First operand 75551 states and 130842 transitions. Second operand 18 states. [2019-09-10 02:45:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:55,724 INFO L93 Difference]: Finished difference Result 76695 states and 132572 transitions. [2019-09-10 02:45:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:45:55,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 249 [2019-09-10 02:45:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:55,999 INFO L225 Difference]: With dead ends: 76695 [2019-09-10 02:45:55,999 INFO L226 Difference]: Without dead ends: 76695 [2019-09-10 02:45:56,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:45:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76695 states. [2019-09-10 02:45:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76695 to 75562. [2019-09-10 02:45:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75562 states. [2019-09-10 02:45:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75562 states to 75562 states and 130857 transitions. [2019-09-10 02:45:59,827 INFO L78 Accepts]: Start accepts. Automaton has 75562 states and 130857 transitions. Word has length 249 [2019-09-10 02:45:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:59,827 INFO L475 AbstractCegarLoop]: Abstraction has 75562 states and 130857 transitions. [2019-09-10 02:45:59,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:45:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 75562 states and 130857 transitions. [2019-09-10 02:46:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:46:00,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:00,076 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,077 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:00,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1409593605, now seen corresponding path program 1 times [2019-09-10 02:46:00,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:00,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:00,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:00,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:46:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:00,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:46:00,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:00,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:46:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:46:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:46:00,268 INFO L87 Difference]: Start difference. First operand 75562 states and 130857 transitions. Second operand 6 states. [2019-09-10 02:46:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:01,146 INFO L93 Difference]: Finished difference Result 75742 states and 130638 transitions. [2019-09-10 02:46:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:46:01,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 02:46:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:01,383 INFO L225 Difference]: With dead ends: 75742 [2019-09-10 02:46:01,384 INFO L226 Difference]: Without dead ends: 75742 [2019-09-10 02:46:01,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75742 states. [2019-09-10 02:46:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75742 to 75632. [2019-09-10 02:46:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75632 states. [2019-09-10 02:46:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75632 states to 75632 states and 130501 transitions. [2019-09-10 02:46:03,555 INFO L78 Accepts]: Start accepts. Automaton has 75632 states and 130501 transitions. Word has length 249 [2019-09-10 02:46:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:03,556 INFO L475 AbstractCegarLoop]: Abstraction has 75632 states and 130501 transitions. [2019-09-10 02:46:03,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:46:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 75632 states and 130501 transitions. [2019-09-10 02:46:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 02:46:03,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:03,720 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:03,720 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2002066438, now seen corresponding path program 1 times [2019-09-10 02:46:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:03,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:03,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:46:03,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:03,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:46:03,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:03,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:46:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:46:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:46:03,900 INFO L87 Difference]: Start difference. First operand 75632 states and 130501 transitions. Second operand 6 states. [2019-09-10 02:46:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:04,776 INFO L93 Difference]: Finished difference Result 75632 states and 125407 transitions. [2019-09-10 02:46:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:46:04,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 270 [2019-09-10 02:46:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:05,009 INFO L225 Difference]: With dead ends: 75632 [2019-09-10 02:46:05,009 INFO L226 Difference]: Without dead ends: 75632 [2019-09-10 02:46:05,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75632 states. [2019-09-10 02:46:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75632 to 75632. [2019-09-10 02:46:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75632 states. [2019-09-10 02:46:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75632 states to 75632 states and 125407 transitions. [2019-09-10 02:46:08,916 INFO L78 Accepts]: Start accepts. Automaton has 75632 states and 125407 transitions. Word has length 270 [2019-09-10 02:46:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:08,916 INFO L475 AbstractCegarLoop]: Abstraction has 75632 states and 125407 transitions. [2019-09-10 02:46:08,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:46:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 75632 states and 125407 transitions. [2019-09-10 02:46:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-10 02:46:09,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:09,085 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,085 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash 634262548, now seen corresponding path program 1 times [2019-09-10 02:46:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:09,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:09,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:46:09,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:09,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:46:09,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:09,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:46:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:46:09,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:46:09,261 INFO L87 Difference]: Start difference. First operand 75632 states and 125407 transitions. Second operand 6 states. [2019-09-10 02:46:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:10,133 INFO L93 Difference]: Finished difference Result 75728 states and 125455 transitions. [2019-09-10 02:46:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:46:10,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2019-09-10 02:46:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:10,391 INFO L225 Difference]: With dead ends: 75728 [2019-09-10 02:46:10,391 INFO L226 Difference]: Without dead ends: 75632 [2019-09-10 02:46:10,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:46:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75632 states. [2019-09-10 02:46:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75632 to 75632. [2019-09-10 02:46:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75632 states. [2019-09-10 02:46:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75632 states to 75632 states and 125359 transitions. [2019-09-10 02:46:12,607 INFO L78 Accepts]: Start accepts. Automaton has 75632 states and 125359 transitions. Word has length 272 [2019-09-10 02:46:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:12,607 INFO L475 AbstractCegarLoop]: Abstraction has 75632 states and 125359 transitions. [2019-09-10 02:46:12,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:46:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75632 states and 125359 transitions. [2019-09-10 02:46:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-10 02:46:12,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:12,763 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,763 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -345236665, now seen corresponding path program 1 times [2019-09-10 02:46:12,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:12,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-10 02:46:12,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:46:12,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:46:12,931 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2019-09-10 02:46:12,934 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [130], [146], [149], [158], [159], [162], [163], [164], [166], [262], [265], [271], [276], [278], [282], [285], [286], [287], [290], [296], [332], [334], [336], [339], [360], [363], [372], [383], [385], [386], [389], [399], [402], [404], [407], [409], [411], [467], [470], [479], [584], [587], [597], [648], [650], [653], [655], [657], [658], [659], [661], [662], [663], [681], [684], [698], [701], [704], [718], [757], [759], [761], [764], [765], [766], [770], [773], [775], [776], [778], [781], [785], [799], [803], [806], [824], [827], [865], [898], [899], [908], [912], [914], [916], [919], [922], [924], [926], [933], [940], [947], [950], [952], [1110], [1113], [1116], [1147], [1148], [1151], [1154], [1198], [1199], [1202], [1205], [1208], [1252], [1271], [1275], [1286], [1289], [1290], [1293], [1296], [1327], [1328], [1330], [1413], [1416], [1422], [1443], [1446], [1448], [1451], [1460], [1466], [1469], [1478], [1494], [1497], [1500], [1531], [1545], [1548], [1550], [1552], [1554], [1559], [1569], [1571], [1572], [1692], [1694], [1696], [1698], [1699], [1735], [1745], [1746], [1747], [1748], [1749], [1750], [1753], [1754], [1755], [1756], [1757], [1759], [1760], [1761], [1762], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1783], [1795], [1796], [1797], [1798], [1799], [1800], [1831], [1832], [1833], [1834], [1835], [1836], [1837], [1838], [1839], [1840], [1841], [1842], [1857], [1858], [1859], [1860], [1861], [1863], [1864], [1869], [1870], [1871], [1872], [1873], [1874], [1875], [1876], [1877], [1879], [1880], [1881], [1882], [1903], [1919], [1920], [1921], [1922], [1925], [1926], [1941], [1943], [1944], [1945], [1947], [1948], [1949], [1950], [1951], [1952], [1953], [1959], [1960], [1961], [1962], [1963], [1964], [1965], [1969], [1970], [1975], [1976], [1977], [1978], [1979], [1980], [1981], [1982], [1983] [2019-09-10 02:46:13,010 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:46:13,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:46:13,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:46:13,147 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 0. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 390 variables. [2019-09-10 02:46:13,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:13,153 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:46:13,264 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:46:13,265 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:46:13,276 INFO L420 sIntCurrentIteration]: We unified 274 AI predicates to 274 [2019-09-10 02:46:13,277 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:46:13,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:46:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-10 02:46:13,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:13,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:46:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:46:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:46:13,282 INFO L87 Difference]: Start difference. First operand 75632 states and 125359 transitions. Second operand 2 states. [2019-09-10 02:46:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:13,284 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:46:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:46:13,284 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 275 [2019-09-10 02:46:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:13,284 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:46:13,285 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:46:13,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 274 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:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:46:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:46:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:46:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:46:13,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2019-09-10 02:46:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:13,287 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:46:13,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:46:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:46:13,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:46:13,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:46:13 BoogieIcfgContainer [2019-09-10 02:46:13,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:46:13,298 INFO L168 Benchmark]: Toolchain (without parser) took 148404.58 ms. Allocated memory was 133.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 87.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-09-10 02:46:13,299 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 108.3 MB in the beginning and 108.1 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:13,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1113.98 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 87.0 MB in the beginning and 126.3 MB in the end (delta: -39.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:13,307 INFO L168 Benchmark]: Boogie Preprocessor took 263.27 ms. Allocated memory is still 201.9 MB. Free memory was 126.3 MB in the beginning and 117.0 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:13,310 INFO L168 Benchmark]: RCFGBuilder took 2523.32 ms. Allocated memory was 201.9 MB in the beginning and 262.1 MB in the end (delta: 60.3 MB). Free memory was 117.0 MB in the beginning and 140.1 MB in the end (delta: -23.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:46:13,312 INFO L168 Benchmark]: TraceAbstraction took 144493.12 ms. Allocated memory was 262.1 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 138.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-09-10 02:46:13,323 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 108.3 MB in the beginning and 108.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1113.98 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 87.0 MB in the beginning and 126.3 MB in the end (delta: -39.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 263.27 ms. Allocated memory is still 201.9 MB. Free memory was 126.3 MB in the beginning and 117.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2523.32 ms. Allocated memory was 201.9 MB in the beginning and 262.1 MB in the end (delta: 60.3 MB). Free memory was 117.0 MB in the beginning and 140.1 MB in the end (delta: -23.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144493.12 ms. Allocated memory was 262.1 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 138.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 61]: 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 119 procedures, 820 locations, 1 error locations. SAFE Result, 144.3s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 95.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23849 SDtfs, 23243 SDslu, 87035 SDs, 0 SdLazy, 76695 SolverSat, 7623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3041 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96352occurred in iteration=20, 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.9635036496350364 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 38.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 35194 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 6745 NumberOfCodeBlocks, 6745 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6717 ConstructedInterpolants, 0 QuantifiedInterpolants, 2126196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 27 PerfectInterpolantSequences, 1254/1260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...