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_spec11_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:50:34,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:50:34,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:50:34,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:50:34,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:50:34,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:50:34,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:50:34,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:50:34,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:50:34,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:50:34,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:50:34,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:50:34,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:50:34,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:50:34,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:50:34,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:50:34,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:50:34,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:50:34,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:50:34,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:50:34,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:50:34,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:50:34,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:50:34,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:50:34,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:50:34,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:50:34,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:50:34,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:50:34,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:50:34,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:50:34,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:50:34,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:50:34,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:50:34,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:50:34,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:50:34,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:50:34,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:50:34,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:50:34,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:50:34,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:50:34,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:50:34,977 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-10-03 02:50:34,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:50:34,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:50:34,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:50:34,993 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:50:34,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:50:34,994 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:50:34,994 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:50:34,995 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:50:34,995 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:50:34,995 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:50:34,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:50:34,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:50:34,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:50:34,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:50:34,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:50:34,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:50:34,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:50:34,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:50:34,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:50:34,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:50:35,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:50:35,000 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:50:35,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:50:35,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:35,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:50:35,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:50:35,001 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:50:35,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:50:35,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:50:35,002 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:50:35,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:50:35,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:50:35,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:50:35,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:50:35,073 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:50:35,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product30.cil.c [2019-10-03 02:50:35,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b00ba931/020ce42d0d9949cc9188cfd22c5c5124/FLAG62f94a2f6 [2019-10-03 02:50:35,781 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:50:35,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product30.cil.c [2019-10-03 02:50:35,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b00ba931/020ce42d0d9949cc9188cfd22c5c5124/FLAG62f94a2f6 [2019-10-03 02:50:35,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b00ba931/020ce42d0d9949cc9188cfd22c5c5124 [2019-10-03 02:50:35,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:50:35,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:50:35,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:35,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:50:35,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:50:35,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:35" (1/1) ... [2019-10-03 02:50:35,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff2738f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:35, skipping insertion in model container [2019-10-03 02:50:35,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:35" (1/1) ... [2019-10-03 02:50:35,940 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:50:36,026 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:50:36,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:36,775 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:50:36,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:37,015 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:50:37,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37 WrapperNode [2019-10-03 02:50:37,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:37,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:50:37,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:50:37,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:50:37,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... [2019-10-03 02:50:37,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:50:37,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:50:37,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:50:37,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:50:37,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:37,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:50:37,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:50:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:50:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:50:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:50:37,294 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:50:37,295 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:50:37,296 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:50:37,296 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:50:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:50:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:50:37,298 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:50:37,299 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:50:37,299 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:50:37,299 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:50:37,299 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:50:37,299 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:50:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:50:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:50:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:50:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:50:37,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:50:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:50:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:50:37,302 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:50:37,303 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:50:37,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:50:37,303 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:50:37,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:50:37,303 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:50:37,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:50:37,304 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:50:37,304 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:50:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:50:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:50:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:50:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:50:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:50:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:50:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:50:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:50:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:50:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:50:37,308 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-03 02:50:37,308 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-03 02:50:37,308 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:50:37,309 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:50:37,309 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:50:37,309 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:50:37,309 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:50:37,309 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:50:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:50:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:50:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:50:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:50:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:50:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:50:37,311 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:37,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:50:37,312 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:50:37,312 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:50:37,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:50:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:50:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:50:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:50:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:50:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:50:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:50:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:50:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:50:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:50:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:50:37,316 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:50:37,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:50:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:50:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:50:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:50:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:50:37,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:50:37,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:50:37,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:50:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:50:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:50:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:50:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:50:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:50:37,320 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:50:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:50:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:50:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:50:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:50:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:50:37,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:50:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:50:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:50:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:50:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:50:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:50:37,322 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:50:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:50:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:50:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:50:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:50:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:50:37,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:50:37,324 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:50:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:50:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:50:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:50:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:50:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:50:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:50:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:50:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:50:37,327 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:50:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:50:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:50:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:50:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:50:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:50:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:50:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:50:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:50:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:50:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:50:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:50:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:50:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:50:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:50:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:50:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:50:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:50:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:50:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:50:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:50:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:50:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:50:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:50:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:50:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:50:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:50:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:50:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:50:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:50:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:50:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:50:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:50:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:50:37,348 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:50:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:50:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:50:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:50:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:50:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:50:37,350 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:50:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:50:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:50:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:50:37,351 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:50:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:50:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:50:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:50:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:50:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-03 02:50:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-03 02:50:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:50:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:50:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:50:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:50:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:50:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:50:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:50:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:50:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:50:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:50:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:50:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:50:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:50:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:50:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:50:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:50:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:50:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:50:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:50:37,356 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:50:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:50:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:50:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:50:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:50:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:50:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:50:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:50:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:50:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:50:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:50:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:50:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:50:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:50:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:50:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:50:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:50:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:50:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:50:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:50:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:50:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:50:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:50:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:50:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:50:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:50:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:50:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:50:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:50:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:50:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:50:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:50:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:39,654 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:39,654 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:39,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:39 BoogieIcfgContainer [2019-10-03 02:50:39,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:39,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:39,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:39,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:39,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:50:35" (1/3) ... [2019-10-03 02:50:39,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2c345c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:39, skipping insertion in model container [2019-10-03 02:50:39,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:37" (2/3) ... [2019-10-03 02:50:39,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2c345c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:39, skipping insertion in model container [2019-10-03 02:50:39,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:39" (3/3) ... [2019-10-03 02:50:39,666 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product30.cil.c [2019-10-03 02:50:39,677 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:39,694 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:39,711 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:39,745 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:39,745 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:39,745 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:39,745 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:39,748 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:39,752 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:39,752 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:39,753 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states. [2019-10-03 02:50:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-03 02:50:39,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:39,839 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:39,843 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash 235603723, now seen corresponding path program 1 times [2019-10-03 02:50:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:40,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:40,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:40,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:40,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:40,631 INFO L87 Difference]: Start difference. First operand 541 states. Second operand 2 states. [2019-10-03 02:50:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:40,700 INFO L93 Difference]: Finished difference Result 499 states and 661 transitions. [2019-10-03 02:50:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:40,702 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 216 [2019-10-03 02:50:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:40,738 INFO L225 Difference]: With dead ends: 499 [2019-10-03 02:50:40,738 INFO L226 Difference]: Without dead ends: 490 [2019-10-03 02:50:40,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-03 02:50:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-10-03 02:50:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-03 02:50:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 650 transitions. [2019-10-03 02:50:40,844 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 650 transitions. Word has length 216 [2019-10-03 02:50:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:40,846 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 650 transitions. [2019-10-03 02:50:40,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 650 transitions. [2019-10-03 02:50:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-03 02:50:40,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:40,853 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:40,853 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1056183382, now seen corresponding path program 1 times [2019-10-03 02:50:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:40,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:40,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:41,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:41,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:41,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:41,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:41,208 INFO L87 Difference]: Start difference. First operand 490 states and 650 transitions. Second operand 3 states. [2019-10-03 02:50:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:41,294 INFO L93 Difference]: Finished difference Result 493 states and 653 transitions. [2019-10-03 02:50:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:41,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-03 02:50:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:41,302 INFO L225 Difference]: With dead ends: 493 [2019-10-03 02:50:41,303 INFO L226 Difference]: Without dead ends: 493 [2019-10-03 02:50:41,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-03 02:50:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2019-10-03 02:50:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-03 02:50:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 652 transitions. [2019-10-03 02:50:41,422 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 652 transitions. Word has length 217 [2019-10-03 02:50:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:41,424 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 652 transitions. [2019-10-03 02:50:41,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 652 transitions. [2019-10-03 02:50:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:50:41,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:41,440 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:41,440 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1277940166, now seen corresponding path program 1 times [2019-10-03 02:50:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:41,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:41,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:41,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:41,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:41,769 INFO L87 Difference]: Start difference. First operand 492 states and 652 transitions. Second operand 3 states. [2019-10-03 02:50:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:41,801 INFO L93 Difference]: Finished difference Result 533 states and 722 transitions. [2019-10-03 02:50:41,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:41,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-03 02:50:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:41,809 INFO L225 Difference]: With dead ends: 533 [2019-10-03 02:50:41,809 INFO L226 Difference]: Without dead ends: 533 [2019-10-03 02:50:41,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-03 02:50:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 532. [2019-10-03 02:50:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-03 02:50:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 721 transitions. [2019-10-03 02:50:41,842 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 721 transitions. Word has length 227 [2019-10-03 02:50:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:41,843 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 721 transitions. [2019-10-03 02:50:41,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 721 transitions. [2019-10-03 02:50:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-03 02:50:41,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:41,850 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:41,850 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -569425411, now seen corresponding path program 1 times [2019-10-03 02:50:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:41,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:42,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:42,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,046 INFO L87 Difference]: Start difference. First operand 532 states and 721 transitions. Second operand 3 states. [2019-10-03 02:50:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,071 INFO L93 Difference]: Finished difference Result 610 states and 854 transitions. [2019-10-03 02:50:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:42,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-10-03 02:50:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,079 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:50:42,079 INFO L226 Difference]: Without dead ends: 610 [2019-10-03 02:50:42,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-03 02:50:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 609. [2019-10-03 02:50:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-10-03 02:50:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 853 transitions. [2019-10-03 02:50:42,145 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 853 transitions. Word has length 228 [2019-10-03 02:50:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,146 INFO L475 AbstractCegarLoop]: Abstraction has 609 states and 853 transitions. [2019-10-03 02:50:42,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 853 transitions. [2019-10-03 02:50:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-03 02:50:42,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,154 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:42,154 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1991839302, now seen corresponding path program 1 times [2019-10-03 02:50:42,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:42,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,339 INFO L87 Difference]: Start difference. First operand 609 states and 853 transitions. Second operand 3 states. [2019-10-03 02:50:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,365 INFO L93 Difference]: Finished difference Result 758 states and 1106 transitions. [2019-10-03 02:50:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:42,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-10-03 02:50:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,372 INFO L225 Difference]: With dead ends: 758 [2019-10-03 02:50:42,372 INFO L226 Difference]: Without dead ends: 758 [2019-10-03 02:50:42,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-03 02:50:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 757. [2019-10-03 02:50:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-10-03 02:50:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1105 transitions. [2019-10-03 02:50:42,403 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1105 transitions. Word has length 229 [2019-10-03 02:50:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,404 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 1105 transitions. [2019-10-03 02:50:42,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1105 transitions. [2019-10-03 02:50:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-03 02:50:42,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,411 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 02:50:42,411 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1885576835, now seen corresponding path program 1 times [2019-10-03 02:50:42,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:42,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:42,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:42,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,706 INFO L87 Difference]: Start difference. First operand 757 states and 1105 transitions. Second operand 3 states. [2019-10-03 02:50:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,731 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2019-10-03 02:50:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:42,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-03 02:50:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,743 INFO L225 Difference]: With dead ends: 1042 [2019-10-03 02:50:42,743 INFO L226 Difference]: Without dead ends: 1042 [2019-10-03 02:50:42,744 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-10-03 02:50:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1041. [2019-10-03 02:50:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-10-03 02:50:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1585 transitions. [2019-10-03 02:50:42,789 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1585 transitions. Word has length 230 [2019-10-03 02:50:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:42,791 INFO L475 AbstractCegarLoop]: Abstraction has 1041 states and 1585 transitions. [2019-10-03 02:50:42,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1585 transitions. [2019-10-03 02:50:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:50:42,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:42,802 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 02:50:42,802 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 752063174, now seen corresponding path program 1 times [2019-10-03 02:50:42,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:42,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:42,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 02:50:43,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:43,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:43,014 INFO L87 Difference]: Start difference. First operand 1041 states and 1585 transitions. Second operand 3 states. [2019-10-03 02:50:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:43,051 INFO L93 Difference]: Finished difference Result 1586 states and 2498 transitions. [2019-10-03 02:50:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:43,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-03 02:50:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:43,064 INFO L225 Difference]: With dead ends: 1586 [2019-10-03 02:50:43,065 INFO L226 Difference]: Without dead ends: 1586 [2019-10-03 02:50:43,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-10-03 02:50:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1585. [2019-10-03 02:50:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2019-10-03 02:50:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2497 transitions. [2019-10-03 02:50:43,127 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2497 transitions. Word has length 231 [2019-10-03 02:50:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:43,128 INFO L475 AbstractCegarLoop]: Abstraction has 1585 states and 2497 transitions. [2019-10-03 02:50:43,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2497 transitions. [2019-10-03 02:50:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 02:50:43,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:43,142 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 02:50:43,142 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1473001190, now seen corresponding path program 1 times [2019-10-03 02:50:43,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:50:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:50:43,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:50:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:50:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:43,690 INFO L87 Difference]: Start difference. First operand 1585 states and 2497 transitions. Second operand 19 states. [2019-10-03 02:50:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:48,532 INFO L93 Difference]: Finished difference Result 3693 states and 5826 transitions. [2019-10-03 02:50:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:50:48,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 233 [2019-10-03 02:50:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:48,558 INFO L225 Difference]: With dead ends: 3693 [2019-10-03 02:50:48,559 INFO L226 Difference]: Without dead ends: 3693 [2019-10-03 02:50:48,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:50:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2019-10-03 02:50:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 3656. [2019-10-03 02:50:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3656 states. [2019-10-03 02:50:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5775 transitions. [2019-10-03 02:50:48,714 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5775 transitions. Word has length 233 [2019-10-03 02:50:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:48,715 INFO L475 AbstractCegarLoop]: Abstraction has 3656 states and 5775 transitions. [2019-10-03 02:50:48,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:50:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5775 transitions. [2019-10-03 02:50:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:50:48,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:48,736 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 02:50:48,737 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1846424479, now seen corresponding path program 1 times [2019-10-03 02:50:48,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:48,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:50:49,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:49,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:49,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:49,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:49,084 INFO L87 Difference]: Start difference. First operand 3656 states and 5775 transitions. Second operand 15 states. [2019-10-03 02:50:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:52,712 INFO L93 Difference]: Finished difference Result 3758 states and 5925 transitions. [2019-10-03 02:50:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:50:52,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 234 [2019-10-03 02:50:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:52,754 INFO L225 Difference]: With dead ends: 3758 [2019-10-03 02:50:52,754 INFO L226 Difference]: Without dead ends: 3758 [2019-10-03 02:50:52,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:50:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-10-03 02:50:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3726. [2019-10-03 02:50:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2019-10-03 02:50:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 5887 transitions. [2019-10-03 02:50:52,919 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 5887 transitions. Word has length 234 [2019-10-03 02:50:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:52,920 INFO L475 AbstractCegarLoop]: Abstraction has 3726 states and 5887 transitions. [2019-10-03 02:50:52,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 5887 transitions. [2019-10-03 02:50:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:50:52,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:52,938 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 02:50:52,938 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1741407830, now seen corresponding path program 1 times [2019-10-03 02:50:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:52,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:52,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:52,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-03 02:50:53,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:53,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:50:53,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:53,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:50:53,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:50:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:50:53,328 INFO L87 Difference]: Start difference. First operand 3726 states and 5887 transitions. Second operand 16 states. [2019-10-03 02:50:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:53,712 INFO L93 Difference]: Finished difference Result 3848 states and 6054 transitions. [2019-10-03 02:50:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:50:53,713 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 234 [2019-10-03 02:50:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:53,743 INFO L225 Difference]: With dead ends: 3848 [2019-10-03 02:50:53,743 INFO L226 Difference]: Without dead ends: 3798 [2019-10-03 02:50:53,744 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:50:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-10-03 02:50:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3767. [2019-10-03 02:50:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2019-10-03 02:50:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 5933 transitions. [2019-10-03 02:50:53,897 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 5933 transitions. Word has length 234 [2019-10-03 02:50:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:53,898 INFO L475 AbstractCegarLoop]: Abstraction has 3767 states and 5933 transitions. [2019-10-03 02:50:53,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:50:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 5933 transitions. [2019-10-03 02:50:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:50:53,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:53,916 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-03 02:50:53,916 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -306166866, now seen corresponding path program 1 times [2019-10-03 02:50:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:53,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:53,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:53,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:53,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-03 02:50:54,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:54,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:54,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:54,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:54,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:54,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:54,114 INFO L87 Difference]: Start difference. First operand 3767 states and 5933 transitions. Second operand 5 states. [2019-10-03 02:50:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:55,093 INFO L93 Difference]: Finished difference Result 6748 states and 10568 transitions. [2019-10-03 02:50:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:50:55,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-03 02:50:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:55,147 INFO L225 Difference]: With dead ends: 6748 [2019-10-03 02:50:55,147 INFO L226 Difference]: Without dead ends: 6748 [2019-10-03 02:50:55,149 INFO L640 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-10-03 02:50:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states. [2019-10-03 02:50:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 6717. [2019-10-03 02:50:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6717 states. [2019-10-03 02:50:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 10517 transitions. [2019-10-03 02:50:55,392 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 10517 transitions. Word has length 234 [2019-10-03 02:50:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:55,393 INFO L475 AbstractCegarLoop]: Abstraction has 6717 states and 10517 transitions. [2019-10-03 02:50:55,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 10517 transitions. [2019-10-03 02:50:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:50:55,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:55,484 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-03 02:50:55,484 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 632364749, now seen corresponding path program 1 times [2019-10-03 02:50:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:55,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:55,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:55,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:50:55,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:50:55,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:50:55,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2019-10-03 02:50:55,702 INFO L207 CegarAbsIntRunner]: [59], [62], [72], [117], [146], [149], [150], [151], [153], [263], [265], [269], [272], [273], [274], [277], [283], [305], [308], [311], [319], [321], [323], [330], [334], [336], [337], [340], [349], [360], [362], [365], [369], [370], [372], [373], [376], [386], [387], [388], [389], [391], [396], [433], [435], [447], [469], [471], [491], [660], [662], [663], [664], [700], [703], [717], [756], [758], [761], [762], [773], [775], [778], [782], [806], [810], [813], [821], [824], [835], [857], [859], [884], [890], [899], [903], [905], [907], [910], [917], [924], [927], [929], [1063], [1066], [1080], [1188], [1242], [1264], [1275], [1278], [1279], [1282], [1286], [1290], [1316], [1317], [1319], [1388], [1391], [1401], [1402], [1405], [1411], [1432], [1435], [1449], [1455], [1458], [1467], [1656], [1658], [1660], [1662], [1663], [1691], [1701], [1702], [1703], [1704], [1705], [1706], [1709], [1710], [1711], [1712], [1713], [1715], [1716], [1717], [1718], [1725], [1726], [1727], [1728], [1729], [1731], [1732], [1733], [1734], [1739], [1741], [1742], [1747], [1748], [1751], [1752], [1753], [1754], [1755], [1767], [1768], [1781], [1782], [1783], [1784], [1785], [1803], [1804], [1817], [1818], [1819], [1821], [1822], [1827], [1828], [1829], [1830], [1831], [1832], [1833], [1834], [1835], [1837], [1838], [1839], [1840], [1849], [1857], [1858], [1869], [1875], [1876], [1891], [1893], [1894], [1895], [1897], [1898], [1899], [1900], [1901], [1902], [1903], [1915], [1916], [1917], [1918], [1919], [1920], [1921], [1922], [1923] [2019-10-03 02:50:55,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:50:55,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:50:55,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:50:55,875 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 203 root evaluator evaluations with a maximum evaluation depth of 0. Performed 203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 372 variables. [2019-10-03 02:50:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:55,880 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:50:55,971 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:50:55,971 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:50:55,977 INFO L420 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2019-10-03 02:50:55,977 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:50:55,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:50:55,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-03 02:50:55,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:55,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:55,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:55,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:55,980 INFO L87 Difference]: Start difference. First operand 6717 states and 10517 transitions. Second operand 2 states. [2019-10-03 02:50:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:55,981 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:50:55,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:55,981 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 234 [2019-10-03 02:50:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:55,981 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:50:55,982 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:50:55,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:50:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:50:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:50:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:50:55,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2019-10-03 02:50:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:55,983 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:50:55,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:50:55,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:50:55,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:50:55 BoogieIcfgContainer [2019-10-03 02:50:55,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:50:55,991 INFO L168 Benchmark]: Toolchain (without parser) took 20069.65 ms. Allocated memory was 141.0 MB in the beginning and 658.5 MB in the end (delta: 517.5 MB). Free memory was 85.8 MB in the beginning and 436.5 MB in the end (delta: -350.7 MB). Peak memory consumption was 166.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:55,992 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:50:55,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1093.86 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 85.4 MB in the beginning and 133.5 MB in the end (delta: -48.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:55,994 INFO L168 Benchmark]: Boogie Preprocessor took 177.73 ms. Allocated memory is still 201.9 MB. Free memory was 133.5 MB in the beginning and 124.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:55,995 INFO L168 Benchmark]: RCFGBuilder took 2462.13 ms. Allocated memory was 201.9 MB in the beginning and 261.6 MB in the end (delta: 59.8 MB). Free memory was 124.5 MB in the beginning and 150.7 MB in the end (delta: -26.2 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:55,996 INFO L168 Benchmark]: TraceAbstraction took 16330.84 ms. Allocated memory was 261.6 MB in the beginning and 658.5 MB in the end (delta: 396.9 MB). Free memory was 150.7 MB in the beginning and 436.5 MB in the end (delta: -285.8 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:56,001 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1093.86 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 85.4 MB in the beginning and 133.5 MB in the end (delta: -48.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.73 ms. Allocated memory is still 201.9 MB. Free memory was 133.5 MB in the beginning and 124.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2462.13 ms. Allocated memory was 201.9 MB in the beginning and 261.6 MB in the end (delta: 59.8 MB). Free memory was 124.5 MB in the beginning and 150.7 MB in the end (delta: -26.2 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16330.84 ms. Allocated memory was 261.6 MB in the beginning and 658.5 MB in the end (delta: 396.9 MB). Free memory was 150.7 MB in the beginning and 436.5 MB in the end (delta: -285.8 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1555]: 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 115 procedures, 790 locations, 1 error locations. SAFE Result, 16.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8561 SDtfs, 4558 SDslu, 41226 SDs, 0 SdLazy, 6724 SolverSat, 898 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6717occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0643776824034337 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 137 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2747 NumberOfCodeBlocks, 2747 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2735 ConstructedInterpolants, 0 QuantifiedInterpolants, 782549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 566/572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...