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_spec0_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:42:37,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:42:37,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:42:37,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:42:37,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:42:37,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:42:37,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:42:37,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:42:37,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:42:37,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:42:37,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:42:37,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:42:37,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:42:37,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:42:37,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:42:37,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:42:37,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:42:37,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:42:37,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:42:37,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:42:37,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:42:37,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:42:37,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:42:37,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:42:37,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:42:37,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:42:37,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:42:37,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:42:37,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:42:37,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:42:37,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:42:37,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:42:37,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:42:37,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:42:37,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:42:37,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:42:37,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:42:37,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:42:37,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:42:37,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:42:37,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:42:37,372 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-10-02 12:42:37,386 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:42:37,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:42:37,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:42:37,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:42:37,388 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:42:37,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:42:37,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:42:37,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:42:37,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:42:37,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:42:37,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:42:37,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:42:37,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:42:37,390 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:42:37,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:42:37,390 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:42:37,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:42:37,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:42:37,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:42:37,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:42:37,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:42:37,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:42:37,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:42:37,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:42:37,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:42:37,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:42:37,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:42:37,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:42:37,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:42:37,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:42:37,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:42:37,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:42:37,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:42:37,449 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:42:37,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c [2019-10-02 12:42:37,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47aa1ef56/77560f2894a04c0f9bd157373cb934e8/FLAG45affcad7 [2019-10-02 12:42:38,175 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:42:38,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product31.cil.c [2019-10-02 12:42:38,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47aa1ef56/77560f2894a04c0f9bd157373cb934e8/FLAG45affcad7 [2019-10-02 12:42:38,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47aa1ef56/77560f2894a04c0f9bd157373cb934e8 [2019-10-02 12:42:38,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:42:38,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:42:38,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:42:38,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:42:38,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:42:38,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:42:38" (1/1) ... [2019-10-02 12:42:38,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174a7eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:38, skipping insertion in model container [2019-10-02 12:42:38,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:42:38" (1/1) ... [2019-10-02 12:42:38,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:42:38,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:42:39,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:42:39,247 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:42:39,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:42:39,557 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:42:39,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39 WrapperNode [2019-10-02 12:42:39,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:42:39,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:42:39,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:42:39,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:42:39,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... [2019-10-02 12:42:39,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:42:39,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:42:39,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:42:39,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:42:39,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:42:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:42:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:42:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:42:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:42:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:42:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:42:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:42:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:42:39,867 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:42:39,867 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:42:39,867 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:42:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:42:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:42:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:42:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:42:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:42:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:42:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:42:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:42:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:42:39,870 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:42:39,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:42:39,872 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:42:39,872 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:42:39,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:42:39,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:42:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:42:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:42:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:42:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:42:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:42:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:42:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:42:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:42:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:42:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:42:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:42:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:42:39,875 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:42:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:42:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:42:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:42:39,876 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:42:39,877 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:42:39,877 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:42:39,877 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:42:39,877 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:42:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:42:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:42:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:42:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:42:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:42:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:42:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 12:42:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:42:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:42:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:42:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:42:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:42:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:42:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:42:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:42:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:42:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:42:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:42:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:42:39,883 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:42:39,883 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:42:39,884 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:42:39,884 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:42:39,884 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:42:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:42:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:42:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:42:39,886 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:42:39,886 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:42:39,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:42:39,887 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:42:39,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:42:39,887 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:42:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:42:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:42:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:42:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:42:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:42:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:42:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:42:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:42:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:42:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:42:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:42:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:42:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:42:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:42:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:42:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:42:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:42:39,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:42:39,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:42:39,895 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:42:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:42:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:42:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:42:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:42:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:42:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:42:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:42:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:42:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:42:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:42:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:42:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:42:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:42:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:42:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:42:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:42:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:42:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:42:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:42:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:42:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:42:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:42:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:42:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:42:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:42:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:42:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:42:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:42:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:42:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:42:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:42:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:42:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:42:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:42:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:42:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:42:39,921 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:42:39,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:42:39,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:42:39,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:42:39,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:42:39,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:42:39,923 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:42:39,923 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:42:39,924 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:42:39,924 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:42:39,924 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:42:39,924 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:42:39,925 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:42:39,925 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:42:39,925 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:42:39,925 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:42:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:42:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:42:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:42:39,926 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:42:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:42:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:42:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:42:39,928 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:42:39,928 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:42:39,928 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:42:39,928 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:42:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:42:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:42:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:42:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:42:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:42:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:42:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:42:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:42:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:42:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:42:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:42:39,931 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:42:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:42:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:42:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:42:39,932 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:42:39,933 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:42:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:42:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:42:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:42:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:42:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:42:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:42:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:42:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:42:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:42:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:42:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:42:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:42:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:42:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:42:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:42:39,939 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:42:39,939 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:42:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:42:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:42:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:42:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 12:42:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:42:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:42:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:42:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:42:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:42:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:42:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:42:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:42:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:42:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:42:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:42:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:42:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:42:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:42:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:42:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:42:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 12:42:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 12:42:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:42:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:42:39,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:42:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:42:39,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:42:42,103 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:42:42,104 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:42:42,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:42 BoogieIcfgContainer [2019-10-02 12:42:42,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:42:42,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:42:42,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:42:42,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:42:42,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:42:38" (1/3) ... [2019-10-02 12:42:42,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea5d42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:42, skipping insertion in model container [2019-10-02 12:42:42,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:39" (2/3) ... [2019-10-02 12:42:42,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea5d42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:42, skipping insertion in model container [2019-10-02 12:42:42,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:42" (3/3) ... [2019-10-02 12:42:42,114 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product31.cil.c [2019-10-02 12:42:42,124 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:42:42,134 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:42:42,154 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:42:42,190 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:42:42,191 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:42:42,191 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:42:42,191 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:42:42,192 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:42:42,192 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:42:42,192 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:42:42,192 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:42:42,192 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:42:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states. [2019-10-02 12:42:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:42:42,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:42,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:42,255 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -502601310, now seen corresponding path program 1 times [2019-10-02 12:42:42,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:42,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:42,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:42:43,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:43,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:42:43,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:42:43,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:42:43,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:42:43,022 INFO L87 Difference]: Start difference. First operand 555 states. Second operand 2 states. [2019-10-02 12:42:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:43,150 INFO L93 Difference]: Finished difference Result 852 states and 1120 transitions. [2019-10-02 12:42:43,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:42:43,152 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 221 [2019-10-02 12:42:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:43,195 INFO L225 Difference]: With dead ends: 852 [2019-10-02 12:42:43,198 INFO L226 Difference]: Without dead ends: 532 [2019-10-02 12:42:43,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:42:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-02 12:42:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2019-10-02 12:42:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-02 12:42:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 702 transitions. [2019-10-02 12:42:43,344 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 702 transitions. Word has length 221 [2019-10-02 12:42:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:43,347 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 702 transitions. [2019-10-02 12:42:43,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:42:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 702 transitions. [2019-10-02 12:42:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 12:42:43,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:43,353 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:43,354 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:43,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1959572601, now seen corresponding path program 1 times [2019-10-02 12:42:43,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:43,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:43,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:42:43,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:43,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:43,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:43,770 INFO L87 Difference]: Start difference. First operand 532 states and 702 transitions. Second operand 3 states. [2019-10-02 12:42:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:43,869 INFO L93 Difference]: Finished difference Result 835 states and 1084 transitions. [2019-10-02 12:42:43,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:43,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 12:42:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:43,884 INFO L225 Difference]: With dead ends: 835 [2019-10-02 12:42:43,884 INFO L226 Difference]: Without dead ends: 535 [2019-10-02 12:42:43,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-02 12:42:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2019-10-02 12:42:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-02 12:42:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 704 transitions. [2019-10-02 12:42:43,939 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 704 transitions. Word has length 222 [2019-10-02 12:42:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:43,940 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 704 transitions. [2019-10-02 12:42:43,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 704 transitions. [2019-10-02 12:42:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:42:43,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:43,951 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:43,951 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 804976229, now seen corresponding path program 1 times [2019-10-02 12:42:43,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:42:44,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:44,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:44,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:44,253 INFO L87 Difference]: Start difference. First operand 534 states and 704 transitions. Second operand 3 states. [2019-10-02 12:42:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:44,289 INFO L93 Difference]: Finished difference Result 1044 states and 1406 transitions. [2019-10-02 12:42:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:44,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-10-02 12:42:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:44,294 INFO L225 Difference]: With dead ends: 1044 [2019-10-02 12:42:44,295 INFO L226 Difference]: Without dead ends: 575 [2019-10-02 12:42:44,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-02 12:42:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 574. [2019-10-02 12:42:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 12:42:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 773 transitions. [2019-10-02 12:42:44,325 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 773 transitions. Word has length 228 [2019-10-02 12:42:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:44,326 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 773 transitions. [2019-10-02 12:42:44,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 773 transitions. [2019-10-02 12:42:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:42:44,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:44,331 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:44,332 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash 621329804, now seen corresponding path program 1 times [2019-10-02 12:42:44,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:44,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:44,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:44,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:42:44,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:44,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:42:44,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:42:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:42:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:42:44,862 INFO L87 Difference]: Start difference. First operand 574 states and 773 transitions. Second operand 19 states. [2019-10-02 12:42:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:49,963 INFO L93 Difference]: Finished difference Result 2042 states and 2759 transitions. [2019-10-02 12:42:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:42:49,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 229 [2019-10-02 12:42:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:49,976 INFO L225 Difference]: With dead ends: 2042 [2019-10-02 12:42:49,977 INFO L226 Difference]: Without dead ends: 1755 [2019-10-02 12:42:49,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:42:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-10-02 12:42:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1718. [2019-10-02 12:42:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-10-02 12:42:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2329 transitions. [2019-10-02 12:42:50,081 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2329 transitions. Word has length 229 [2019-10-02 12:42:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:50,082 INFO L475 AbstractCegarLoop]: Abstraction has 1718 states and 2329 transitions. [2019-10-02 12:42:50,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:42:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2329 transitions. [2019-10-02 12:42:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:42:50,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:50,091 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:42:50,091 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1402859165, now seen corresponding path program 1 times [2019-10-02 12:42:50,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:50,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:50,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:50,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:50,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:42:50,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:50,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 12:42:50,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:42:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:42:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:42:50,409 INFO L87 Difference]: Start difference. First operand 1718 states and 2329 transitions. Second operand 16 states. [2019-10-02 12:42:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:50,886 INFO L93 Difference]: Finished difference Result 3039 states and 4081 transitions. [2019-10-02 12:42:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:42:50,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 230 [2019-10-02 12:42:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:50,897 INFO L225 Difference]: With dead ends: 3039 [2019-10-02 12:42:50,898 INFO L226 Difference]: Without dead ends: 1800 [2019-10-02 12:42:50,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:42:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2019-10-02 12:42:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1800. [2019-10-02 12:42:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-10-02 12:42:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2442 transitions. [2019-10-02 12:42:50,987 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2442 transitions. Word has length 230 [2019-10-02 12:42:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:50,988 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2442 transitions. [2019-10-02 12:42:50,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:42:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2442 transitions. [2019-10-02 12:42:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:42:50,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:50,997 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:42:50,997 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1144463917, now seen corresponding path program 1 times [2019-10-02 12:42:50,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:50,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:51,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:42:51,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:51,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:42:51,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:42:51,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:42:51,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:42:51,297 INFO L87 Difference]: Start difference. First operand 1800 states and 2442 transitions. Second operand 15 states. [2019-10-02 12:42:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:55,209 INFO L93 Difference]: Finished difference Result 3089 states and 4140 transitions. [2019-10-02 12:42:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:42:55,211 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 230 [2019-10-02 12:42:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:55,223 INFO L225 Difference]: With dead ends: 3089 [2019-10-02 12:42:55,224 INFO L226 Difference]: Without dead ends: 1882 [2019-10-02 12:42:55,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:42:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-02 12:42:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1829. [2019-10-02 12:42:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-10-02 12:42:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2490 transitions. [2019-10-02 12:42:55,329 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2490 transitions. Word has length 230 [2019-10-02 12:42:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:55,332 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2490 transitions. [2019-10-02 12:42:55,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:42:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2490 transitions. [2019-10-02 12:42:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:42:55,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:55,341 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:55,341 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash -746069554, now seen corresponding path program 1 times [2019-10-02 12:42:55,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 12:42:55,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:55,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:42:55,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:42:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:42:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:42:55,677 INFO L87 Difference]: Start difference. First operand 1829 states and 2490 transitions. Second operand 5 states. [2019-10-02 12:42:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:56,796 INFO L93 Difference]: Finished difference Result 4646 states and 6312 transitions. [2019-10-02 12:42:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:42:56,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-10-02 12:42:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:56,822 INFO L225 Difference]: With dead ends: 4646 [2019-10-02 12:42:56,823 INFO L226 Difference]: Without dead ends: 4009 [2019-10-02 12:42:56,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:42:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-10-02 12:42:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3978. [2019-10-02 12:42:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-10-02 12:42:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5410 transitions. [2019-10-02 12:42:57,057 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5410 transitions. Word has length 230 [2019-10-02 12:42:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:57,057 INFO L475 AbstractCegarLoop]: Abstraction has 3978 states and 5410 transitions. [2019-10-02 12:42:57,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:42:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5410 transitions. [2019-10-02 12:42:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:42:57,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:57,069 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:57,070 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -70376945, now seen corresponding path program 1 times [2019-10-02 12:42:57,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:57,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:57,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:42:57,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:42:57,347 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:42:57,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:58,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:42:58,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:42:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:42:58,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:42:58,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:42:58,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:42:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:42:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:42:58,441 INFO L87 Difference]: Start difference. First operand 3978 states and 5410 transitions. Second operand 14 states. [2019-10-02 12:43:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:04,648 INFO L93 Difference]: Finished difference Result 14312 states and 20251 transitions. [2019-10-02 12:43:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:43:04,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 230 [2019-10-02 12:43:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:04,719 INFO L225 Difference]: With dead ends: 14312 [2019-10-02 12:43:04,720 INFO L226 Difference]: Without dead ends: 10370 [2019-10-02 12:43:04,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:43:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10370 states. [2019-10-02 12:43:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10370 to 10352. [2019-10-02 12:43:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10352 states. [2019-10-02 12:43:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10352 states to 10352 states and 14336 transitions. [2019-10-02 12:43:05,598 INFO L78 Accepts]: Start accepts. Automaton has 10352 states and 14336 transitions. Word has length 230 [2019-10-02 12:43:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:05,599 INFO L475 AbstractCegarLoop]: Abstraction has 10352 states and 14336 transitions. [2019-10-02 12:43:05,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:43:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 10352 states and 14336 transitions. [2019-10-02 12:43:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 12:43:05,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:05,619 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:05,620 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:05,620 INFO L82 PathProgramCache]: Analyzing trace with hash -581824491, now seen corresponding path program 1 times [2019-10-02 12:43:05,621 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:05,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:05,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:43:06,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:43:06,157 INFO L224 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-10-02 12:43:06,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:06,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:43:06,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:43:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:43:06,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:43:06,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 12:43:06,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 12:43:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 12:43:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-10-02 12:43:06,988 INFO L87 Difference]: Start difference. First operand 10352 states and 14336 transitions. Second operand 29 states. [2019-10-02 12:43:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:10,709 INFO L93 Difference]: Finished difference Result 20916 states and 29747 transitions. [2019-10-02 12:43:10,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 12:43:10,710 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 233 [2019-10-02 12:43:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:10,776 INFO L225 Difference]: With dead ends: 20916 [2019-10-02 12:43:10,776 INFO L226 Difference]: Without dead ends: 9915 [2019-10-02 12:43:10,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 12:43:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2019-10-02 12:43:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 9717. [2019-10-02 12:43:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9717 states. [2019-10-02 12:43:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9717 states to 9717 states and 13456 transitions. [2019-10-02 12:43:11,467 INFO L78 Accepts]: Start accepts. Automaton has 9717 states and 13456 transitions. Word has length 233 [2019-10-02 12:43:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:11,468 INFO L475 AbstractCegarLoop]: Abstraction has 9717 states and 13456 transitions. [2019-10-02 12:43:11,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 12:43:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9717 states and 13456 transitions. [2019-10-02 12:43:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:43:11,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:11,486 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:11,486 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1177667777, now seen corresponding path program 1 times [2019-10-02 12:43:11,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:11,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:11,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:43:11,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:43:11,778 INFO L224 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-10-02 12:43:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:12,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 2954 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:43:12,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:43:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:43:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:43:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-10-02 12:43:12,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:43:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:43:12,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:43:12,608 INFO L87 Difference]: Start difference. First operand 9717 states and 13456 transitions. Second operand 17 states. [2019-10-02 12:43:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:15,112 INFO L93 Difference]: Finished difference Result 19983 states and 28061 transitions. [2019-10-02 12:43:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:43:15,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 238 [2019-10-02 12:43:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:15,174 INFO L225 Difference]: With dead ends: 19983 [2019-10-02 12:43:15,174 INFO L226 Difference]: Without dead ends: 10327 [2019-10-02 12:43:15,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:43:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2019-10-02 12:43:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 9847. [2019-10-02 12:43:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9847 states. [2019-10-02 12:43:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9847 states to 9847 states and 13627 transitions. [2019-10-02 12:43:15,672 INFO L78 Accepts]: Start accepts. Automaton has 9847 states and 13627 transitions. Word has length 238 [2019-10-02 12:43:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:15,673 INFO L475 AbstractCegarLoop]: Abstraction has 9847 states and 13627 transitions. [2019-10-02 12:43:15,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:43:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9847 states and 13627 transitions. [2019-10-02 12:43:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 12:43:15,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:15,691 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:15,691 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 741901079, now seen corresponding path program 1 times [2019-10-02 12:43:15,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:15,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:15,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:15,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:15,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:43:15,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:15,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:43:15,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:43:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:43:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:43:15,894 INFO L87 Difference]: Start difference. First operand 9847 states and 13627 transitions. Second operand 6 states. [2019-10-02 12:43:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:16,998 INFO L93 Difference]: Finished difference Result 28352 states and 38983 transitions. [2019-10-02 12:43:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:43:16,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-10-02 12:43:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:17,099 INFO L225 Difference]: With dead ends: 28352 [2019-10-02 12:43:17,100 INFO L226 Difference]: Without dead ends: 19825 [2019-10-02 12:43:17,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:43:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2019-10-02 12:43:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 19720. [2019-10-02 12:43:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19720 states. [2019-10-02 12:43:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19720 states to 19720 states and 27256 transitions. [2019-10-02 12:43:18,095 INFO L78 Accepts]: Start accepts. Automaton has 19720 states and 27256 transitions. Word has length 246 [2019-10-02 12:43:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:18,098 INFO L475 AbstractCegarLoop]: Abstraction has 19720 states and 27256 transitions. [2019-10-02 12:43:18,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:43:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19720 states and 27256 transitions. [2019-10-02 12:43:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 12:43:18,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:18,128 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:18,128 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -468510016, now seen corresponding path program 1 times [2019-10-02 12:43:18,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:18,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:18,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:18,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:43:18,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:18,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:43:18,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:43:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:43:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:43:18,353 INFO L87 Difference]: Start difference. First operand 19720 states and 27256 transitions. Second operand 11 states. [2019-10-02 12:43:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:19,149 INFO L93 Difference]: Finished difference Result 35601 states and 49103 transitions. [2019-10-02 12:43:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:43:19,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2019-10-02 12:43:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:19,266 INFO L225 Difference]: With dead ends: 35601 [2019-10-02 12:43:19,267 INFO L226 Difference]: Without dead ends: 21070 [2019-10-02 12:43:19,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:43:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21070 states. [2019-10-02 12:43:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21070 to 20876. [2019-10-02 12:43:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20876 states. [2019-10-02 12:43:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20876 states to 20876 states and 29142 transitions. [2019-10-02 12:43:20,465 INFO L78 Accepts]: Start accepts. Automaton has 20876 states and 29142 transitions. Word has length 247 [2019-10-02 12:43:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:20,466 INFO L475 AbstractCegarLoop]: Abstraction has 20876 states and 29142 transitions. [2019-10-02 12:43:20,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:43:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 20876 states and 29142 transitions. [2019-10-02 12:43:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 12:43:20,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:20,500 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:20,500 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash -987361767, now seen corresponding path program 1 times [2019-10-02 12:43:20,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:43:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:20,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:43:20,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:43:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:43:20,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:43:20,696 INFO L87 Difference]: Start difference. First operand 20876 states and 29142 transitions. Second operand 6 states. [2019-10-02 12:43:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:22,208 INFO L93 Difference]: Finished difference Result 60018 states and 83113 transitions. [2019-10-02 12:43:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:43:22,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-10-02 12:43:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:22,442 INFO L225 Difference]: With dead ends: 60018 [2019-10-02 12:43:22,443 INFO L226 Difference]: Without dead ends: 42123 [2019-10-02 12:43:22,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:43:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42123 states. [2019-10-02 12:43:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42123 to 41738. [2019-10-02 12:43:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41738 states. [2019-10-02 12:43:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41738 states to 41738 states and 58245 transitions. [2019-10-02 12:43:25,569 INFO L78 Accepts]: Start accepts. Automaton has 41738 states and 58245 transitions. Word has length 248 [2019-10-02 12:43:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:25,570 INFO L475 AbstractCegarLoop]: Abstraction has 41738 states and 58245 transitions. [2019-10-02 12:43:25,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:43:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 41738 states and 58245 transitions. [2019-10-02 12:43:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 12:43:25,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:25,619 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:25,620 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1804181114, now seen corresponding path program 1 times [2019-10-02 12:43:25,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:25,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:25,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:43:25,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:25,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:43:25,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:43:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:43:25,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:43:25,816 INFO L87 Difference]: Start difference. First operand 41738 states and 58245 transitions. Second operand 11 states. [2019-10-02 12:43:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:27,212 INFO L93 Difference]: Finished difference Result 74791 states and 104049 transitions. [2019-10-02 12:43:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:43:27,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2019-10-02 12:43:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:27,409 INFO L225 Difference]: With dead ends: 74791 [2019-10-02 12:43:27,410 INFO L226 Difference]: Without dead ends: 44438 [2019-10-02 12:43:27,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:43:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44438 states. [2019-10-02 12:43:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44438 to 44002. [2019-10-02 12:43:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44002 states. [2019-10-02 12:43:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44002 states to 44002 states and 61992 transitions. [2019-10-02 12:43:31,075 INFO L78 Accepts]: Start accepts. Automaton has 44002 states and 61992 transitions. Word has length 249 [2019-10-02 12:43:31,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:31,076 INFO L475 AbstractCegarLoop]: Abstraction has 44002 states and 61992 transitions. [2019-10-02 12:43:31,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:43:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 44002 states and 61992 transitions. [2019-10-02 12:43:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 12:43:31,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:31,101 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:31,102 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash -881150193, now seen corresponding path program 1 times [2019-10-02 12:43:31,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:31,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:31,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:31,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:43:31,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:31,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:43:31,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:43:31,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:43:31,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:43:31,277 INFO L87 Difference]: Start difference. First operand 44002 states and 61992 transitions. Second operand 6 states. [2019-10-02 12:43:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:33,701 INFO L93 Difference]: Finished difference Result 124275 states and 173658 transitions. [2019-10-02 12:43:33,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:43:33,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-10-02 12:43:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:34,007 INFO L225 Difference]: With dead ends: 124275 [2019-10-02 12:43:34,007 INFO L226 Difference]: Without dead ends: 78797 [2019-10-02 12:43:34,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:43:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78797 states. [2019-10-02 12:43:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78797 to 78070. [2019-10-02 12:43:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78070 states. [2019-10-02 12:43:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78070 states to 78070 states and 110427 transitions. [2019-10-02 12:43:38,955 INFO L78 Accepts]: Start accepts. Automaton has 78070 states and 110427 transitions. Word has length 250 [2019-10-02 12:43:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:38,955 INFO L475 AbstractCegarLoop]: Abstraction has 78070 states and 110427 transitions. [2019-10-02 12:43:38,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:43:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78070 states and 110427 transitions. [2019-10-02 12:43:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:43:39,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:39,005 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:39,005 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -50911162, now seen corresponding path program 1 times [2019-10-02 12:43:39,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:39,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:39,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:43:39,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:39,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:43:39,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:43:39,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:43:39,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:39,142 INFO L87 Difference]: Start difference. First operand 78070 states and 110427 transitions. Second operand 3 states. [2019-10-02 12:43:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:41,381 INFO L93 Difference]: Finished difference Result 158018 states and 224404 transitions. [2019-10-02 12:43:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:43:41,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-02 12:43:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:41,805 INFO L225 Difference]: With dead ends: 158018 [2019-10-02 12:43:41,805 INFO L226 Difference]: Without dead ends: 80035 [2019-10-02 12:43:42,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:42,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80035 states. [2019-10-02 12:43:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80035 to 80014. [2019-10-02 12:43:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80014 states. [2019-10-02 12:43:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80014 states to 80014 states and 114009 transitions. [2019-10-02 12:43:47,627 INFO L78 Accepts]: Start accepts. Automaton has 80014 states and 114009 transitions. Word has length 259 [2019-10-02 12:43:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:47,628 INFO L475 AbstractCegarLoop]: Abstraction has 80014 states and 114009 transitions. [2019-10-02 12:43:47,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:43:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 80014 states and 114009 transitions. [2019-10-02 12:43:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:43:47,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:47,692 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:47,692 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 242099335, now seen corresponding path program 1 times [2019-10-02 12:43:47,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:47,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:47,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:43:47,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:47,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:43:47,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:43:47,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:43:47,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:47,845 INFO L87 Difference]: Start difference. First operand 80014 states and 114009 transitions. Second operand 3 states. [2019-10-02 12:43:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:50,036 INFO L93 Difference]: Finished difference Result 163610 states and 234766 transitions. [2019-10-02 12:43:50,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:43:50,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-10-02 12:43:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:50,335 INFO L225 Difference]: With dead ends: 163610 [2019-10-02 12:43:50,335 INFO L226 Difference]: Without dead ends: 83683 [2019-10-02 12:43:50,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2019-10-02 12:43:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 83662. [2019-10-02 12:43:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83662 states. [2019-10-02 12:43:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83662 states to 83662 states and 120741 transitions. [2019-10-02 12:43:58,253 INFO L78 Accepts]: Start accepts. Automaton has 83662 states and 120741 transitions. Word has length 262 [2019-10-02 12:43:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:58,253 INFO L475 AbstractCegarLoop]: Abstraction has 83662 states and 120741 transitions. [2019-10-02 12:43:58,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:43:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 83662 states and 120741 transitions. [2019-10-02 12:43:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 12:43:58,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:58,299 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:58,300 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2102792764, now seen corresponding path program 1 times [2019-10-02 12:43:58,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:58,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:58,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:58,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:43:58,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:58,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:43:58,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:43:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:43:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:58,431 INFO L87 Difference]: Start difference. First operand 83662 states and 120741 transitions. Second operand 3 states. [2019-10-02 12:44:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:00,301 INFO L93 Difference]: Finished difference Result 174266 states and 254290 transitions. [2019-10-02 12:44:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:44:00,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-02 12:44:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:00,975 INFO L225 Difference]: With dead ends: 174266 [2019-10-02 12:44:00,975 INFO L226 Difference]: Without dead ends: 90691 [2019-10-02 12:44:01,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90691 states. [2019-10-02 12:44:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90691 to 90670. [2019-10-02 12:44:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90670 states. [2019-10-02 12:44:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90670 states to 90670 states and 133437 transitions. [2019-10-02 12:44:04,283 INFO L78 Accepts]: Start accepts. Automaton has 90670 states and 133437 transitions. Word has length 261 [2019-10-02 12:44:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:04,284 INFO L475 AbstractCegarLoop]: Abstraction has 90670 states and 133437 transitions. [2019-10-02 12:44:04,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:44:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 90670 states and 133437 transitions. [2019-10-02 12:44:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 12:44:04,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:04,353 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:04,353 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:04,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1231279431, now seen corresponding path program 1 times [2019-10-02 12:44:04,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:04,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:04,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:44:04,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:04,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:44:04,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:44:04,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:44:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:04,482 INFO L87 Difference]: Start difference. First operand 90670 states and 133437 transitions. Second operand 3 states. [2019-10-02 12:44:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:07,288 INFO L93 Difference]: Finished difference Result 194714 states and 291226 transitions. [2019-10-02 12:44:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:44:07,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-10-02 12:44:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:07,611 INFO L225 Difference]: With dead ends: 194714 [2019-10-02 12:44:07,611 INFO L226 Difference]: Without dead ends: 104131 [2019-10-02 12:44:07,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104131 states. [2019-10-02 12:44:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104131 to 104110. [2019-10-02 12:44:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104110 states. [2019-10-02 12:44:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104110 states to 104110 states and 157485 transitions. [2019-10-02 12:44:16,512 INFO L78 Accepts]: Start accepts. Automaton has 104110 states and 157485 transitions. Word has length 264 [2019-10-02 12:44:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:16,512 INFO L475 AbstractCegarLoop]: Abstraction has 104110 states and 157485 transitions. [2019-10-02 12:44:16,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:44:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 104110 states and 157485 transitions. [2019-10-02 12:44:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 12:44:16,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:16,638 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:16,638 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -953749244, now seen corresponding path program 1 times [2019-10-02 12:44:16,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:16,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:16,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:44:17,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:17,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-02 12:44:17,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 12:44:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 12:44:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:44:17,135 INFO L87 Difference]: Start difference. First operand 104110 states and 157485 transitions. Second operand 28 states. [2019-10-02 12:44:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:20,652 INFO L93 Difference]: Finished difference Result 173964 states and 254584 transitions. [2019-10-02 12:44:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 12:44:20,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 263 [2019-10-02 12:44:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:21,037 INFO L225 Difference]: With dead ends: 173964 [2019-10-02 12:44:21,038 INFO L226 Difference]: Without dead ends: 106491 [2019-10-02 12:44:21,170 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:44:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106491 states. [2019-10-02 12:44:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106491 to 104510. [2019-10-02 12:44:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104510 states. [2019-10-02 12:44:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104510 states to 104510 states and 157729 transitions. [2019-10-02 12:44:28,051 INFO L78 Accepts]: Start accepts. Automaton has 104510 states and 157729 transitions. Word has length 263 [2019-10-02 12:44:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:28,052 INFO L475 AbstractCegarLoop]: Abstraction has 104510 states and 157729 transitions. [2019-10-02 12:44:28,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 12:44:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 104510 states and 157729 transitions. [2019-10-02 12:44:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:44:28,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:28,164 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:28,164 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:28,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1389571811, now seen corresponding path program 1 times [2019-10-02 12:44:28,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:28,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:28,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:28,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:44:28,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:28,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:44:28,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:44:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:44:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:44:28,310 INFO L87 Difference]: Start difference. First operand 104510 states and 157729 transitions. Second operand 5 states. [2019-10-02 12:44:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:31,736 INFO L93 Difference]: Finished difference Result 176534 states and 257734 transitions. [2019-10-02 12:44:31,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:44:31,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-10-02 12:44:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:32,056 INFO L225 Difference]: With dead ends: 176534 [2019-10-02 12:44:32,056 INFO L226 Difference]: Without dead ends: 106029 [2019-10-02 12:44:32,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:44:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106029 states. [2019-10-02 12:44:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106029 to 105238. [2019-10-02 12:44:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105238 states. [2019-10-02 12:44:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105238 states to 105238 states and 158821 transitions. [2019-10-02 12:44:41,468 INFO L78 Accepts]: Start accepts. Automaton has 105238 states and 158821 transitions. Word has length 262 [2019-10-02 12:44:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:41,469 INFO L475 AbstractCegarLoop]: Abstraction has 105238 states and 158821 transitions. [2019-10-02 12:44:41,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:44:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 105238 states and 158821 transitions. [2019-10-02 12:44:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:44:41,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:41,588 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:41,588 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 654120875, now seen corresponding path program 1 times [2019-10-02 12:44:41,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:41,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:44:41,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:41,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:44:41,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:44:41,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:44:41,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:44:41,782 INFO L87 Difference]: Start difference. First operand 105238 states and 158821 transitions. Second operand 11 states. [2019-10-02 12:44:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:44,645 INFO L93 Difference]: Finished difference Result 176457 states and 257265 transitions. [2019-10-02 12:44:44,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:44:44,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 262 [2019-10-02 12:44:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:45,036 INFO L225 Difference]: With dead ends: 176457 [2019-10-02 12:44:45,036 INFO L226 Difference]: Without dead ends: 105116 [2019-10-02 12:44:45,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:44:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105116 states. [2019-10-02 12:44:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105116 to 104632. [2019-10-02 12:44:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104632 states. [2019-10-02 12:44:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104632 states to 104632 states and 157725 transitions. [2019-10-02 12:44:54,055 INFO L78 Accepts]: Start accepts. Automaton has 104632 states and 157725 transitions. Word has length 262 [2019-10-02 12:44:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:54,056 INFO L475 AbstractCegarLoop]: Abstraction has 104632 states and 157725 transitions. [2019-10-02 12:44:54,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:44:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 104632 states and 157725 transitions. [2019-10-02 12:44:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:44:54,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:54,161 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:54,161 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2093986572, now seen corresponding path program 1 times [2019-10-02 12:44:54,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:54,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:54,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:54,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:54,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:44:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:44:54,295 INFO L224 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-10-02 12:44:54,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:54,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:44:54,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:44:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:44:55,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:44:55,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 12:44:55,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:44:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:44:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:44:55,010 INFO L87 Difference]: Start difference. First operand 104632 states and 157725 transitions. Second operand 12 states. [2019-10-02 12:44:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:59,781 INFO L93 Difference]: Finished difference Result 195211 states and 295798 transitions. [2019-10-02 12:44:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:44:59,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2019-10-02 12:44:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:00,079 INFO L225 Difference]: With dead ends: 195211 [2019-10-02 12:45:00,079 INFO L226 Difference]: Without dead ends: 90633 [2019-10-02 12:45:00,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:45:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90633 states. [2019-10-02 12:45:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90633 to 90507. [2019-10-02 12:45:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90507 states. [2019-10-02 12:45:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90507 states to 90507 states and 137778 transitions. [2019-10-02 12:45:04,012 INFO L78 Accepts]: Start accepts. Automaton has 90507 states and 137778 transitions. Word has length 262 [2019-10-02 12:45:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:04,012 INFO L475 AbstractCegarLoop]: Abstraction has 90507 states and 137778 transitions. [2019-10-02 12:45:04,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:45:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 90507 states and 137778 transitions. [2019-10-02 12:45:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:45:04,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:04,710 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:04,711 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1960647253, now seen corresponding path program 1 times [2019-10-02 12:45:04,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:04,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:04,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:04,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:45:04,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:04,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:04,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:04,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:04,879 INFO L87 Difference]: Start difference. First operand 90507 states and 137778 transitions. Second operand 6 states. [2019-10-02 12:45:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:10,453 INFO L93 Difference]: Finished difference Result 235924 states and 355593 transitions. [2019-10-02 12:45:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:10,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-10-02 12:45:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:11,064 INFO L225 Difference]: With dead ends: 235924 [2019-10-02 12:45:11,064 INFO L226 Difference]: Without dead ends: 181321 [2019-10-02 12:45:11,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:45:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181321 states. [2019-10-02 12:45:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181321 to 180173. [2019-10-02 12:45:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180173 states. [2019-10-02 12:45:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180173 states to 180173 states and 279391 transitions. [2019-10-02 12:45:25,119 INFO L78 Accepts]: Start accepts. Automaton has 180173 states and 279391 transitions. Word has length 262 [2019-10-02 12:45:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:25,119 INFO L475 AbstractCegarLoop]: Abstraction has 180173 states and 279391 transitions. [2019-10-02 12:45:25,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 180173 states and 279391 transitions. [2019-10-02 12:45:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 12:45:25,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:25,362 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:25,362 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1558412952, now seen corresponding path program 1 times [2019-10-02 12:45:25,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:25,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:25,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:45:25,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:25,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:45:25,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:45:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:45:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:45:25,554 INFO L87 Difference]: Start difference. First operand 180173 states and 279391 transitions. Second operand 10 states. [2019-10-02 12:45:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:33,666 INFO L93 Difference]: Finished difference Result 180178 states and 279395 transitions. [2019-10-02 12:45:33,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:45:33,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2019-10-02 12:45:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:34,436 INFO L225 Difference]: With dead ends: 180178 [2019-10-02 12:45:34,436 INFO L226 Difference]: Without dead ends: 180173 [2019-10-02 12:45:34,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:45:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180173 states. [2019-10-02 12:45:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180173 to 180173. [2019-10-02 12:45:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180173 states. [2019-10-02 12:45:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180173 states to 180173 states and 278719 transitions. [2019-10-02 12:45:42,551 INFO L78 Accepts]: Start accepts. Automaton has 180173 states and 278719 transitions. Word has length 268 [2019-10-02 12:45:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:42,552 INFO L475 AbstractCegarLoop]: Abstraction has 180173 states and 278719 transitions. [2019-10-02 12:45:42,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:45:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 180173 states and 278719 transitions. [2019-10-02 12:45:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 12:45:42,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:42,830 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:42,830 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1059561874, now seen corresponding path program 1 times [2019-10-02 12:45:42,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:42,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:45:43,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:43,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:45:43,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:45:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:45:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:45:43,003 INFO L87 Difference]: Start difference. First operand 180173 states and 278719 transitions. Second operand 8 states. [2019-10-02 12:46:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:00,689 INFO L93 Difference]: Finished difference Result 480975 states and 730184 transitions. [2019-10-02 12:46:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:46:00,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 281 [2019-10-02 12:46:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:02,132 INFO L225 Difference]: With dead ends: 480975 [2019-10-02 12:46:02,132 INFO L226 Difference]: Without dead ends: 363825 [2019-10-02 12:46:02,398 INFO L640 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-10-02 12:46:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363825 states. [2019-10-02 12:46:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363825 to 360758. [2019-10-02 12:46:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360758 states. [2019-10-02 12:46:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360758 states to 360758 states and 560449 transitions. [2019-10-02 12:46:20,391 INFO L78 Accepts]: Start accepts. Automaton has 360758 states and 560449 transitions. Word has length 281 [2019-10-02 12:46:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:20,392 INFO L475 AbstractCegarLoop]: Abstraction has 360758 states and 560449 transitions. [2019-10-02 12:46:20,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:46:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 360758 states and 560449 transitions. [2019-10-02 12:46:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 12:46:21,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:21,125 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:21,126 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 772595409, now seen corresponding path program 1 times [2019-10-02 12:46:21,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:21,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:46:28,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:28,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:46:28,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:46:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:46:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:46:28,958 INFO L87 Difference]: Start difference. First operand 360758 states and 560449 transitions. Second operand 15 states. [2019-10-02 12:46:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:47,874 INFO L93 Difference]: Finished difference Result 525363 states and 784162 transitions. [2019-10-02 12:46:47,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:46:47,874 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 282 [2019-10-02 12:46:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:49,483 INFO L225 Difference]: With dead ends: 525363 [2019-10-02 12:46:49,483 INFO L226 Difference]: Without dead ends: 364846 [2019-10-02 12:46:49,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:46:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364846 states. [2019-10-02 12:47:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364846 to 357976. [2019-10-02 12:47:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357976 states. [2019-10-02 12:47:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357976 states to 357976 states and 556203 transitions. [2019-10-02 12:47:08,666 INFO L78 Accepts]: Start accepts. Automaton has 357976 states and 556203 transitions. Word has length 282 [2019-10-02 12:47:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:08,667 INFO L475 AbstractCegarLoop]: Abstraction has 357976 states and 556203 transitions. [2019-10-02 12:47:08,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:47:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 357976 states and 556203 transitions. [2019-10-02 12:47:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 12:47:09,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:09,435 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:09,435 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1778866762, now seen corresponding path program 1 times [2019-10-02 12:47:09,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:09,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:09,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:09,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 12:47:09,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:47:09,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:47:09,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:47:09,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:47:09,618 INFO L87 Difference]: Start difference. First operand 357976 states and 556203 transitions. Second operand 7 states. [2019-10-02 12:47:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:52,988 INFO L93 Difference]: Finished difference Result 1025382 states and 1616200 transitions. [2019-10-02 12:47:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:47:52,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 283 [2019-10-02 12:47:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:57,405 INFO L225 Difference]: With dead ends: 1025382 [2019-10-02 12:47:57,406 INFO L226 Difference]: Without dead ends: 818551 [2019-10-02 12:47:57,920 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:47:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818551 states. [2019-10-02 12:49:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818551 to 701486. [2019-10-02 12:49:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701486 states. [2019-10-02 12:49:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701486 states to 701486 states and 1102522 transitions. [2019-10-02 12:49:18,782 INFO L78 Accepts]: Start accepts. Automaton has 701486 states and 1102522 transitions. Word has length 283 [2019-10-02 12:49:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:18,782 INFO L475 AbstractCegarLoop]: Abstraction has 701486 states and 1102522 transitions. [2019-10-02 12:49:18,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:49:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 701486 states and 1102522 transitions. [2019-10-02 12:49:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 12:49:23,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:23,127 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:23,127 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 597888569, now seen corresponding path program 1 times [2019-10-02 12:49:23,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:23,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:23,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:23,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:23,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:49:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:49:23,332 INFO L224 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-10-02 12:49:23,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:23,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 3123 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:49:23,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:49:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:49:24,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:49:24,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 12:49:24,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:49:24,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:49:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:49:24,036 INFO L87 Difference]: Start difference. First operand 701486 states and 1102522 transitions. Second operand 16 states. [2019-10-02 12:50:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:50:07,007 INFO L93 Difference]: Finished difference Result 1280009 states and 1961845 transitions. [2019-10-02 12:50:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:50:07,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 282 [2019-10-02 12:50:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:50:10,851 INFO L225 Difference]: With dead ends: 1280009 [2019-10-02 12:50:10,851 INFO L226 Difference]: Without dead ends: 704888 [2019-10-02 12:50:11,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 281 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-10-02 12:50:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704888 states.