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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec3_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:08:48,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:08:48,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:08:48,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:08:48,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:08:48,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:08:48,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:08:48,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:08:48,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:08:48,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:08:48,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:08:48,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:08:48,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:08:48,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:08:48,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:08:48,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:08:48,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:08:48,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:08:48,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:08:48,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:08:48,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:08:48,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:08:48,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:08:48,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:08:48,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:08:48,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:08:48,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:08:48,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:08:48,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:08:48,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:08:48,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:08:48,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:08:48,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:08:48,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:08:48,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:08:48,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:08:48,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:08:48,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:08:48,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:08:48,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:08:48,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:08:48,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:08:48,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:08:48,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:08:48,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:08:48,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:08:48,397 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:08:48,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:08:48,398 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:08:48,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:08:48,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:08:48,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:08:48,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:08:48,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:08:48,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:08:48,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:08:48,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:08:48,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:08:48,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:08:48,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:08:48,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:08:48,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:08:48,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:08:48,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:08:48,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:08:48,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:08:48,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:08:48,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:08:48,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:08:48,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:08:48,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:08:48,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:08:48,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:08:48,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:08:48,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:08:48,449 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:08:48,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product35.cil.c [2019-09-08 05:08:48,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286ae4f4/44f4d62b59804d5e9b3fb2c5d17f7ea4/FLAG2ae42762c [2019-09-08 05:08:49,160 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:08:49,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product35.cil.c [2019-09-08 05:08:49,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286ae4f4/44f4d62b59804d5e9b3fb2c5d17f7ea4/FLAG2ae42762c [2019-09-08 05:08:49,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1286ae4f4/44f4d62b59804d5e9b3fb2c5d17f7ea4 [2019-09-08 05:08:49,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:08:49,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:08:49,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:08:49,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:08:49,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:08:49,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:08:49" (1/1) ... [2019-09-08 05:08:49,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6e5bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:49, skipping insertion in model container [2019-09-08 05:08:49,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:08:49" (1/1) ... [2019-09-08 05:08:49,345 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:08:49,427 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:08:50,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:08:50,303 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:08:50,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:08:50,646 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:08:50,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50 WrapperNode [2019-09-08 05:08:50,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:08:50,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:08:50,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:08:50,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:08:50,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... [2019-09-08 05:08:50,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:08:50,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:08:50,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:08:50,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:08:50,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:08:50,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:08:50,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:08:50,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:08:50,921 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:08:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:08:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:08:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:08:50,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:08:50,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:08:50,923 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:08:50,923 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:08:50,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:08:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:08:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:08:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:08:50,924 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:08:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:08:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:08:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:08:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:08:50,925 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:08:50,926 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:08:50,926 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:08:50,926 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:08:50,927 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:08:50,927 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:08:50,927 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:08:50,927 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:08:50,928 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:08:50,928 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:08:50,928 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:08:50,928 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:08:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:08:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:08:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:08:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:08:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:08:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:08:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:08:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:08:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:08:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:08:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:08:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:08:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:08:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:08:50,932 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:08:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:08:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:08:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:08:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:08:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:08:50,933 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:08:50,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:08:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:08:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:08:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:08:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:08:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:08:50,935 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:08:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:08:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:08:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:08:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:08:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:08:50,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:08:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:08:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:08:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:08:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:08:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:08:50,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:08:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:08:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:08:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:08:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:08:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:08:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:08:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:08:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:08:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:08:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:08:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:08:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:08:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:08:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:08:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:08:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:08:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:08:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:08:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:08:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:08:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:08:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:08:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:08:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:08:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:08:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:08:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:08:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:08:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:08:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:08:50,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:08:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:08:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:08:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:08:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:08:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:08:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:08:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:08:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:08:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:08:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:08:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:08:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:08:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:08:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:08:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:08:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:08:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:08:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:08:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:08:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:08:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:08:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:08:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:08:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:08:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:08:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:08:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:08:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:08:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:08:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:08:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:08:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:08:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:08:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:08:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:08:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:08:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:08:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:08:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:08:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:08:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:08:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:08:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:08:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:08:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:08:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:08:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:08:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:08:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:08:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:08:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:08:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:08:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:08:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:08:50,957 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:08:50,957 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:08:50,957 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:08:50,957 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:08:50,958 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:08:50,958 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:08:50,958 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:08:50,958 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:08:50,959 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:08:50,959 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:08:50,959 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:08:50,959 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:08:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:08:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:08:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:08:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:08:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:08:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:08:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:08:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:08:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:08:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:08:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:08:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:08:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:08:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:08:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:08:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:08:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:08:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:08:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:08:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 05:08:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:08:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:08:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:08:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:08:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:08:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:08:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:08:50,964 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 05:08:50,965 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:08:50,965 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:08:50,965 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:08:50,965 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:08:50,965 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:08:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:08:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:08:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:08:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:08:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:08:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:08:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:08:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:08:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:08:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:08:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:08:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:08:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:08:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:08:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:08:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:08:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:08:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:08:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:08:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:08:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:08:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:08:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:08:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:08:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:08:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:08:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:08:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:08:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:08:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:08:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:08:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:08:50,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:08:53,407 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:08:53,408 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:08:53,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:08:53 BoogieIcfgContainer [2019-09-08 05:08:53,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:08:53,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:08:53,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:08:53,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:08:53,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:08:49" (1/3) ... [2019-09-08 05:08:53,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745e32f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:08:53, skipping insertion in model container [2019-09-08 05:08:53,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:08:50" (2/3) ... [2019-09-08 05:08:53,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745e32f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:08:53, skipping insertion in model container [2019-09-08 05:08:53,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:08:53" (3/3) ... [2019-09-08 05:08:53,424 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product35.cil.c [2019-09-08 05:08:53,444 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:08:53,458 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:08:53,479 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:08:53,536 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:08:53,537 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:08:53,537 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:08:53,537 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:08:53,537 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:08:53,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:08:53,537 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:08:53,537 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:08:53,538 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:08:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states. [2019-09-08 05:08:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:08:53,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:53,622 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:53,630 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash -743915879, now seen corresponding path program 1 times [2019-09-08 05:08:53,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:53,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:53,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:53,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:53,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:08:54,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:54,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:08:54,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:08:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:08:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:08:54,427 INFO L87 Difference]: Start difference. First operand 695 states. Second operand 2 states. [2019-09-08 05:08:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:54,524 INFO L93 Difference]: Finished difference Result 1065 states and 1438 transitions. [2019-09-08 05:08:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:08:54,525 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 204 [2019-09-08 05:08:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:54,553 INFO L225 Difference]: With dead ends: 1065 [2019-09-08 05:08:54,553 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 05:08:54,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:08:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 05:08:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-08 05:08:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 05:08:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 902 transitions. [2019-09-08 05:08:54,684 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 902 transitions. Word has length 204 [2019-09-08 05:08:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:54,688 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 902 transitions. [2019-09-08 05:08:54,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:08:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 902 transitions. [2019-09-08 05:08:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 05:08:54,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:54,700 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:54,701 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash 880668841, now seen corresponding path program 1 times [2019-09-08 05:08:54,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:54,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:08:54,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:54,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:55,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,028 INFO L87 Difference]: Start difference. First operand 666 states and 902 transitions. Second operand 3 states. [2019-09-08 05:08:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:55,102 INFO L93 Difference]: Finished difference Result 1048 states and 1398 transitions. [2019-09-08 05:08:55,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:55,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 05:08:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:55,118 INFO L225 Difference]: With dead ends: 1048 [2019-09-08 05:08:55,118 INFO L226 Difference]: Without dead ends: 669 [2019-09-08 05:08:55,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-09-08 05:08:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2019-09-08 05:08:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 05:08:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 904 transitions. [2019-09-08 05:08:55,168 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 904 transitions. Word has length 205 [2019-09-08 05:08:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:55,168 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 904 transitions. [2019-09-08 05:08:55,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 904 transitions. [2019-09-08 05:08:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 05:08:55,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:55,174 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:55,174 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash -293016614, now seen corresponding path program 1 times [2019-09-08 05:08:55,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:55,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:08:55,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:55,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:55,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,359 INFO L87 Difference]: Start difference. First operand 668 states and 904 transitions. Second operand 3 states. [2019-09-08 05:08:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:55,403 INFO L93 Difference]: Finished difference Result 1316 states and 1812 transitions. [2019-09-08 05:08:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:55,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 05:08:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:55,409 INFO L225 Difference]: With dead ends: 1316 [2019-09-08 05:08:55,409 INFO L226 Difference]: Without dead ends: 713 [2019-09-08 05:08:55,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-09-08 05:08:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2019-09-08 05:08:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-08 05:08:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 979 transitions. [2019-09-08 05:08:55,447 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 979 transitions. Word has length 217 [2019-09-08 05:08:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:55,447 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 979 transitions. [2019-09-08 05:08:55,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 979 transitions. [2019-09-08 05:08:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 05:08:55,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:55,453 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:55,453 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:55,454 INFO L82 PathProgramCache]: Analyzing trace with hash 373909830, now seen corresponding path program 1 times [2019-09-08 05:08:55,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:08:55,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:55,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:55,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,668 INFO L87 Difference]: Start difference. First operand 712 states and 979 transitions. Second operand 3 states. [2019-09-08 05:08:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:55,763 INFO L93 Difference]: Finished difference Result 1445 states and 2032 transitions. [2019-09-08 05:08:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:55,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-08 05:08:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:55,771 INFO L225 Difference]: With dead ends: 1445 [2019-09-08 05:08:55,771 INFO L226 Difference]: Without dead ends: 798 [2019-09-08 05:08:55,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-08 05:08:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 797. [2019-09-08 05:08:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-08 05:08:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1123 transitions. [2019-09-08 05:08:55,813 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1123 transitions. Word has length 218 [2019-09-08 05:08:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:55,814 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1123 transitions. [2019-09-08 05:08:55,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1123 transitions. [2019-09-08 05:08:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 05:08:55,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:55,822 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:55,822 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2072189759, now seen corresponding path program 1 times [2019-09-08 05:08:55,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:08:56,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:08:56,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:08:56,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:56,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 3276 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:08:56,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:08:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 05:08:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:08:57,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-09-08 05:08:57,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:08:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:08:57,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:08:57,318 INFO L87 Difference]: Start difference. First operand 797 states and 1123 transitions. Second operand 26 states. [2019-09-08 05:09:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:09,220 INFO L93 Difference]: Finished difference Result 3134 states and 4474 transitions. [2019-09-08 05:09:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 05:09:09,221 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 221 [2019-09-08 05:09:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:09,250 INFO L225 Difference]: With dead ends: 3134 [2019-09-08 05:09:09,250 INFO L226 Difference]: Without dead ends: 2373 [2019-09-08 05:09:09,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 05:09:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-09-08 05:09:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2333. [2019-09-08 05:09:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-09-08 05:09:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3304 transitions. [2019-09-08 05:09:09,436 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3304 transitions. Word has length 221 [2019-09-08 05:09:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:09,437 INFO L475 AbstractCegarLoop]: Abstraction has 2333 states and 3304 transitions. [2019-09-08 05:09:09,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:09:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3304 transitions. [2019-09-08 05:09:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 05:09:09,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:09,447 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:09,447 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash -84209499, now seen corresponding path program 1 times [2019-09-08 05:09:09,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:09,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:09,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:09:09,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:09:09,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:09:09,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:09:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:10,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:09:10,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:09:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:09:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:09:10,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-09-08 05:09:10,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:09:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:09:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:09:10,702 INFO L87 Difference]: Start difference. First operand 2333 states and 3304 transitions. Second operand 18 states. [2019-09-08 05:09:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:14,353 INFO L93 Difference]: Finished difference Result 4769 states and 6856 transitions. [2019-09-08 05:09:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:09:14,354 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 223 [2019-09-08 05:09:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:14,396 INFO L225 Difference]: With dead ends: 4769 [2019-09-08 05:09:14,397 INFO L226 Difference]: Without dead ends: 2471 [2019-09-08 05:09:14,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:09:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-09-08 05:09:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2019-09-08 05:09:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-09-08 05:09:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3530 transitions. [2019-09-08 05:09:14,624 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3530 transitions. Word has length 223 [2019-09-08 05:09:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:14,625 INFO L475 AbstractCegarLoop]: Abstraction has 2471 states and 3530 transitions. [2019-09-08 05:09:14,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:09:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3530 transitions. [2019-09-08 05:09:14,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 05:09:14,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:14,643 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:14,643 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1920934434, now seen corresponding path program 1 times [2019-09-08 05:09:14,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:14,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:14,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:14,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:09:15,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:09:15,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:09:15,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:15,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 3279 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:09:15,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:09:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:09:16,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:09:16,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-09-08 05:09:16,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:09:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:09:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:09:16,031 INFO L87 Difference]: Start difference. First operand 2471 states and 3530 transitions. Second operand 22 states. [2019-09-08 05:09:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:25,401 INFO L93 Difference]: Finished difference Result 5012 states and 7272 transitions. [2019-09-08 05:09:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 05:09:25,402 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 224 [2019-09-08 05:09:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:25,419 INFO L225 Difference]: With dead ends: 5012 [2019-09-08 05:09:25,420 INFO L226 Difference]: Without dead ends: 2602 [2019-09-08 05:09:25,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:09:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2019-09-08 05:09:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2562. [2019-09-08 05:09:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2019-09-08 05:09:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3682 transitions. [2019-09-08 05:09:25,575 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3682 transitions. Word has length 224 [2019-09-08 05:09:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:25,576 INFO L475 AbstractCegarLoop]: Abstraction has 2562 states and 3682 transitions. [2019-09-08 05:09:25,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:09:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3682 transitions. [2019-09-08 05:09:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 05:09:25,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:25,591 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:25,591 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -57354659, now seen corresponding path program 1 times [2019-09-08 05:09:25,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:25,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:25,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:25,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 05:09:25,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:25,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:09:25,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:09:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:09:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:09:25,870 INFO L87 Difference]: Start difference. First operand 2562 states and 3682 transitions. Second operand 5 states. [2019-09-08 05:09:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:26,039 INFO L93 Difference]: Finished difference Result 3810 states and 5382 transitions. [2019-09-08 05:09:26,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:09:26,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2019-09-08 05:09:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:26,056 INFO L225 Difference]: With dead ends: 3810 [2019-09-08 05:09:26,056 INFO L226 Difference]: Without dead ends: 2100 [2019-09-08 05:09:26,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:09:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-09-08 05:09:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-09-08 05:09:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-09-08 05:09:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3025 transitions. [2019-09-08 05:09:26,196 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3025 transitions. Word has length 228 [2019-09-08 05:09:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:26,199 INFO L475 AbstractCegarLoop]: Abstraction has 2100 states and 3025 transitions. [2019-09-08 05:09:26,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:09:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3025 transitions. [2019-09-08 05:09:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 05:09:26,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:26,215 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:26,215 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash 132961435, now seen corresponding path program 1 times [2019-09-08 05:09:26,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:26,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:09:26,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:26,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:09:26,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:09:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:09:26,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:09:26,734 INFO L87 Difference]: Start difference. First operand 2100 states and 3025 transitions. Second operand 18 states. [2019-09-08 05:09:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:27,362 INFO L93 Difference]: Finished difference Result 3384 states and 4803 transitions. [2019-09-08 05:09:27,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:09:27,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 225 [2019-09-08 05:09:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:27,380 INFO L225 Difference]: With dead ends: 3384 [2019-09-08 05:09:27,381 INFO L226 Difference]: Without dead ends: 2138 [2019-09-08 05:09:27,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:09:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-09-08 05:09:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2136. [2019-09-08 05:09:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2019-09-08 05:09:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 3062 transitions. [2019-09-08 05:09:27,519 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 3062 transitions. Word has length 225 [2019-09-08 05:09:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:27,522 INFO L475 AbstractCegarLoop]: Abstraction has 2136 states and 3062 transitions. [2019-09-08 05:09:27,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:09:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 3062 transitions. [2019-09-08 05:09:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 05:09:27,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:27,535 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:27,535 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:27,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1879147409, now seen corresponding path program 1 times [2019-09-08 05:09:27,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:27,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:27,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:27,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:27,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:09:27,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:09:27,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:09:27,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:09:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:28,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:09:28,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:09:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:09:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:09:28,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 05:09:28,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:09:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:09:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:09:28,389 INFO L87 Difference]: Start difference. First operand 2136 states and 3062 transitions. Second operand 12 states. [2019-09-08 05:09:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:35,830 INFO L93 Difference]: Finished difference Result 6737 states and 9764 transitions. [2019-09-08 05:09:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:09:35,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 225 [2019-09-08 05:09:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:35,862 INFO L225 Difference]: With dead ends: 6737 [2019-09-08 05:09:35,863 INFO L226 Difference]: Without dead ends: 4676 [2019-09-08 05:09:35,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:09:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2019-09-08 05:09:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4660. [2019-09-08 05:09:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-09-08 05:09:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 6698 transitions. [2019-09-08 05:09:36,094 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 6698 transitions. Word has length 225 [2019-09-08 05:09:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:36,095 INFO L475 AbstractCegarLoop]: Abstraction has 4660 states and 6698 transitions. [2019-09-08 05:09:36,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:09:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 6698 transitions. [2019-09-08 05:09:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 05:09:36,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:36,105 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:36,105 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:36,106 INFO L82 PathProgramCache]: Analyzing trace with hash 704396339, now seen corresponding path program 1 times [2019-09-08 05:09:36,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:36,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:09:36,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:36,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 05:09:36,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:09:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:09:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:09:36,409 INFO L87 Difference]: Start difference. First operand 4660 states and 6698 transitions. Second operand 12 states. [2019-09-08 05:09:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:53,152 INFO L93 Difference]: Finished difference Result 33932 states and 50165 transitions. [2019-09-08 05:09:53,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 05:09:53,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 226 [2019-09-08 05:09:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:53,342 INFO L225 Difference]: With dead ends: 33932 [2019-09-08 05:09:53,342 INFO L226 Difference]: Without dead ends: 30520 [2019-09-08 05:09:53,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 05:09:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30520 states. [2019-09-08 05:09:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30520 to 30318. [2019-09-08 05:09:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30318 states. [2019-09-08 05:09:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30318 states to 30318 states and 44376 transitions. [2019-09-08 05:09:55,779 INFO L78 Accepts]: Start accepts. Automaton has 30318 states and 44376 transitions. Word has length 226 [2019-09-08 05:09:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:55,781 INFO L475 AbstractCegarLoop]: Abstraction has 30318 states and 44376 transitions. [2019-09-08 05:09:55,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:09:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 30318 states and 44376 transitions. [2019-09-08 05:09:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 05:09:55,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:55,800 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:55,800 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 518967005, now seen corresponding path program 1 times [2019-09-08 05:09:55,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:55,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:09:56,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:09:56,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:09:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:09:56,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:09:56,165 INFO L87 Difference]: Start difference. First operand 30318 states and 44376 transitions. Second operand 20 states. [2019-09-08 05:09:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:57,529 INFO L93 Difference]: Finished difference Result 55433 states and 80583 transitions. [2019-09-08 05:09:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 05:09:57,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2019-09-08 05:09:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:57,675 INFO L225 Difference]: With dead ends: 55433 [2019-09-08 05:09:57,675 INFO L226 Difference]: Without dead ends: 26757 [2019-09-08 05:09:57,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:09:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26757 states. [2019-09-08 05:10:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26757 to 26631. [2019-09-08 05:10:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26631 states. [2019-09-08 05:10:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26631 states to 26631 states and 37857 transitions. [2019-09-08 05:10:00,322 INFO L78 Accepts]: Start accepts. Automaton has 26631 states and 37857 transitions. Word has length 227 [2019-09-08 05:10:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:00,323 INFO L475 AbstractCegarLoop]: Abstraction has 26631 states and 37857 transitions. [2019-09-08 05:10:00,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:10:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 26631 states and 37857 transitions. [2019-09-08 05:10:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:10:00,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:00,343 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:00,343 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:00,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1566016342, now seen corresponding path program 1 times [2019-09-08 05:10:00,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:00,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:00,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:10:00,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:10:00,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:10:00,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:10:00,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:10:00,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:10:00,538 INFO L87 Difference]: Start difference. First operand 26631 states and 37857 transitions. Second operand 8 states. [2019-09-08 05:10:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:10:03,047 INFO L93 Difference]: Finished difference Result 78450 states and 113232 transitions. [2019-09-08 05:10:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:10:03,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-09-08 05:10:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:10:03,307 INFO L225 Difference]: With dead ends: 78450 [2019-09-08 05:10:03,307 INFO L226 Difference]: Without dead ends: 53472 [2019-09-08 05:10:03,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:10:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53472 states. [2019-09-08 05:10:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53472 to 52494. [2019-09-08 05:10:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52494 states. [2019-09-08 05:10:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52494 states to 52494 states and 74432 transitions. [2019-09-08 05:10:07,918 INFO L78 Accepts]: Start accepts. Automaton has 52494 states and 74432 transitions. Word has length 236 [2019-09-08 05:10:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:07,918 INFO L475 AbstractCegarLoop]: Abstraction has 52494 states and 74432 transitions. [2019-09-08 05:10:07,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:10:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 52494 states and 74432 transitions. [2019-09-08 05:10:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 05:10:07,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:07,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:07,936 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:07,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:07,936 INFO L82 PathProgramCache]: Analyzing trace with hash -299808616, now seen corresponding path program 1 times [2019-09-08 05:10:07,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:07,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:07,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:10:08,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:10:08,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:10:08,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:08,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 3325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:10:08,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:10:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:10:08,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:10:08,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-09-08 05:10:08,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:10:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:10:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:10:08,897 INFO L87 Difference]: Start difference. First operand 52494 states and 74432 transitions. Second operand 20 states. [2019-09-08 05:10:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:10:18,304 INFO L93 Difference]: Finished difference Result 105712 states and 152729 transitions. [2019-09-08 05:10:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 05:10:18,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 237 [2019-09-08 05:10:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:10:18,528 INFO L225 Difference]: With dead ends: 105712 [2019-09-08 05:10:18,529 INFO L226 Difference]: Without dead ends: 53298 [2019-09-08 05:10:18,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=2721, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 05:10:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53298 states. [2019-09-08 05:10:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53298 to 52494. [2019-09-08 05:10:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52494 states. [2019-09-08 05:10:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52494 states to 52494 states and 74431 transitions. [2019-09-08 05:10:20,720 INFO L78 Accepts]: Start accepts. Automaton has 52494 states and 74431 transitions. Word has length 237 [2019-09-08 05:10:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:20,721 INFO L475 AbstractCegarLoop]: Abstraction has 52494 states and 74431 transitions. [2019-09-08 05:10:20,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:10:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 52494 states and 74431 transitions. [2019-09-08 05:10:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 05:10:20,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:20,743 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:20,743 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:20,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1528761596, now seen corresponding path program 1 times [2019-09-08 05:10:20,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:20,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:20,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 05:10:21,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:10:21,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:10:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:21,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 3325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:10:21,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:10:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 05:10:21,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:10:21,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-09-08 05:10:21,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 05:10:21,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 05:10:21,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:10:21,895 INFO L87 Difference]: Start difference. First operand 52494 states and 74431 transitions. Second operand 30 states. [2019-09-08 05:10:26,180 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-09-08 05:10:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:10:33,943 INFO L93 Difference]: Finished difference Result 107904 states and 155302 transitions. [2019-09-08 05:10:33,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 05:10:33,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 238 [2019-09-08 05:10:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:10:34,148 INFO L225 Difference]: With dead ends: 107904 [2019-09-08 05:10:34,148 INFO L226 Difference]: Without dead ends: 55490 [2019-09-08 05:10:34,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=507, Invalid=4749, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 05:10:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55490 states. [2019-09-08 05:10:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55490 to 54388. [2019-09-08 05:10:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54388 states. [2019-09-08 05:10:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54388 states to 54388 states and 77322 transitions. [2019-09-08 05:10:36,317 INFO L78 Accepts]: Start accepts. Automaton has 54388 states and 77322 transitions. Word has length 238 [2019-09-08 05:10:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:36,317 INFO L475 AbstractCegarLoop]: Abstraction has 54388 states and 77322 transitions. [2019-09-08 05:10:36,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 05:10:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54388 states and 77322 transitions. [2019-09-08 05:10:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 05:10:36,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:36,331 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:36,331 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1415160733, now seen corresponding path program 1 times [2019-09-08 05:10:36,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:36,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:10:36,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:10:36,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:10:36,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:10:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:10:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:10:36,556 INFO L87 Difference]: Start difference. First operand 54388 states and 77322 transitions. Second operand 13 states. [2019-09-08 05:10:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:10:38,711 INFO L93 Difference]: Finished difference Result 105152 states and 152170 transitions. [2019-09-08 05:10:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:10:38,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2019-09-08 05:10:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:10:38,925 INFO L225 Difference]: With dead ends: 105152 [2019-09-08 05:10:38,925 INFO L226 Difference]: Without dead ends: 61292 [2019-09-08 05:10:39,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:10:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61292 states. [2019-09-08 05:10:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61292 to 59978. [2019-09-08 05:10:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59978 states. [2019-09-08 05:10:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59978 states to 59978 states and 86603 transitions. [2019-09-08 05:10:41,521 INFO L78 Accepts]: Start accepts. Automaton has 59978 states and 86603 transitions. Word has length 239 [2019-09-08 05:10:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:41,522 INFO L475 AbstractCegarLoop]: Abstraction has 59978 states and 86603 transitions. [2019-09-08 05:10:41,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:10:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59978 states and 86603 transitions. [2019-09-08 05:10:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 05:10:41,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:41,538 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:41,538 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash 259520473, now seen corresponding path program 2 times [2019-09-08 05:10:41,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:41,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:10:41,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:10:41,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:10:41,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:10:42,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:10:42,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:10:42,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 05:10:42,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:10:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:10:42,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:10:42,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-08 05:10:42,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:10:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:10:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:10:42,471 INFO L87 Difference]: Start difference. First operand 59978 states and 86603 transitions. Second operand 18 states. [2019-09-08 05:10:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:10:58,197 INFO L93 Difference]: Finished difference Result 172168 states and 249128 transitions. [2019-09-08 05:10:58,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:10:58,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 239 [2019-09-08 05:10:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:10:58,512 INFO L225 Difference]: With dead ends: 172168 [2019-09-08 05:10:58,512 INFO L226 Difference]: Without dead ends: 107159 [2019-09-08 05:10:58,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 05:10:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107159 states. [2019-09-08 05:11:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107159 to 102730. [2019-09-08 05:11:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102730 states. [2019-09-08 05:11:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102730 states to 102730 states and 147060 transitions. [2019-09-08 05:11:05,800 INFO L78 Accepts]: Start accepts. Automaton has 102730 states and 147060 transitions. Word has length 239 [2019-09-08 05:11:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:05,800 INFO L475 AbstractCegarLoop]: Abstraction has 102730 states and 147060 transitions. [2019-09-08 05:11:05,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:11:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 102730 states and 147060 transitions. [2019-09-08 05:11:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:11:05,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:05,819 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:05,819 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash 917372360, now seen corresponding path program 1 times [2019-09-08 05:11:05,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:05,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:11:05,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:11:06,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:06,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:11:06,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:11:06,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:11:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:11:06,023 INFO L87 Difference]: Start difference. First operand 102730 states and 147060 transitions. Second operand 13 states. [2019-09-08 05:11:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:09,677 INFO L93 Difference]: Finished difference Result 193660 states and 282360 transitions. [2019-09-08 05:11:09,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:11:09,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-08 05:11:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:10,136 INFO L225 Difference]: With dead ends: 193660 [2019-09-08 05:11:10,137 INFO L226 Difference]: Without dead ends: 114598 [2019-09-08 05:11:10,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:11:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114598 states. [2019-09-08 05:11:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114598 to 113104. [2019-09-08 05:11:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113104 states. [2019-09-08 05:11:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113104 states to 113104 states and 164173 transitions. [2019-09-08 05:11:17,817 INFO L78 Accepts]: Start accepts. Automaton has 113104 states and 164173 transitions. Word has length 240 [2019-09-08 05:11:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:17,818 INFO L475 AbstractCegarLoop]: Abstraction has 113104 states and 164173 transitions. [2019-09-08 05:11:17,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:11:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 113104 states and 164173 transitions. [2019-09-08 05:11:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:11:17,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:17,838 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:17,838 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:17,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1782006735, now seen corresponding path program 1 times [2019-09-08 05:11:17,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:17,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:17,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:17,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:17,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:11:18,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:18,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:11:18,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:11:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:11:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:11:18,004 INFO L87 Difference]: Start difference. First operand 113104 states and 164173 transitions. Second operand 6 states. [2019-09-08 05:11:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:22,600 INFO L93 Difference]: Finished difference Result 226080 states and 328212 transitions. [2019-09-08 05:11:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:11:22,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 05:11:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:23,012 INFO L225 Difference]: With dead ends: 226080 [2019-09-08 05:11:23,013 INFO L226 Difference]: Without dead ends: 113104 [2019-09-08 05:11:23,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:11:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113104 states. [2019-09-08 05:11:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113104 to 109615. [2019-09-08 05:11:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109615 states. [2019-09-08 05:11:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109615 states to 109615 states and 158967 transitions. [2019-09-08 05:11:31,336 INFO L78 Accepts]: Start accepts. Automaton has 109615 states and 158967 transitions. Word has length 240 [2019-09-08 05:11:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:31,336 INFO L475 AbstractCegarLoop]: Abstraction has 109615 states and 158967 transitions. [2019-09-08 05:11:31,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:11:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 109615 states and 158967 transitions. [2019-09-08 05:11:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 05:11:31,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:31,350 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:31,350 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash 888652888, now seen corresponding path program 1 times [2019-09-08 05:11:31,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:31,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:31,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:11:31,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:11:31,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:11:31,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:11:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:11:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:31,484 INFO L87 Difference]: Start difference. First operand 109615 states and 158967 transitions. Second operand 3 states. [2019-09-08 05:11:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:34,760 INFO L93 Difference]: Finished difference Result 220080 states and 319618 transitions. [2019-09-08 05:11:34,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:11:34,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-08 05:11:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:35,148 INFO L225 Difference]: With dead ends: 220080 [2019-09-08 05:11:35,148 INFO L226 Difference]: Without dead ends: 110605 [2019-09-08 05:11:35,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:11:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110605 states. [2019-09-08 05:11:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110605 to 107257. [2019-09-08 05:11:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107257 states. [2019-09-08 05:11:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107257 states to 107257 states and 155774 transitions. [2019-09-08 05:11:43,157 INFO L78 Accepts]: Start accepts. Automaton has 107257 states and 155774 transitions. Word has length 238 [2019-09-08 05:11:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:11:43,157 INFO L475 AbstractCegarLoop]: Abstraction has 107257 states and 155774 transitions. [2019-09-08 05:11:43,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:11:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 107257 states and 155774 transitions. [2019-09-08 05:11:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 05:11:43,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:11:43,179 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:11:43,179 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:11:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:11:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash 682003208, now seen corresponding path program 1 times [2019-09-08 05:11:43,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:11:43,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:11:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:43,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:11:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:11:43,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:11:43,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:11:43,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:11:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:11:44,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:11:44,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:11:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:11:44,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:11:44,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-09-08 05:11:44,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:11:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:11:44,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:11:44,113 INFO L87 Difference]: Start difference. First operand 107257 states and 155774 transitions. Second operand 20 states. [2019-09-08 05:11:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:11:56,797 INFO L93 Difference]: Finished difference Result 248759 states and 362293 transitions. [2019-09-08 05:11:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:11:56,797 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 241 [2019-09-08 05:11:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:11:57,341 INFO L225 Difference]: With dead ends: 248759 [2019-09-08 05:11:57,342 INFO L226 Difference]: Without dead ends: 144790 [2019-09-08 05:11:57,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:11:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144790 states. [2019-09-08 05:12:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144790 to 143848. [2019-09-08 05:12:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143848 states. [2019-09-08 05:12:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143848 states to 143848 states and 209595 transitions. [2019-09-08 05:12:08,209 INFO L78 Accepts]: Start accepts. Automaton has 143848 states and 209595 transitions. Word has length 241 [2019-09-08 05:12:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:08,210 INFO L475 AbstractCegarLoop]: Abstraction has 143848 states and 209595 transitions. [2019-09-08 05:12:08,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:12:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 143848 states and 209595 transitions. [2019-09-08 05:12:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 05:12:08,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:08,234 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:08,234 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash -963683446, now seen corresponding path program 1 times [2019-09-08 05:12:08,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:08,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:12:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:08,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:12:08,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:12:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:12:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:08,371 INFO L87 Difference]: Start difference. First operand 143848 states and 209595 transitions. Second operand 3 states. [2019-09-08 05:12:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:13,697 INFO L93 Difference]: Finished difference Result 289408 states and 422442 transitions. [2019-09-08 05:12:13,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:12:13,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 05:12:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:14,140 INFO L225 Difference]: With dead ends: 289408 [2019-09-08 05:12:14,140 INFO L226 Difference]: Without dead ends: 145762 [2019-09-08 05:12:14,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145762 states. [2019-09-08 05:12:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145762 to 145491. [2019-09-08 05:12:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145491 states. [2019-09-08 05:12:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145491 states to 145491 states and 212674 transitions. [2019-09-08 05:12:25,639 INFO L78 Accepts]: Start accepts. Automaton has 145491 states and 212674 transitions. Word has length 239 [2019-09-08 05:12:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:25,640 INFO L475 AbstractCegarLoop]: Abstraction has 145491 states and 212674 transitions. [2019-09-08 05:12:25,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:12:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 145491 states and 212674 transitions. [2019-09-08 05:12:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:12:25,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:25,664 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:25,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1571546876, now seen corresponding path program 1 times [2019-09-08 05:12:25,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:25,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:12:25,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:12:25,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:12:25,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:12:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:25,809 INFO L87 Difference]: Start difference. First operand 145491 states and 212674 transitions. Second operand 3 states. [2019-09-08 05:12:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:34,640 INFO L93 Difference]: Finished difference Result 294422 states and 431712 transitions. [2019-09-08 05:12:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:12:34,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-08 05:12:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:35,221 INFO L225 Difference]: With dead ends: 294422 [2019-09-08 05:12:35,221 INFO L226 Difference]: Without dead ends: 149157 [2019-09-08 05:12:35,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149157 states. [2019-09-08 05:12:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149157 to 148985. [2019-09-08 05:12:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148985 states. [2019-09-08 05:12:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148985 states to 148985 states and 218988 transitions. [2019-09-08 05:12:41,932 INFO L78 Accepts]: Start accepts. Automaton has 148985 states and 218988 transitions. Word has length 240 [2019-09-08 05:12:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:41,933 INFO L475 AbstractCegarLoop]: Abstraction has 148985 states and 218988 transitions. [2019-09-08 05:12:41,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:12:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 148985 states and 218988 transitions. [2019-09-08 05:12:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 05:12:41,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:41,970 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:41,970 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash 759578730, now seen corresponding path program 1 times [2019-09-08 05:12:41,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:41,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:41,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:41,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:12:42,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:42,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:12:42,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:12:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:12:42,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:42,095 INFO L87 Difference]: Start difference. First operand 148985 states and 218988 transitions. Second operand 3 states. [2019-09-08 05:12:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:52,984 INFO L93 Difference]: Finished difference Result 304742 states and 450452 transitions. [2019-09-08 05:12:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:12:52,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 05:12:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:53,476 INFO L225 Difference]: With dead ends: 304742 [2019-09-08 05:12:53,476 INFO L226 Difference]: Without dead ends: 156003 [2019-09-08 05:12:53,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156003 states. [2019-09-08 05:12:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156003 to 155997. [2019-09-08 05:12:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155997 states. [2019-09-08 05:12:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155997 states to 155997 states and 231566 transitions. [2019-09-08 05:12:59,591 INFO L78 Accepts]: Start accepts. Automaton has 155997 states and 231566 transitions. Word has length 241 [2019-09-08 05:12:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:12:59,592 INFO L475 AbstractCegarLoop]: Abstraction has 155997 states and 231566 transitions. [2019-09-08 05:12:59,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:12:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 155997 states and 231566 transitions. [2019-09-08 05:12:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:12:59,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:12:59,662 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:12:59,663 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:12:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:12:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1662215132, now seen corresponding path program 1 times [2019-09-08 05:12:59,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:12:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:12:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:59,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:12:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:12:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:12:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:12:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:12:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:12:59,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:12:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:12:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:12:59,789 INFO L87 Difference]: Start difference. First operand 155997 states and 231566 transitions. Second operand 3 states. [2019-09-08 05:13:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:10,604 INFO L93 Difference]: Finished difference Result 325186 states and 486822 transitions. [2019-09-08 05:13:10,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:13:10,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-08 05:13:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:11,234 INFO L225 Difference]: With dead ends: 325186 [2019-09-08 05:13:11,235 INFO L226 Difference]: Without dead ends: 169447 [2019-09-08 05:13:11,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169447 states. [2019-09-08 05:13:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169447 to 169441. [2019-09-08 05:13:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169441 states. [2019-09-08 05:13:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169441 states to 169441 states and 255184 transitions. [2019-09-08 05:13:18,975 INFO L78 Accepts]: Start accepts. Automaton has 169441 states and 255184 transitions. Word has length 242 [2019-09-08 05:13:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:18,976 INFO L475 AbstractCegarLoop]: Abstraction has 169441 states and 255184 transitions. [2019-09-08 05:13:18,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:13:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 169441 states and 255184 transitions. [2019-09-08 05:13:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 05:13:19,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:19,105 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:19,106 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1144924854, now seen corresponding path program 1 times [2019-09-08 05:13:19,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:19,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:13:19,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:19,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:13:19,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:13:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:13:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:19,240 INFO L87 Difference]: Start difference. First operand 169441 states and 255184 transitions. Second operand 3 states. [2019-09-08 05:13:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:31,257 INFO L93 Difference]: Finished difference Result 364350 states and 556122 transitions. [2019-09-08 05:13:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:13:31,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-09-08 05:13:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:31,904 INFO L225 Difference]: With dead ends: 364350 [2019-09-08 05:13:31,904 INFO L226 Difference]: Without dead ends: 195179 [2019-09-08 05:13:32,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195179 states. [2019-09-08 05:13:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195179 to 195007. [2019-09-08 05:13:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195007 states. [2019-09-08 05:13:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195007 states to 195007 states and 300275 transitions. [2019-09-08 05:13:41,308 INFO L78 Accepts]: Start accepts. Automaton has 195007 states and 300275 transitions. Word has length 243 [2019-09-08 05:13:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:13:41,308 INFO L475 AbstractCegarLoop]: Abstraction has 195007 states and 300275 transitions. [2019-09-08 05:13:41,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:13:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 195007 states and 300275 transitions. [2019-09-08 05:13:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:13:41,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:13:41,534 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:13:41,535 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:13:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:13:41,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1097240764, now seen corresponding path program 1 times [2019-09-08 05:13:41,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:13:41,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:13:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:41,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:13:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:13:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:13:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:13:41,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:13:41,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:13:41,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:13:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:13:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:41,656 INFO L87 Difference]: Start difference. First operand 195007 states and 300275 transitions. Second operand 3 states. [2019-09-08 05:13:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:13:55,639 INFO L93 Difference]: Finished difference Result 438898 states and 686224 transitions. [2019-09-08 05:13:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:13:55,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-08 05:13:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:13:56,433 INFO L225 Difference]: With dead ends: 438898 [2019-09-08 05:13:56,433 INFO L226 Difference]: Without dead ends: 244177 [2019-09-08 05:13:56,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:13:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244177 states. [2019-09-08 05:14:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244177 to 244171. [2019-09-08 05:14:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244171 states. [2019-09-08 05:14:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244171 states to 244171 states and 384765 transitions. [2019-09-08 05:14:16,511 INFO L78 Accepts]: Start accepts. Automaton has 244171 states and 384765 transitions. Word has length 244 [2019-09-08 05:14:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:16,512 INFO L475 AbstractCegarLoop]: Abstraction has 244171 states and 384765 transitions. [2019-09-08 05:14:16,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 244171 states and 384765 transitions. [2019-09-08 05:14:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:14:16,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:16,931 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:16,931 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1527781930, now seen corresponding path program 1 times [2019-09-08 05:14:16,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:16,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:14:17,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:17,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:17,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:17,047 INFO L87 Difference]: Start difference. First operand 244171 states and 384765 transitions. Second operand 3 states. [2019-09-08 05:14:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:37,903 INFO L93 Difference]: Finished difference Result 581742 states and 930434 transitions. [2019-09-08 05:14:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:37,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 05:14:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:39,589 INFO L225 Difference]: With dead ends: 581742 [2019-09-08 05:14:39,590 INFO L226 Difference]: Without dead ends: 337877 [2019-09-08 05:14:39,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337877 states. [2019-09-08 05:15:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337877 to 337871. [2019-09-08 05:15:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337871 states. [2019-09-08 05:15:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337871 states to 337871 states and 542975 transitions. [2019-09-08 05:15:08,017 INFO L78 Accepts]: Start accepts. Automaton has 337871 states and 542975 transitions. Word has length 245 [2019-09-08 05:15:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:08,017 INFO L475 AbstractCegarLoop]: Abstraction has 337871 states and 542975 transitions. [2019-09-08 05:15:08,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:15:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 337871 states and 542975 transitions. [2019-09-08 05:15:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 05:15:08,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:08,794 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:08,794 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:08,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:08,794 INFO L82 PathProgramCache]: Analyzing trace with hash -187919772, now seen corresponding path program 1 times [2019-09-08 05:15:08,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:08,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:08,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:15:08,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:08,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:15:08,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:15:08,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:15:08,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:15:08,915 INFO L87 Difference]: Start difference. First operand 337871 states and 542975 transitions. Second operand 3 states. [2019-09-08 05:15:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:36,611 INFO L93 Difference]: Finished difference Result 655850 states and 1047015 transitions. [2019-09-08 05:15:36,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:15:36,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 05:15:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:38,371 INFO L225 Difference]: With dead ends: 655850 [2019-09-08 05:15:38,372 INFO L226 Difference]: Without dead ends: 516029 [2019-09-08 05:15:38,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:15:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516029 states. [2019-09-08 05:16:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516029 to 515878. [2019-09-08 05:16:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515878 states. [2019-09-08 05:16:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515878 states to 515878 states and 837657 transitions. [2019-09-08 05:16:30,983 INFO L78 Accepts]: Start accepts. Automaton has 515878 states and 837657 transitions. Word has length 246 [2019-09-08 05:16:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:30,983 INFO L475 AbstractCegarLoop]: Abstraction has 515878 states and 837657 transitions. [2019-09-08 05:16:30,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:16:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 515878 states and 837657 transitions. [2019-09-08 05:16:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 05:16:32,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:32,256 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:32,256 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2134839050, now seen corresponding path program 1 times [2019-09-08 05:16:32,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:32,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:16:32,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:16:32,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:16:32,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:33,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 3355 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 05:16:33,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:16:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:16:33,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:16:33,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-09-08 05:16:33,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 05:16:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 05:16:33,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:16:33,479 INFO L87 Difference]: Start difference. First operand 515878 states and 837657 transitions. Second operand 35 states.