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_spec4_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:14:35,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:14:35,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:14:35,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:14:35,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:14:35,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:14:35,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:14:35,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:14:35,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:14:35,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:14:35,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:14:35,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:14:35,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:14:35,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:14:35,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:14:35,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:14:35,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:14:35,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:14:35,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:14:35,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:14:35,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:14:35,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:14:35,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:14:35,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:14:35,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:14:35,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:14:35,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:14:35,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:14:35,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:14:35,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:14:35,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:14:35,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:14:35,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:14:35,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:14:35,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:14:35,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:14:35,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:14:35,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:14:35,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:14:35,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:14:35,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:14:35,397 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:14:35,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:14:35,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:14:35,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:14:35,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:14:35,422 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:14:35,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:14:35,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:14:35,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:14:35,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:14:35,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:14:35,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:14:35,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:14:35,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:14:35,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:14:35,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:14:35,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:14:35,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:14:35,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:14:35,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:14:35,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:14:35,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:14:35,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:14:35,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:14:35,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:14:35,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:14:35,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:14:35,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:14:35,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:14:35,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:14:35,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:14:35,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:14:35,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:14:35,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:14:35,486 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:14:35,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product25.cil.c [2019-09-08 05:14:35,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6273f34/9a2bb64f304d47e79f3f1cd9b45fa4e6/FLAGfb75e28b7 [2019-09-08 05:14:36,130 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:14:36,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product25.cil.c [2019-09-08 05:14:36,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6273f34/9a2bb64f304d47e79f3f1cd9b45fa4e6/FLAGfb75e28b7 [2019-09-08 05:14:36,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6273f34/9a2bb64f304d47e79f3f1cd9b45fa4e6 [2019-09-08 05:14:36,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:14:36,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:14:36,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:14:36,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:14:36,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:14:36,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:14:36" (1/1) ... [2019-09-08 05:14:36,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38938422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:36, skipping insertion in model container [2019-09-08 05:14:36,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:14:36" (1/1) ... [2019-09-08 05:14:36,413 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:14:36,500 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:14:37,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:14:37,166 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:14:37,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:14:37,363 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:14:37,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37 WrapperNode [2019-09-08 05:14:37,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:14:37,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:14:37,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:14:37,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:14:37,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... [2019-09-08 05:14:37,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:14:37,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:14:37,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:14:37,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:14:37,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:14:37,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:14:37,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:14:37,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:14:37,585 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:14:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:14:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:14:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:14:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:14:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:14:37,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:14:37,587 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:14:37,587 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:14:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:14:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:14:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:14:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:14:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:14:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:14:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:14:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:14:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:14:37,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:14:37,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:14:37,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:14:37,590 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:14:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:14:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:14:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:14:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:14:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:14:37,593 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:14:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:14:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:14:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:14:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:14:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:14:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:14:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:14:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:14:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:14:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:14:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:14:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:14:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:14:37,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:14:37,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:14:37,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:14:37,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:14:37,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:14:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:14:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:14:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:14:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:14:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:14:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:14:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:14:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:14:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:14:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:14:37,601 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:14:37,601 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:14:37,601 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:14:37,602 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:14:37,602 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:14:37,602 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:14:37,602 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:14:37,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:14:37,602 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:14:37,603 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:14:37,603 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:14:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:14:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:14:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:14:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:14:37,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:14:37,605 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:14:37,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:14:37,606 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:14:37,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:14:37,606 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:14:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:14:37,608 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:14:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:14:37,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:14:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:14:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:14:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:14:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:14:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:14:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:14:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:14:37,611 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:14:37,612 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:14:37,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:14:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:14:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:14:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:14:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:14:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:14:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:14:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:14:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:14:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:14:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:14:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:14:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:14:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:14:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:14:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:14:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:14:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:14:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:14:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:14:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:14:37,628 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:14:37,628 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:14:37,628 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:14:37,628 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:14:37,628 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:14:37,628 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:14:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:14:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:14:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:14:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:14:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:14:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:14:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:14:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:14:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:14:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:14:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:14:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:14:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:14:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:14:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:14:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:14:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:14:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:14:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:14:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:14:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:14:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:14:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:14:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:14:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:14:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:14:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:14:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:14:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:14:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:14:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:14:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:14:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:14:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:14:37,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:14:39,590 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:14:39,591 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:14:39,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:14:39 BoogieIcfgContainer [2019-09-08 05:14:39,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:14:39,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:14:39,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:14:39,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:14:39,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:14:36" (1/3) ... [2019-09-08 05:14:39,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4211e0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:14:39, skipping insertion in model container [2019-09-08 05:14:39,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:37" (2/3) ... [2019-09-08 05:14:39,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4211e0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:14:39, skipping insertion in model container [2019-09-08 05:14:39,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:14:39" (3/3) ... [2019-09-08 05:14:39,600 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product25.cil.c [2019-09-08 05:14:39,610 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:14:39,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:14:39,637 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:14:39,672 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:14:39,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:14:39,673 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:14:39,673 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:14:39,673 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:14:39,673 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:14:39,673 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:14:39,673 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:14:39,674 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:14:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states. [2019-09-08 05:14:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 05:14:39,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:39,749 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:39,755 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash 979301507, now seen corresponding path program 1 times [2019-09-08 05:14:39,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:39,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:39,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:40,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:40,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:14:40,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:14:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:14:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:14:40,429 INFO L87 Difference]: Start difference. First operand 587 states. Second operand 2 states. [2019-09-08 05:14:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:40,550 INFO L93 Difference]: Finished difference Result 860 states and 1158 transitions. [2019-09-08 05:14:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:14:40,552 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 157 [2019-09-08 05:14:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:40,592 INFO L225 Difference]: With dead ends: 860 [2019-09-08 05:14:40,592 INFO L226 Difference]: Without dead ends: 558 [2019-09-08 05:14:40,603 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:14:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-08 05:14:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2019-09-08 05:14:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 05:14:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 758 transitions. [2019-09-08 05:14:40,739 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 758 transitions. Word has length 157 [2019-09-08 05:14:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:40,741 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 758 transitions. [2019-09-08 05:14:40,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:14:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 758 transitions. [2019-09-08 05:14:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 05:14:40,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:40,749 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:40,749 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1208333111, now seen corresponding path program 1 times [2019-09-08 05:14:40,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:40,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:40,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:40,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:40,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:40,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:40,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:40,982 INFO L87 Difference]: Start difference. First operand 558 states and 758 transitions. Second operand 3 states. [2019-09-08 05:14:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:41,029 INFO L93 Difference]: Finished difference Result 843 states and 1124 transitions. [2019-09-08 05:14:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:41,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 05:14:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:41,035 INFO L225 Difference]: With dead ends: 843 [2019-09-08 05:14:41,035 INFO L226 Difference]: Without dead ends: 561 [2019-09-08 05:14:41,037 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:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-08 05:14:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2019-09-08 05:14:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-08 05:14:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 760 transitions. [2019-09-08 05:14:41,062 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 760 transitions. Word has length 158 [2019-09-08 05:14:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:41,062 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 760 transitions. [2019-09-08 05:14:41,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 760 transitions. [2019-09-08 05:14:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 05:14:41,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:41,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:41,066 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash -898533821, now seen corresponding path program 1 times [2019-09-08 05:14:41,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:41,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:41,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:41,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:41,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:41,263 INFO L87 Difference]: Start difference. First operand 560 states and 760 transitions. Second operand 3 states. [2019-09-08 05:14:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:41,314 INFO L93 Difference]: Finished difference Result 1098 states and 1521 transitions. [2019-09-08 05:14:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:41,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-08 05:14:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:41,320 INFO L225 Difference]: With dead ends: 1098 [2019-09-08 05:14:41,321 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 05:14:41,322 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:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 05:14:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 602. [2019-09-08 05:14:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-08 05:14:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 832 transitions. [2019-09-08 05:14:41,356 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 832 transitions. Word has length 164 [2019-09-08 05:14:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:41,357 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 832 transitions. [2019-09-08 05:14:41,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 832 transitions. [2019-09-08 05:14:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:14:41,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:41,363 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:41,363 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2079025427, now seen corresponding path program 1 times [2019-09-08 05:14:41,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:41,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:14:41,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:14:41,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:14:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:14:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:14:41,602 INFO L87 Difference]: Start difference. First operand 602 states and 832 transitions. Second operand 7 states. [2019-09-08 05:14:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:44,801 INFO L93 Difference]: Finished difference Result 1158 states and 1558 transitions. [2019-09-08 05:14:44,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:14:44,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-09-08 05:14:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:44,808 INFO L225 Difference]: With dead ends: 1158 [2019-09-08 05:14:44,808 INFO L226 Difference]: Without dead ends: 887 [2019-09-08 05:14:44,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:14:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-08 05:14:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 878. [2019-09-08 05:14:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-09-08 05:14:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1192 transitions. [2019-09-08 05:14:44,850 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1192 transitions. Word has length 165 [2019-09-08 05:14:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:44,851 INFO L475 AbstractCegarLoop]: Abstraction has 878 states and 1192 transitions. [2019-09-08 05:14:44,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:14:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1192 transitions. [2019-09-08 05:14:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:14:44,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:44,856 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:44,856 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2091303860, now seen corresponding path program 1 times [2019-09-08 05:14:44,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:44,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:14:45,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:45,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:14:45,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:14:45,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:14:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:14:45,239 INFO L87 Difference]: Start difference. First operand 878 states and 1192 transitions. Second operand 18 states. [2019-09-08 05:14:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:45,678 INFO L93 Difference]: Finished difference Result 1519 states and 2047 transitions. [2019-09-08 05:14:45,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:14:45,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 166 [2019-09-08 05:14:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:45,686 INFO L225 Difference]: With dead ends: 1519 [2019-09-08 05:14:45,686 INFO L226 Difference]: Without dead ends: 966 [2019-09-08 05:14:45,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:14:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-09-08 05:14:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-09-08 05:14:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-09-08 05:14:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1313 transitions. [2019-09-08 05:14:45,752 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1313 transitions. Word has length 166 [2019-09-08 05:14:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:45,754 INFO L475 AbstractCegarLoop]: Abstraction has 964 states and 1313 transitions. [2019-09-08 05:14:45,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:14:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1313 transitions. [2019-09-08 05:14:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 05:14:45,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:45,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:45,764 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:45,764 INFO L82 PathProgramCache]: Analyzing trace with hash -328084636, now seen corresponding path program 1 times [2019-09-08 05:14:45,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:45,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:45,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:14:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:45,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:14:45,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:14:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:14:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:14:45,995 INFO L87 Difference]: Start difference. First operand 964 states and 1313 transitions. Second operand 8 states. [2019-09-08 05:14:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:46,839 INFO L93 Difference]: Finished difference Result 2103 states and 2822 transitions. [2019-09-08 05:14:46,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:14:46,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 05:14:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:46,850 INFO L225 Difference]: With dead ends: 2103 [2019-09-08 05:14:46,850 INFO L226 Difference]: Without dead ends: 1642 [2019-09-08 05:14:46,852 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:14:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-08 05:14:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1623. [2019-09-08 05:14:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-09-08 05:14:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2190 transitions. [2019-09-08 05:14:46,929 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2190 transitions. Word has length 175 [2019-09-08 05:14:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:46,929 INFO L475 AbstractCegarLoop]: Abstraction has 1623 states and 2190 transitions. [2019-09-08 05:14:46,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:14:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2190 transitions. [2019-09-08 05:14:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:14:46,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:46,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:46,936 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash 958665188, now seen corresponding path program 1 times [2019-09-08 05:14:46,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:46,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:46,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:14:47,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:47,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:14:47,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:14:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:14:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:14:47,264 INFO L87 Difference]: Start difference. First operand 1623 states and 2190 transitions. Second operand 17 states. [2019-09-08 05:14:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:47,995 INFO L93 Difference]: Finished difference Result 2246 states and 3012 transitions. [2019-09-08 05:14:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:14:47,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 176 [2019-09-08 05:14:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:48,011 INFO L225 Difference]: With dead ends: 2246 [2019-09-08 05:14:48,012 INFO L226 Difference]: Without dead ends: 1622 [2019-09-08 05:14:48,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:14:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-09-08 05:14:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1621. [2019-09-08 05:14:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2019-09-08 05:14:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2185 transitions. [2019-09-08 05:14:48,267 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2185 transitions. Word has length 176 [2019-09-08 05:14:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:48,271 INFO L475 AbstractCegarLoop]: Abstraction has 1621 states and 2185 transitions. [2019-09-08 05:14:48,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:14:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2185 transitions. [2019-09-08 05:14:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:14:48,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:48,277 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:14:48,277 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1418562754, now seen corresponding path program 2 times [2019-09-08 05:14:48,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:48,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:48,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:14:48,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:14:48,490 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) [2019-09-08 05:14:48,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:14:48,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:14:48,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:14:48,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:14:48,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:14:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 05:14:49,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:14:49,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-09-08 05:14:49,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:14:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:14:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:14:49,167 INFO L87 Difference]: Start difference. First operand 1621 states and 2185 transitions. Second operand 17 states. [2019-09-08 05:14:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:51,460 INFO L93 Difference]: Finished difference Result 4180 states and 5624 transitions. [2019-09-08 05:14:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:14:51,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 176 [2019-09-08 05:14:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:51,488 INFO L225 Difference]: With dead ends: 4180 [2019-09-08 05:14:51,488 INFO L226 Difference]: Without dead ends: 3048 [2019-09-08 05:14:51,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:14:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2019-09-08 05:14:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3023. [2019-09-08 05:14:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3023 states. [2019-09-08 05:14:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 4094 transitions. [2019-09-08 05:14:51,706 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 4094 transitions. Word has length 176 [2019-09-08 05:14:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:51,706 INFO L475 AbstractCegarLoop]: Abstraction has 3023 states and 4094 transitions. [2019-09-08 05:14:51,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:14:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 4094 transitions. [2019-09-08 05:14:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 05:14:51,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:51,730 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,730 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -218278183, now seen corresponding path program 1 times [2019-09-08 05:14:51,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:51,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:14:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 05:14:52,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:52,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:14:52,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:14:52,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:14:52,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:14:52,156 INFO L87 Difference]: Start difference. First operand 3023 states and 4094 transitions. Second operand 8 states. [2019-09-08 05:14:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:52,293 INFO L93 Difference]: Finished difference Result 5340 states and 7178 transitions. [2019-09-08 05:14:52,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:14:52,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 282 [2019-09-08 05:14:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:52,311 INFO L225 Difference]: With dead ends: 5340 [2019-09-08 05:14:52,311 INFO L226 Difference]: Without dead ends: 3023 [2019-09-08 05:14:52,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:14:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2019-09-08 05:14:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 3023. [2019-09-08 05:14:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3023 states. [2019-09-08 05:14:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 4086 transitions. [2019-09-08 05:14:52,494 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 4086 transitions. Word has length 282 [2019-09-08 05:14:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:52,496 INFO L475 AbstractCegarLoop]: Abstraction has 3023 states and 4086 transitions. [2019-09-08 05:14:52,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:14:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 4086 transitions. [2019-09-08 05:14:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 05:14:52,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:52,512 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,512 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -144255607, now seen corresponding path program 1 times [2019-09-08 05:14:52,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:52,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:52,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:52,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:14:52,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:52,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:14:52,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:14:52,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:14:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:14:52,823 INFO L87 Difference]: Start difference. First operand 3023 states and 4086 transitions. Second operand 11 states. [2019-09-08 05:14:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:57,275 INFO L93 Difference]: Finished difference Result 6650 states and 8828 transitions. [2019-09-08 05:14:57,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:14:57,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 289 [2019-09-08 05:14:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:57,310 INFO L225 Difference]: With dead ends: 6650 [2019-09-08 05:14:57,310 INFO L226 Difference]: Without dead ends: 4421 [2019-09-08 05:14:57,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:14:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2019-09-08 05:14:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 4325. [2019-09-08 05:14:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-09-08 05:14:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 5794 transitions. [2019-09-08 05:14:57,594 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 5794 transitions. Word has length 289 [2019-09-08 05:14:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:57,594 INFO L475 AbstractCegarLoop]: Abstraction has 4325 states and 5794 transitions. [2019-09-08 05:14:57,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:14:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 5794 transitions. [2019-09-08 05:14:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-09-08 05:14:57,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:57,618 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:57,618 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash 258183042, now seen corresponding path program 1 times [2019-09-08 05:14:57,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:57,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:57,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-09-08 05:14:57,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:14:57,898 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:14:57,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:58,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 3983 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:14:58,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:14:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 05:14:58,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:14:58,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 05:14:58,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:14:58,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:14:58,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:14:58,773 INFO L87 Difference]: Start difference. First operand 4325 states and 5794 transitions. Second operand 14 states. [2019-09-08 05:15:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:03,986 INFO L93 Difference]: Finished difference Result 16696 states and 22339 transitions. [2019-09-08 05:15:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:15:03,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 466 [2019-09-08 05:15:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:04,049 INFO L225 Difference]: With dead ends: 16696 [2019-09-08 05:15:04,050 INFO L226 Difference]: Without dead ends: 12407 [2019-09-08 05:15:04,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:15:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12407 states. [2019-09-08 05:15:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12407 to 11431. [2019-09-08 05:15:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11431 states. [2019-09-08 05:15:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11431 states to 11431 states and 15244 transitions. [2019-09-08 05:15:04,754 INFO L78 Accepts]: Start accepts. Automaton has 11431 states and 15244 transitions. Word has length 466 [2019-09-08 05:15:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:04,754 INFO L475 AbstractCegarLoop]: Abstraction has 11431 states and 15244 transitions. [2019-09-08 05:15:04,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:15:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11431 states and 15244 transitions. [2019-09-08 05:15:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 05:15:04,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:04,798 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:04,799 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1013828591, now seen corresponding path program 1 times [2019-09-08 05:15:04,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:04,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:04,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:15:05,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:05,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:15:05,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:15:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:15:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:15:05,049 INFO L87 Difference]: Start difference. First operand 11431 states and 15244 transitions. Second operand 7 states. [2019-09-08 05:15:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:08,068 INFO L93 Difference]: Finished difference Result 38352 states and 51306 transitions. [2019-09-08 05:15:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:15:08,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 355 [2019-09-08 05:15:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:08,199 INFO L225 Difference]: With dead ends: 38352 [2019-09-08 05:15:08,199 INFO L226 Difference]: Without dead ends: 30797 [2019-09-08 05:15:08,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:15:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30797 states. [2019-09-08 05:15:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30797 to 30755. [2019-09-08 05:15:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30755 states. [2019-09-08 05:15:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30755 states to 30755 states and 41092 transitions. [2019-09-08 05:15:09,626 INFO L78 Accepts]: Start accepts. Automaton has 30755 states and 41092 transitions. Word has length 355 [2019-09-08 05:15:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:09,627 INFO L475 AbstractCegarLoop]: Abstraction has 30755 states and 41092 transitions. [2019-09-08 05:15:09,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:15:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30755 states and 41092 transitions. [2019-09-08 05:15:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 05:15:09,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:09,702 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:09,702 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1105269833, now seen corresponding path program 1 times [2019-09-08 05:15:09,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:09,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:09,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:09,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-08 05:15:10,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:15:10,011 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:15:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 3986 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:15:10,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:15:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 05:15:10,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:15:10,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 05:15:10,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:15:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:15:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:15:11,000 INFO L87 Difference]: Start difference. First operand 30755 states and 41092 transitions. Second operand 16 states. [2019-09-08 05:15:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:13,812 INFO L93 Difference]: Finished difference Result 60001 states and 80204 transitions. [2019-09-08 05:15:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:15:13,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 469 [2019-09-08 05:15:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:13,893 INFO L225 Difference]: With dead ends: 60001 [2019-09-08 05:15:13,893 INFO L226 Difference]: Without dead ends: 21263 [2019-09-08 05:15:13,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:15:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21263 states. [2019-09-08 05:15:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21263 to 20819. [2019-09-08 05:15:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20819 states. [2019-09-08 05:15:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20819 states to 20819 states and 27651 transitions. [2019-09-08 05:15:14,808 INFO L78 Accepts]: Start accepts. Automaton has 20819 states and 27651 transitions. Word has length 469 [2019-09-08 05:15:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:14,809 INFO L475 AbstractCegarLoop]: Abstraction has 20819 states and 27651 transitions. [2019-09-08 05:15:14,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:15:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20819 states and 27651 transitions. [2019-09-08 05:15:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 05:15:14,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:14,837 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:14,837 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash -849901563, now seen corresponding path program 1 times [2019-09-08 05:15:14,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:14,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:15:15,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:15,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:15:15,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:15:15,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:15:15,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:15:15,053 INFO L87 Difference]: Start difference. First operand 20819 states and 27651 transitions. Second operand 7 states. [2019-09-08 05:15:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:17,704 INFO L93 Difference]: Finished difference Result 69988 states and 93153 transitions. [2019-09-08 05:15:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:15:17,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 357 [2019-09-08 05:15:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:17,935 INFO L225 Difference]: With dead ends: 69988 [2019-09-08 05:15:17,935 INFO L226 Difference]: Without dead ends: 55659 [2019-09-08 05:15:17,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:15:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55659 states. [2019-09-08 05:15:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55659 to 55385. [2019-09-08 05:15:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55385 states. [2019-09-08 05:15:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55385 states to 55385 states and 73624 transitions. [2019-09-08 05:15:21,189 INFO L78 Accepts]: Start accepts. Automaton has 55385 states and 73624 transitions. Word has length 357 [2019-09-08 05:15:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:21,189 INFO L475 AbstractCegarLoop]: Abstraction has 55385 states and 73624 transitions. [2019-09-08 05:15:21,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:15:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 55385 states and 73624 transitions. [2019-09-08 05:15:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 05:15:21,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:21,240 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:21,240 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash 378512420, now seen corresponding path program 1 times [2019-09-08 05:15:21,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:21,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:21,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:21,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:15:21,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:21,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:15:21,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:15:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:15:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:15:21,772 INFO L87 Difference]: Start difference. First operand 55385 states and 73624 transitions. Second operand 7 states. [2019-09-08 05:15:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:25,959 INFO L93 Difference]: Finished difference Result 165720 states and 220873 transitions. [2019-09-08 05:15:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:15:25,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 358 [2019-09-08 05:15:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:26,365 INFO L225 Difference]: With dead ends: 165720 [2019-09-08 05:15:26,365 INFO L226 Difference]: Without dead ends: 118255 [2019-09-08 05:15:26,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:15:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118255 states. [2019-09-08 05:15:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118255 to 114919. [2019-09-08 05:15:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114919 states. [2019-09-08 05:15:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114919 states to 114919 states and 152634 transitions. [2019-09-08 05:15:32,374 INFO L78 Accepts]: Start accepts. Automaton has 114919 states and 152634 transitions. Word has length 358 [2019-09-08 05:15:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:32,375 INFO L475 AbstractCegarLoop]: Abstraction has 114919 states and 152634 transitions. [2019-09-08 05:15:32,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:15:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 114919 states and 152634 transitions. [2019-09-08 05:15:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 05:15:32,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:32,450 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:32,451 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1764962478, now seen corresponding path program 1 times [2019-09-08 05:15:32,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:32,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 05:15:32,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:32,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:15:32,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:15:32,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:15:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:15:32,639 INFO L87 Difference]: Start difference. First operand 114919 states and 152634 transitions. Second operand 3 states. [2019-09-08 05:15:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:36,967 INFO L93 Difference]: Finished difference Result 232502 states and 310039 transitions. [2019-09-08 05:15:36,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:15:36,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-09-08 05:15:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:37,320 INFO L225 Difference]: With dead ends: 232502 [2019-09-08 05:15:37,320 INFO L226 Difference]: Without dead ends: 117667 [2019-09-08 05:15:37,491 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:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117667 states. [2019-09-08 05:15:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117667 to 117639. [2019-09-08 05:15:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117639 states. [2019-09-08 05:15:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117639 states to 117639 states and 157410 transitions. [2019-09-08 05:15:44,096 INFO L78 Accepts]: Start accepts. Automaton has 117639 states and 157410 transitions. Word has length 409 [2019-09-08 05:15:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:44,097 INFO L475 AbstractCegarLoop]: Abstraction has 117639 states and 157410 transitions. [2019-09-08 05:15:44,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:15:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 117639 states and 157410 transitions. [2019-09-08 05:15:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-08 05:15:44,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:44,163 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:44,163 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 770409984, now seen corresponding path program 1 times [2019-09-08 05:15:44,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:15:44,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:44,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:15:44,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:15:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:15:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:15:44,371 INFO L87 Difference]: Start difference. First operand 117639 states and 157410 transitions. Second operand 3 states. [2019-09-08 05:15:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:47,407 INFO L93 Difference]: Finished difference Result 240342 states and 323855 transitions. [2019-09-08 05:15:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:15:47,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-09-08 05:15:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:47,763 INFO L225 Difference]: With dead ends: 240342 [2019-09-08 05:15:47,763 INFO L226 Difference]: Without dead ends: 122787 [2019-09-08 05:15:47,923 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:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122787 states. [2019-09-08 05:15:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122787 to 122759. [2019-09-08 05:15:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122759 states. [2019-09-08 05:15:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122759 states to 122759 states and 166386 transitions. [2019-09-08 05:15:54,928 INFO L78 Accepts]: Start accepts. Automaton has 122759 states and 166386 transitions. Word has length 417 [2019-09-08 05:15:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:54,929 INFO L475 AbstractCegarLoop]: Abstraction has 122759 states and 166386 transitions. [2019-09-08 05:15:54,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:15:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 122759 states and 166386 transitions. [2019-09-08 05:15:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-09-08 05:15:55,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:55,047 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,047 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1582639689, now seen corresponding path program 1 times [2019-09-08 05:15:55,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:55,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:55,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:55,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:55,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 05:15:55,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:55,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:15:55,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:15:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:15:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:15:55,246 INFO L87 Difference]: Start difference. First operand 122759 states and 166386 transitions. Second operand 3 states. [2019-09-08 05:15:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:58,295 INFO L93 Difference]: Finished difference Result 255318 states and 350143 transitions. [2019-09-08 05:15:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:15:58,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 434 [2019-09-08 05:15:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:58,679 INFO L225 Difference]: With dead ends: 255318 [2019-09-08 05:15:58,679 INFO L226 Difference]: Without dead ends: 132643 [2019-09-08 05:15:58,827 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:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132643 states. [2019-09-08 05:16:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132643 to 132615. [2019-09-08 05:16:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132615 states. [2019-09-08 05:16:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132615 states to 132615 states and 183570 transitions. [2019-09-08 05:16:06,475 INFO L78 Accepts]: Start accepts. Automaton has 132615 states and 183570 transitions. Word has length 434 [2019-09-08 05:16:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:06,476 INFO L475 AbstractCegarLoop]: Abstraction has 132615 states and 183570 transitions. [2019-09-08 05:16:06,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:16:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 132615 states and 183570 transitions. [2019-09-08 05:16:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 05:16:06,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:06,591 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:06,592 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:06,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:06,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1065926637, now seen corresponding path program 1 times [2019-09-08 05:16:06,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:06,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:06,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:16:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:16:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:16:06,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:16:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:16:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:16:06,764 INFO L87 Difference]: Start difference. First operand 132615 states and 183570 transitions. Second operand 3 states. [2019-09-08 05:16:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:11,067 INFO L93 Difference]: Finished difference Result 284118 states and 400415 transitions. [2019-09-08 05:16:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:16:11,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 05:16:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:11,504 INFO L225 Difference]: With dead ends: 284118 [2019-09-08 05:16:11,504 INFO L226 Difference]: Without dead ends: 151587 [2019-09-08 05:16:11,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:16:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151587 states. [2019-09-08 05:16:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151587 to 151559. [2019-09-08 05:16:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151559 states. [2019-09-08 05:16:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151559 states to 151559 states and 216402 transitions. [2019-09-08 05:16:21,717 INFO L78 Accepts]: Start accepts. Automaton has 151559 states and 216402 transitions. Word has length 372 [2019-09-08 05:16:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:21,717 INFO L475 AbstractCegarLoop]: Abstraction has 151559 states and 216402 transitions. [2019-09-08 05:16:21,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:16:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 151559 states and 216402 transitions. [2019-09-08 05:16:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-08 05:16:22,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:22,406 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,406 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:22,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2146647113, now seen corresponding path program 1 times [2019-09-08 05:16:22,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:22,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:22,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:22,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:22,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-08 05:16:22,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:16:22,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:16:22,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:16:22,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:16:22,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:16:22,616 INFO L87 Difference]: Start difference. First operand 151559 states and 216402 transitions. Second operand 3 states. [2019-09-08 05:16:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:30,759 INFO L93 Difference]: Finished difference Result 339414 states and 494815 transitions. [2019-09-08 05:16:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:16:30,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2019-09-08 05:16:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:31,560 INFO L225 Difference]: With dead ends: 339414 [2019-09-08 05:16:31,560 INFO L226 Difference]: Without dead ends: 187939 [2019-09-08 05:16:31,732 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:16:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187939 states. [2019-09-08 05:16:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187939 to 187911. [2019-09-08 05:16:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187911 states. [2019-09-08 05:16:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187911 states to 187911 states and 277458 transitions. [2019-09-08 05:16:38,323 INFO L78 Accepts]: Start accepts. Automaton has 187911 states and 277458 transitions. Word has length 438 [2019-09-08 05:16:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:38,324 INFO L475 AbstractCegarLoop]: Abstraction has 187911 states and 277458 transitions. [2019-09-08 05:16:38,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:16:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 187911 states and 277458 transitions. [2019-09-08 05:16:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-08 05:16:38,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:38,621 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:38,621 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:38,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1406614118, now seen corresponding path program 1 times [2019-09-08 05:16:38,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:38,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:38,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:38,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:38,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 05:16:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:16:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:16:38,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:16:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:16:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:16:38,834 INFO L87 Difference]: Start difference. First operand 187911 states and 277458 transitions. Second operand 6 states. [2019-09-08 05:16:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:41,544 INFO L93 Difference]: Finished difference Result 235334 states and 348124 transitions. [2019-09-08 05:16:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:16:41,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 418 [2019-09-08 05:16:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:41,640 INFO L225 Difference]: With dead ends: 235334 [2019-09-08 05:16:41,640 INFO L226 Difference]: Without dead ends: 42819 [2019-09-08 05:16:43,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:16:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42819 states. [2019-09-08 05:16:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42819 to 42807. [2019-09-08 05:16:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42807 states. [2019-09-08 05:16:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42807 states to 42807 states and 62671 transitions. [2019-09-08 05:16:49,302 INFO L78 Accepts]: Start accepts. Automaton has 42807 states and 62671 transitions. Word has length 418 [2019-09-08 05:16:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:49,303 INFO L475 AbstractCegarLoop]: Abstraction has 42807 states and 62671 transitions. [2019-09-08 05:16:49,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:16:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 42807 states and 62671 transitions. [2019-09-08 05:16:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 05:16:49,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:49,373 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:49,373 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:49,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1706267533, now seen corresponding path program 1 times [2019-09-08 05:16:49,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:49,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 05:16:50,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:16:50,105 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:16:50,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:50,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 3567 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:16:50,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:16:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:16:51,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:16:51,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [37] total 44 [2019-09-08 05:16:51,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 05:16:51,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 05:16:51,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 05:16:51,103 INFO L87 Difference]: Start difference. First operand 42807 states and 62671 transitions. Second operand 44 states. [2019-09-08 05:17:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:00,615 INFO L93 Difference]: Finished difference Result 85887 states and 125576 transitions. [2019-09-08 05:17:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 05:17:00,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 373 [2019-09-08 05:17:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:00,697 INFO L225 Difference]: With dead ends: 85887 [2019-09-08 05:17:00,697 INFO L226 Difference]: Without dead ends: 39457 [2019-09-08 05:17:00,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=420, Invalid=8322, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 05:17:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39457 states. [2019-09-08 05:17:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39457 to 39313. [2019-09-08 05:17:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39313 states. [2019-09-08 05:17:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39313 states to 39313 states and 57804 transitions. [2019-09-08 05:17:02,253 INFO L78 Accepts]: Start accepts. Automaton has 39313 states and 57804 transitions. Word has length 373 [2019-09-08 05:17:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:02,253 INFO L475 AbstractCegarLoop]: Abstraction has 39313 states and 57804 transitions. [2019-09-08 05:17:02,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 05:17:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 39313 states and 57804 transitions. [2019-09-08 05:17:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-08 05:17:02,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:02,326 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:02,326 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:02,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1906663751, now seen corresponding path program 1 times [2019-09-08 05:17:02,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:02,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-08 05:17:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:02,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:17:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:17:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:17:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:02,528 INFO L87 Difference]: Start difference. First operand 39313 states and 57804 transitions. Second operand 3 states. [2019-09-08 05:17:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:04,583 INFO L93 Difference]: Finished difference Result 95824 states and 144184 transitions. [2019-09-08 05:17:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:17:04,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 444 [2019-09-08 05:17:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:04,687 INFO L225 Difference]: With dead ends: 95824 [2019-09-08 05:17:04,687 INFO L226 Difference]: Without dead ends: 56605 [2019-09-08 05:17:04,741 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:17:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56605 states. [2019-09-08 05:17:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56605 to 56593. [2019-09-08 05:17:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56593 states. [2019-09-08 05:17:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56593 states to 56593 states and 85964 transitions. [2019-09-08 05:17:07,085 INFO L78 Accepts]: Start accepts. Automaton has 56593 states and 85964 transitions. Word has length 444 [2019-09-08 05:17:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:07,085 INFO L475 AbstractCegarLoop]: Abstraction has 56593 states and 85964 transitions. [2019-09-08 05:17:07,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:17:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 56593 states and 85964 transitions. [2019-09-08 05:17:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 05:17:07,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:07,217 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:07,217 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1474396500, now seen corresponding path program 1 times [2019-09-08 05:17:07,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:07,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:17:07,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:07,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:17:07,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:17:07,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:17:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:17:07,837 INFO L87 Difference]: Start difference. First operand 56593 states and 85964 transitions. Second operand 7 states. [2019-09-08 05:17:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:09,871 INFO L93 Difference]: Finished difference Result 113236 states and 173612 transitions. [2019-09-08 05:17:09,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:17:09,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 428 [2019-09-08 05:17:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:10,008 INFO L225 Difference]: With dead ends: 113236 [2019-09-08 05:17:10,008 INFO L226 Difference]: Without dead ends: 56737 [2019-09-08 05:17:10,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:17:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56737 states. [2019-09-08 05:17:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56737 to 56737. [2019-09-08 05:17:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56737 states. [2019-09-08 05:17:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56737 states to 56737 states and 86140 transitions. [2019-09-08 05:17:13,118 INFO L78 Accepts]: Start accepts. Automaton has 56737 states and 86140 transitions. Word has length 428 [2019-09-08 05:17:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:13,119 INFO L475 AbstractCegarLoop]: Abstraction has 56737 states and 86140 transitions. [2019-09-08 05:17:13,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:17:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 56737 states and 86140 transitions. [2019-09-08 05:17:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-08 05:17:13,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:13,246 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:13,247 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1260466622, now seen corresponding path program 1 times [2019-09-08 05:17:13,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:13,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:13,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 05:17:13,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:17:13,484 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:17:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:14,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 4018 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:17:14,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:17:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 05:17:14,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:17:14,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2019-09-08 05:17:14,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:17:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:17:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:17:14,305 INFO L87 Difference]: Start difference. First operand 56737 states and 86140 transitions. Second operand 20 states. [2019-09-08 05:17:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:23,021 INFO L93 Difference]: Finished difference Result 114894 states and 174165 transitions. [2019-09-08 05:17:23,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:17:23,022 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 447 [2019-09-08 05:17:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:23,168 INFO L225 Difference]: With dead ends: 114894 [2019-09-08 05:17:23,169 INFO L226 Difference]: Without dead ends: 58232 [2019-09-08 05:17:23,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:17:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58232 states. [2019-09-08 05:17:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58232 to 56753. [2019-09-08 05:17:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56753 states. [2019-09-08 05:17:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56753 states to 56753 states and 86075 transitions. [2019-09-08 05:17:25,736 INFO L78 Accepts]: Start accepts. Automaton has 56753 states and 86075 transitions. Word has length 447 [2019-09-08 05:17:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:25,736 INFO L475 AbstractCegarLoop]: Abstraction has 56753 states and 86075 transitions. [2019-09-08 05:17:25,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:17:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 56753 states and 86075 transitions. [2019-09-08 05:17:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-08 05:17:25,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:25,868 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:25,868 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash -901329953, now seen corresponding path program 1 times [2019-09-08 05:17:25,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:25,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:25,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:25,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 05:17:26,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:17:26,086 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:17:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:27,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 3611 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:17:27,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:17:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 05:17:27,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:17:27,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:17:27,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:17:27,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:17:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:17:27,220 INFO L87 Difference]: Start difference. First operand 56753 states and 86075 transitions. Second operand 12 states. [2019-09-08 05:17:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:32,725 INFO L93 Difference]: Finished difference Result 104806 states and 161295 transitions. [2019-09-08 05:17:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:17:32,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 384 [2019-09-08 05:17:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:32,856 INFO L225 Difference]: With dead ends: 104806 [2019-09-08 05:17:32,856 INFO L226 Difference]: Without dead ends: 48092 [2019-09-08 05:17:32,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-09-08 05:17:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48092 states. [2019-09-08 05:17:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48092 to 48011. [2019-09-08 05:17:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-09-08 05:17:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 75087 transitions. [2019-09-08 05:17:35,070 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 75087 transitions. Word has length 384 [2019-09-08 05:17:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:35,070 INFO L475 AbstractCegarLoop]: Abstraction has 48011 states and 75087 transitions. [2019-09-08 05:17:35,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:17:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 75087 transitions. [2019-09-08 05:17:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-08 05:17:35,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:35,190 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:35,191 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1392415232, now seen corresponding path program 2 times [2019-09-08 05:17:35,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:17:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:17:35,485 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:17:35,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:17:36,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:17:36,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:17:36,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 3612 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 05:17:36,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:17:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-08 05:17:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:17:36,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2019-09-08 05:17:36,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:17:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:17:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:17:36,835 INFO L87 Difference]: Start difference. First operand 48011 states and 75087 transitions. Second operand 25 states. [2019-09-08 05:17:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:57,559 INFO L93 Difference]: Finished difference Result 76976 states and 119963 transitions. [2019-09-08 05:17:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 05:17:57,559 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 385 [2019-09-08 05:17:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:57,728 INFO L225 Difference]: With dead ends: 76976 [2019-09-08 05:17:57,728 INFO L226 Difference]: Without dead ends: 74606 [2019-09-08 05:17:57,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=599, Invalid=7591, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 05:17:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74606 states. [2019-09-08 05:18:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74606 to 71722. [2019-09-08 05:18:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71722 states. [2019-09-08 05:18:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71722 states to 71722 states and 113021 transitions. [2019-09-08 05:18:01,077 INFO L78 Accepts]: Start accepts. Automaton has 71722 states and 113021 transitions. Word has length 385 [2019-09-08 05:18:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:01,078 INFO L475 AbstractCegarLoop]: Abstraction has 71722 states and 113021 transitions. [2019-09-08 05:18:01,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:18:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 71722 states and 113021 transitions. [2019-09-08 05:18:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 05:18:01,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:01,289 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:01,290 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1069335211, now seen corresponding path program 1 times [2019-09-08 05:18:01,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:01,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:01,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:18:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:18:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:01,971 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:18:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:02,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 3615 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:18:02,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:18:02,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:02,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:18:02,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:18:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:18:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:18:02,641 INFO L87 Difference]: Start difference. First operand 71722 states and 113021 transitions. Second operand 12 states. [2019-09-08 05:18:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:06,235 INFO L93 Difference]: Finished difference Result 99069 states and 155082 transitions. [2019-09-08 05:18:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:18:06,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 388 [2019-09-08 05:18:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:06,359 INFO L225 Difference]: With dead ends: 99069 [2019-09-08 05:18:06,359 INFO L226 Difference]: Without dead ends: 52165 [2019-09-08 05:18:06,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:18:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52165 states. [2019-09-08 05:18:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52165 to 52115. [2019-09-08 05:18:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52115 states. [2019-09-08 05:18:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52115 states to 52115 states and 80949 transitions. [2019-09-08 05:18:08,957 INFO L78 Accepts]: Start accepts. Automaton has 52115 states and 80949 transitions. Word has length 388 [2019-09-08 05:18:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:08,957 INFO L475 AbstractCegarLoop]: Abstraction has 52115 states and 80949 transitions. [2019-09-08 05:18:08,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:18:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 52115 states and 80949 transitions. [2019-09-08 05:18:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 05:18:09,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:09,076 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:09,076 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1507779198, now seen corresponding path program 1 times [2019-09-08 05:18:09,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:09,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:18:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:18:09,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:18:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:18:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:18:09,361 INFO L87 Difference]: Start difference. First operand 52115 states and 80949 transitions. Second operand 18 states. [2019-09-08 05:18:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:12,523 INFO L93 Difference]: Finished difference Result 54493 states and 83951 transitions. [2019-09-08 05:18:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:18:12,524 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 388 [2019-09-08 05:18:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:12,650 INFO L225 Difference]: With dead ends: 54493 [2019-09-08 05:18:12,650 INFO L226 Difference]: Without dead ends: 52270 [2019-09-08 05:18:12,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:18:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52270 states. [2019-09-08 05:18:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52270 to 52083. [2019-09-08 05:18:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52083 states. [2019-09-08 05:18:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52083 states to 52083 states and 80903 transitions. [2019-09-08 05:18:15,444 INFO L78 Accepts]: Start accepts. Automaton has 52083 states and 80903 transitions. Word has length 388 [2019-09-08 05:18:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:15,444 INFO L475 AbstractCegarLoop]: Abstraction has 52083 states and 80903 transitions. [2019-09-08 05:18:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:18:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 52083 states and 80903 transitions. [2019-09-08 05:18:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 05:18:15,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:15,555 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:15,555 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1804583857, now seen corresponding path program 1 times [2019-09-08 05:18:15,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:15,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:18:15,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:15,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:18:15,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:18:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:18:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:18:15,890 INFO L87 Difference]: Start difference. First operand 52083 states and 80903 transitions. Second operand 20 states. [2019-09-08 05:18:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:19,159 INFO L93 Difference]: Finished difference Result 54477 states and 83930 transitions. [2019-09-08 05:18:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:18:19,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 389 [2019-09-08 05:18:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:19,273 INFO L225 Difference]: With dead ends: 54477 [2019-09-08 05:18:19,273 INFO L226 Difference]: Without dead ends: 52354 [2019-09-08 05:18:19,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:18:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52354 states. [2019-09-08 05:18:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52354 to 52091. [2019-09-08 05:18:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52091 states. [2019-09-08 05:18:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52091 states to 52091 states and 80905 transitions. [2019-09-08 05:18:21,645 INFO L78 Accepts]: Start accepts. Automaton has 52091 states and 80905 transitions. Word has length 389 [2019-09-08 05:18:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:21,646 INFO L475 AbstractCegarLoop]: Abstraction has 52091 states and 80905 transitions. [2019-09-08 05:18:21,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:18:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 52091 states and 80905 transitions. [2019-09-08 05:18:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 05:18:21,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:21,760 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:21,760 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:21,760 INFO L82 PathProgramCache]: Analyzing trace with hash 146365689, now seen corresponding path program 1 times [2019-09-08 05:18:21,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:21,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:21,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 05:18:21,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:21,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:18:21,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:18:21,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:18:21,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:18:21,963 INFO L87 Difference]: Start difference. First operand 52091 states and 80905 transitions. Second operand 8 states. [2019-09-08 05:18:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:24,373 INFO L93 Difference]: Finished difference Result 54957 states and 84537 transitions. [2019-09-08 05:18:24,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:18:24,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 390 [2019-09-08 05:18:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:24,498 INFO L225 Difference]: With dead ends: 54957 [2019-09-08 05:18:24,498 INFO L226 Difference]: Without dead ends: 54946 [2019-09-08 05:18:24,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:18:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54946 states. [2019-09-08 05:18:27,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54946 to 53391. [2019-09-08 05:18:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53391 states. [2019-09-08 05:18:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53391 states to 53391 states and 82555 transitions. [2019-09-08 05:18:27,340 INFO L78 Accepts]: Start accepts. Automaton has 53391 states and 82555 transitions. Word has length 390 [2019-09-08 05:18:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:27,340 INFO L475 AbstractCegarLoop]: Abstraction has 53391 states and 82555 transitions. [2019-09-08 05:18:27,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:18:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 53391 states and 82555 transitions. [2019-09-08 05:18:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 05:18:27,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:27,449 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,449 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1049895353, now seen corresponding path program 2 times [2019-09-08 05:18:27,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 05:18:27,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:27,658 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:18:27,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:18:27,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:18:27,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:18:27,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 2124 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:18:28,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 05:18:28,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:28,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-09-08 05:18:28,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:18:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:18:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:18:28,240 INFO L87 Difference]: Start difference. First operand 53391 states and 82555 transitions. Second operand 18 states. [2019-09-08 05:18:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:36,337 INFO L93 Difference]: Finished difference Result 113582 states and 175997 transitions. [2019-09-08 05:18:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 05:18:36,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 390 [2019-09-08 05:18:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:36,623 INFO L225 Difference]: With dead ends: 113582 [2019-09-08 05:18:36,623 INFO L226 Difference]: Without dead ends: 107154 [2019-09-08 05:18:36,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=2514, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 05:18:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107154 states. [2019-09-08 05:18:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107154 to 104761. [2019-09-08 05:18:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104761 states. [2019-09-08 05:18:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104761 states to 104761 states and 164544 transitions. [2019-09-08 05:18:42,850 INFO L78 Accepts]: Start accepts. Automaton has 104761 states and 164544 transitions. Word has length 390 [2019-09-08 05:18:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:42,850 INFO L475 AbstractCegarLoop]: Abstraction has 104761 states and 164544 transitions. [2019-09-08 05:18:42,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:18:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 104761 states and 164544 transitions. [2019-09-08 05:18:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 05:18:43,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:43,156 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:43,156 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2036770803, now seen corresponding path program 1 times [2019-09-08 05:18:43,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:43,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:43,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:18:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:18:43,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:43,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:18:43,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:18:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:18:43,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:18:43,548 INFO L87 Difference]: Start difference. First operand 104761 states and 164544 transitions. Second operand 24 states. [2019-09-08 05:18:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:49,139 INFO L93 Difference]: Finished difference Result 107165 states and 167571 transitions. [2019-09-08 05:18:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:18:49,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 391 [2019-09-08 05:18:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:49,375 INFO L225 Difference]: With dead ends: 107165 [2019-09-08 05:18:49,376 INFO L226 Difference]: Without dead ends: 99209 [2019-09-08 05:18:49,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=2096, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:18:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99209 states. [2019-09-08 05:18:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99209 to 96323. [2019-09-08 05:18:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96323 states. [2019-09-08 05:18:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96323 states to 96323 states and 153289 transitions. [2019-09-08 05:18:55,392 INFO L78 Accepts]: Start accepts. Automaton has 96323 states and 153289 transitions. Word has length 391 [2019-09-08 05:18:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:55,392 INFO L475 AbstractCegarLoop]: Abstraction has 96323 states and 153289 transitions. [2019-09-08 05:18:55,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:18:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 96323 states and 153289 transitions. [2019-09-08 05:18:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 05:18:55,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:55,674 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:55,675 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1612451717, now seen corresponding path program 1 times [2019-09-08 05:18:55,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:55,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:18:55,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:55,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:18:55,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:56,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 3619 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:18:56,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 05:18:56,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:18:56,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-09-08 05:18:56,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:18:56,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:18:56,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:18:56,604 INFO L87 Difference]: Start difference. First operand 96323 states and 153289 transitions. Second operand 20 states. [2019-09-08 05:19:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:02,504 INFO L93 Difference]: Finished difference Result 102382 states and 160655 transitions. [2019-09-08 05:19:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:19:02,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 392 [2019-09-08 05:19:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:02,728 INFO L225 Difference]: With dead ends: 102382 [2019-09-08 05:19:02,729 INFO L226 Difference]: Without dead ends: 94987 [2019-09-08 05:19:02,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:19:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94987 states. [2019-09-08 05:19:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94987 to 94557. [2019-09-08 05:19:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94557 states. [2019-09-08 05:19:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94557 states to 94557 states and 151099 transitions. [2019-09-08 05:19:09,253 INFO L78 Accepts]: Start accepts. Automaton has 94557 states and 151099 transitions. Word has length 392 [2019-09-08 05:19:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:09,254 INFO L475 AbstractCegarLoop]: Abstraction has 94557 states and 151099 transitions. [2019-09-08 05:19:09,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:19:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94557 states and 151099 transitions. [2019-09-08 05:19:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 05:19:09,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:09,556 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,557 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash 596287046, now seen corresponding path program 1 times [2019-09-08 05:19:09,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:19:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:19:09,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:19:09,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:19:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 3634 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:19:10,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:19:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 05:19:10,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:19:10,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:19:10,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:19:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:19:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:19:10,592 INFO L87 Difference]: Start difference. First operand 94557 states and 151099 transitions. Second operand 23 states. [2019-09-08 05:19:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:17,345 INFO L93 Difference]: Finished difference Result 142498 states and 226763 transitions. [2019-09-08 05:19:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:19:17,345 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 399 [2019-09-08 05:19:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:17,451 INFO L225 Difference]: With dead ends: 142498 [2019-09-08 05:19:17,452 INFO L226 Difference]: Without dead ends: 47887 [2019-09-08 05:19:17,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 05:19:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47887 states. [2019-09-08 05:19:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47887 to 47708. [2019-09-08 05:19:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47708 states. [2019-09-08 05:19:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47708 states to 47708 states and 75403 transitions. [2019-09-08 05:19:20,656 INFO L78 Accepts]: Start accepts. Automaton has 47708 states and 75403 transitions. Word has length 399 [2019-09-08 05:19:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:20,657 INFO L475 AbstractCegarLoop]: Abstraction has 47708 states and 75403 transitions. [2019-09-08 05:19:20,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:19:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47708 states and 75403 transitions. [2019-09-08 05:19:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-08 05:19:20,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:20,764 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:20,764 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -382483496, now seen corresponding path program 1 times [2019-09-08 05:19:20,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:20,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:20,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:20,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:20,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 05:19:21,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:21,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:19:21,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:19:21,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:19:21,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:19:21,053 INFO L87 Difference]: Start difference. First operand 47708 states and 75403 transitions. Second operand 18 states. [2019-09-08 05:19:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:24,515 INFO L93 Difference]: Finished difference Result 49444 states and 77594 transitions. [2019-09-08 05:19:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:19:24,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 400 [2019-09-08 05:19:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:24,607 INFO L225 Difference]: With dead ends: 49444 [2019-09-08 05:19:24,608 INFO L226 Difference]: Without dead ends: 47837 [2019-09-08 05:19:24,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:19:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47837 states. [2019-09-08 05:19:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47837 to 47708. [2019-09-08 05:19:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47708 states. [2019-09-08 05:19:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47708 states to 47708 states and 75394 transitions. [2019-09-08 05:19:26,836 INFO L78 Accepts]: Start accepts. Automaton has 47708 states and 75394 transitions. Word has length 400 [2019-09-08 05:19:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:26,836 INFO L475 AbstractCegarLoop]: Abstraction has 47708 states and 75394 transitions. [2019-09-08 05:19:26,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:19:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 47708 states and 75394 transitions. [2019-09-08 05:19:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-09-08 05:19:27,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:27,370 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,370 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1873133319, now seen corresponding path program 1 times [2019-09-08 05:19:27,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:27,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:27,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:27,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:27,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 05:19:27,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:27,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:19:27,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:19:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:19:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:19:27,693 INFO L87 Difference]: Start difference. First operand 47708 states and 75394 transitions. Second operand 20 states. [2019-09-08 05:19:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:30,987 INFO L93 Difference]: Finished difference Result 49388 states and 77505 transitions. [2019-09-08 05:19:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:19:30,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 401 [2019-09-08 05:19:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:31,085 INFO L225 Difference]: With dead ends: 49388 [2019-09-08 05:19:31,086 INFO L226 Difference]: Without dead ends: 47889 [2019-09-08 05:19:31,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:19:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47889 states. [2019-09-08 05:19:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47889 to 47710. [2019-09-08 05:19:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47710 states. [2019-09-08 05:19:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47710 states to 47710 states and 75392 transitions. [2019-09-08 05:19:33,724 INFO L78 Accepts]: Start accepts. Automaton has 47710 states and 75392 transitions. Word has length 401 [2019-09-08 05:19:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:33,724 INFO L475 AbstractCegarLoop]: Abstraction has 47710 states and 75392 transitions. [2019-09-08 05:19:33,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:19:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47710 states and 75392 transitions. [2019-09-08 05:19:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 05:19:33,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:33,831 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:33,831 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1763254339, now seen corresponding path program 1 times [2019-09-08 05:19:33,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:33,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:33,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 05:19:34,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:34,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:19:34,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:19:34,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:19:34,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:19:34,227 INFO L87 Difference]: Start difference. First operand 47710 states and 75392 transitions. Second operand 24 states. [2019-09-08 05:19:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:37,717 INFO L93 Difference]: Finished difference Result 49336 states and 77454 transitions. [2019-09-08 05:19:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:19:37,718 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 402 [2019-09-08 05:19:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:37,818 INFO L225 Difference]: With dead ends: 49336 [2019-09-08 05:19:37,818 INFO L226 Difference]: Without dead ends: 47829 [2019-09-08 05:19:37,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 05:19:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47829 states. [2019-09-08 05:19:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47829 to 47704. [2019-09-08 05:19:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47704 states. [2019-09-08 05:19:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47704 states to 47704 states and 75379 transitions. [2019-09-08 05:19:40,352 INFO L78 Accepts]: Start accepts. Automaton has 47704 states and 75379 transitions. Word has length 402 [2019-09-08 05:19:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:40,352 INFO L475 AbstractCegarLoop]: Abstraction has 47704 states and 75379 transitions. [2019-09-08 05:19:40,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:19:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47704 states and 75379 transitions. [2019-09-08 05:19:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 05:19:40,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:40,457 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:40,458 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1326875217, now seen corresponding path program 1 times [2019-09-08 05:19:40,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:40,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:40,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:40,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 05:19:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:40,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:19:40,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:19:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:19:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:19:40,643 INFO L87 Difference]: Start difference. First operand 47704 states and 75379 transitions. Second operand 8 states. [2019-09-08 05:19:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:43,046 INFO L93 Difference]: Finished difference Result 48551 states and 76447 transitions. [2019-09-08 05:19:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:19:43,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 403 [2019-09-08 05:19:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:43,154 INFO L225 Difference]: With dead ends: 48551 [2019-09-08 05:19:43,154 INFO L226 Difference]: Without dead ends: 48544 [2019-09-08 05:19:43,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:19:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48544 states. [2019-09-08 05:19:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48544 to 47804. [2019-09-08 05:19:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47804 states. [2019-09-08 05:19:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47804 states to 47804 states and 75503 transitions. [2019-09-08 05:19:45,783 INFO L78 Accepts]: Start accepts. Automaton has 47804 states and 75503 transitions. Word has length 403 [2019-09-08 05:19:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:45,784 INFO L475 AbstractCegarLoop]: Abstraction has 47804 states and 75503 transitions. [2019-09-08 05:19:45,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:19:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 47804 states and 75503 transitions. [2019-09-08 05:19:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 05:19:45,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:45,894 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:45,894 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -439371536, now seen corresponding path program 1 times [2019-09-08 05:19:45,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:45,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:45,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 05:19:46,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:46,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:19:46,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:19:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:19:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:19:46,268 INFO L87 Difference]: Start difference. First operand 47804 states and 75503 transitions. Second operand 24 states. [2019-09-08 05:19:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:49,893 INFO L93 Difference]: Finished difference Result 48928 states and 76930 transitions. [2019-09-08 05:19:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:19:49,893 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 403 [2019-09-08 05:19:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:49,987 INFO L225 Difference]: With dead ends: 48928 [2019-09-08 05:19:49,987 INFO L226 Difference]: Without dead ends: 45757 [2019-09-08 05:19:50,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=2096, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:19:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45757 states. [2019-09-08 05:19:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45757 to 44080. [2019-09-08 05:19:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44080 states. [2019-09-08 05:19:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44080 states to 44080 states and 70885 transitions. [2019-09-08 05:19:52,061 INFO L78 Accepts]: Start accepts. Automaton has 44080 states and 70885 transitions. Word has length 403 [2019-09-08 05:19:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:52,061 INFO L475 AbstractCegarLoop]: Abstraction has 44080 states and 70885 transitions. [2019-09-08 05:19:52,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:19:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 44080 states and 70885 transitions. [2019-09-08 05:19:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 05:19:52,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:52,168 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:52,168 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1892723391, now seen corresponding path program 1 times [2019-09-08 05:19:52,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:52,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:52,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:52,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:52,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:19:52,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:19:52,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:19:52,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:19:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:52,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 3651 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:19:52,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:19:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-08 05:19:53,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:19:53,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-08 05:19:53,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:19:53,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:19:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:19:53,391 INFO L87 Difference]: Start difference. First operand 44080 states and 70885 transitions. Second operand 15 states. [2019-09-08 05:19:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:57,571 INFO L93 Difference]: Finished difference Result 50157 states and 78788 transitions. [2019-09-08 05:19:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 05:19:57,572 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 404 [2019-09-08 05:19:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:57,661 INFO L225 Difference]: With dead ends: 50157 [2019-09-08 05:19:57,662 INFO L226 Difference]: Without dead ends: 45169 [2019-09-08 05:19:57,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:19:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45169 states. [2019-09-08 05:19:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45169 to 44533. [2019-09-08 05:19:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44533 states. [2019-09-08 05:19:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44533 states to 44533 states and 71527 transitions. [2019-09-08 05:19:59,821 INFO L78 Accepts]: Start accepts. Automaton has 44533 states and 71527 transitions. Word has length 404 [2019-09-08 05:19:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:59,821 INFO L475 AbstractCegarLoop]: Abstraction has 44533 states and 71527 transitions. [2019-09-08 05:19:59,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:19:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 44533 states and 71527 transitions. [2019-09-08 05:19:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 05:19:59,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:59,926 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:59,926 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:59,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1457912693, now seen corresponding path program 1 times [2019-09-08 05:19:59,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:59,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:59,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 05:20:00,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:00,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:20:00,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:20:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:20:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:20:00,068 INFO L87 Difference]: Start difference. First operand 44533 states and 71527 transitions. Second operand 6 states. [2019-09-08 05:20:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:01,918 INFO L93 Difference]: Finished difference Result 88576 states and 142367 transitions. [2019-09-08 05:20:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:20:01,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 411 [2019-09-08 05:20:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:02,016 INFO L225 Difference]: With dead ends: 88576 [2019-09-08 05:20:02,017 INFO L226 Difference]: Without dead ends: 44539 [2019-09-08 05:20:02,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:20:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44539 states. [2019-09-08 05:20:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44539 to 44533. [2019-09-08 05:20:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44533 states. [2019-09-08 05:20:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44533 states to 44533 states and 71014 transitions. [2019-09-08 05:20:04,260 INFO L78 Accepts]: Start accepts. Automaton has 44533 states and 71014 transitions. Word has length 411 [2019-09-08 05:20:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:04,260 INFO L475 AbstractCegarLoop]: Abstraction has 44533 states and 71014 transitions. [2019-09-08 05:20:04,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:20:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 44533 states and 71014 transitions. [2019-09-08 05:20:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 05:20:04,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:04,364 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:04,364 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1503456686, now seen corresponding path program 1 times [2019-09-08 05:20:04,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:04,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:04,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-08 05:20:04,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:20:04,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:20:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:05,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 3729 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:20:05,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:20:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-08 05:20:05,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:20:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2019-09-08 05:20:05,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:20:05,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:20:05,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:20:05,536 INFO L87 Difference]: Start difference. First operand 44533 states and 71014 transitions. Second operand 16 states. [2019-09-08 05:20:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:07,513 INFO L93 Difference]: Finished difference Result 53326 states and 83164 transitions. [2019-09-08 05:20:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:20:07,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 421 [2019-09-08 05:20:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:07,601 INFO L225 Difference]: With dead ends: 53326 [2019-09-08 05:20:07,602 INFO L226 Difference]: Without dead ends: 46886 [2019-09-08 05:20:07,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:20:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46886 states. [2019-09-08 05:20:09,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46886 to 45488. [2019-09-08 05:20:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45488 states. [2019-09-08 05:20:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45488 states to 45488 states and 72912 transitions. [2019-09-08 05:20:09,885 INFO L78 Accepts]: Start accepts. Automaton has 45488 states and 72912 transitions. Word has length 421 [2019-09-08 05:20:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:09,886 INFO L475 AbstractCegarLoop]: Abstraction has 45488 states and 72912 transitions. [2019-09-08 05:20:09,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:20:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 45488 states and 72912 transitions. [2019-09-08 05:20:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-08 05:20:09,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:09,997 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:09,997 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1931262391, now seen corresponding path program 1 times [2019-09-08 05:20:09,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:09,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:20:10,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:10,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:10,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:10,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:10,205 INFO L87 Difference]: Start difference. First operand 45488 states and 72912 transitions. Second operand 3 states. [2019-09-08 05:20:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:13,789 INFO L93 Difference]: Finished difference Result 122615 states and 198086 transitions. [2019-09-08 05:20:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:13,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-09-08 05:20:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:13,959 INFO L225 Difference]: With dead ends: 122615 [2019-09-08 05:20:13,959 INFO L226 Difference]: Without dead ends: 79009 [2019-09-08 05:20:14,025 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:20:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79009 states. [2019-09-08 05:20:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79009 to 79003. [2019-09-08 05:20:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79003 states. [2019-09-08 05:20:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79003 states to 79003 states and 126841 transitions. [2019-09-08 05:20:18,461 INFO L78 Accepts]: Start accepts. Automaton has 79003 states and 126841 transitions. Word has length 417 [2019-09-08 05:20:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:18,462 INFO L475 AbstractCegarLoop]: Abstraction has 79003 states and 126841 transitions. [2019-09-08 05:20:18,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79003 states and 126841 transitions. [2019-09-08 05:20:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-08 05:20:18,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:18,696 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:18,696 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:18,696 INFO L82 PathProgramCache]: Analyzing trace with hash -265330289, now seen corresponding path program 1 times [2019-09-08 05:20:18,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:18,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:18,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:18,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:20:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:18,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:18,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:18,834 INFO L87 Difference]: Start difference. First operand 79003 states and 126841 transitions. Second operand 3 states. [2019-09-08 05:20:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:27,172 INFO L93 Difference]: Finished difference Result 219163 states and 353941 transitions. [2019-09-08 05:20:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:27,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-09-08 05:20:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:27,487 INFO L225 Difference]: With dead ends: 219163 [2019-09-08 05:20:27,487 INFO L226 Difference]: Without dead ends: 142453 [2019-09-08 05:20:27,596 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:20:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142453 states. [2019-09-08 05:20:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142453 to 142447. [2019-09-08 05:20:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142447 states. [2019-09-08 05:20:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142447 states to 142447 states and 228322 transitions. [2019-09-08 05:20:42,280 INFO L78 Accepts]: Start accepts. Automaton has 142447 states and 228322 transitions. Word has length 418 [2019-09-08 05:20:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:42,280 INFO L475 AbstractCegarLoop]: Abstraction has 142447 states and 228322 transitions. [2019-09-08 05:20:42,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 142447 states and 228322 transitions. [2019-09-08 05:20:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-08 05:20:42,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:42,720 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:42,720 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1542405545, now seen corresponding path program 1 times [2019-09-08 05:20:42,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:42,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:20:42,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:42,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:42,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:42,878 INFO L87 Difference]: Start difference. First operand 142447 states and 228322 transitions. Second operand 3 states. [2019-09-08 05:20:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:58,803 INFO L93 Difference]: Finished difference Result 402056 states and 642205 transitions. [2019-09-08 05:20:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:58,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2019-09-08 05:20:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:59,451 INFO L225 Difference]: With dead ends: 402056 [2019-09-08 05:20:59,451 INFO L226 Difference]: Without dead ends: 262889 [2019-09-08 05:20:59,623 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:20:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262889 states. [2019-09-08 05:21:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262889 to 262883. [2019-09-08 05:21:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262883 states. [2019-09-08 05:21:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262883 states to 262883 states and 414513 transitions. [2019-09-08 05:21:21,614 INFO L78 Accepts]: Start accepts. Automaton has 262883 states and 414513 transitions. Word has length 419 [2019-09-08 05:21:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:21,615 INFO L475 AbstractCegarLoop]: Abstraction has 262883 states and 414513 transitions. [2019-09-08 05:21:21,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 262883 states and 414513 transitions. [2019-09-08 05:21:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-08 05:21:23,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:23,489 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:23,489 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash -321636113, now seen corresponding path program 1 times [2019-09-08 05:21:23,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:23,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:23,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:21:23,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:23,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:23,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:23,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:23,650 INFO L87 Difference]: Start difference. First operand 262883 states and 414513 transitions. Second operand 3 states. [2019-09-08 05:21:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:50,272 INFO L93 Difference]: Finished difference Result 481530 states and 760990 transitions. [2019-09-08 05:21:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:50,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-09-08 05:21:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:51,467 INFO L225 Difference]: With dead ends: 481530 [2019-09-08 05:21:51,467 INFO L226 Difference]: Without dead ends: 478058 [2019-09-08 05:21:51,569 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:21:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478058 states. [2019-09-08 05:22:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478058 to 476003. [2019-09-08 05:22:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476003 states. [2019-09-08 05:22:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476003 states to 476003 states and 748460 transitions. [2019-09-08 05:22:37,830 INFO L78 Accepts]: Start accepts. Automaton has 476003 states and 748460 transitions. Word has length 420 [2019-09-08 05:22:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:37,831 INFO L475 AbstractCegarLoop]: Abstraction has 476003 states and 748460 transitions. [2019-09-08 05:22:37,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 476003 states and 748460 transitions. [2019-09-08 05:22:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 05:22:39,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:39,688 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:39,688 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1153796855, now seen corresponding path program 1 times [2019-09-08 05:22:39,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:39,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:39,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 05:22:40,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:22:40,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:22:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:40,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 3721 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 05:22:40,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:22:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:22:40,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:22:40,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-09-08 05:22:40,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 05:22:40,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 05:22:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1315, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:22:40,976 INFO L87 Difference]: Start difference. First operand 476003 states and 748460 transitions. Second operand 38 states. [2019-09-08 05:23:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:12,468 INFO L93 Difference]: Finished difference Result 479370 states and 753094 transitions. [2019-09-08 05:23:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 05:23:12,469 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 421 [2019-09-08 05:23:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:13,688 INFO L225 Difference]: With dead ends: 479370 [2019-09-08 05:23:13,688 INFO L226 Difference]: Without dead ends: 476405 [2019-09-08 05:23:13,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=2575, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 05:23:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476405 states. [2019-09-08 05:23:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476405 to 476159. [2019-09-08 05:23:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476159 states. [2019-09-08 05:23:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476159 states to 476159 states and 748673 transitions. [2019-09-08 05:23:55,843 INFO L78 Accepts]: Start accepts. Automaton has 476159 states and 748673 transitions. Word has length 421 [2019-09-08 05:23:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:55,844 INFO L475 AbstractCegarLoop]: Abstraction has 476159 states and 748673 transitions. [2019-09-08 05:23:55,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 05:23:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 476159 states and 748673 transitions. [2019-09-08 05:24:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-09-08 05:24:08,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:08,486 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:08,486 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 909321463, now seen corresponding path program 1 times [2019-09-08 05:24:08,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 05:24:09,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:24:09,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:24:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:24:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:09,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 3767 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 05:24:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:24:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 5 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:24:11,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:24:11,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21] total 49 [2019-09-08 05:24:11,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 05:24:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 05:24:11,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2234, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 05:24:11,766 INFO L87 Difference]: Start difference. First operand 476159 states and 748673 transitions. Second operand 49 states. [2019-09-08 05:25:20,732 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19