java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:06:09,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:06:09,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:06:09,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:06:09,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:06:09,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:06:09,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:06:09,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:06:09,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:06:09,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:06:09,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:06:09,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:06:09,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:06:09,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:06:09,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:06:09,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:06:09,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:06:09,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:06:09,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:06:09,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:06:09,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:06:09,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:06:09,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:06:09,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:06:09,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:06:09,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:06:09,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:06:09,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:06:09,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:06:09,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:06:09,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:06:09,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:06:09,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:06:09,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:06:09,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:06:09,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:06:09,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:06:09,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:06:09,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:06:09,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:06:09,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:06:09,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:06:09,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:06:09,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:06:09,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:06:09,593 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:06:09,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:06:09,594 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:06:09,594 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:06:09,594 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:06:09,594 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:06:09,594 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:06:09,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:06:09,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:06:09,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:06:09,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:06:09,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:06:09,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:06:09,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:06:09,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:06:09,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:06:09,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:06:09,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:06:09,597 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:06:09,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:06:09,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:06:09,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:06:09,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:06:09,599 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:06:09,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:06:09,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:06:09,599 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:06:09,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:06:09,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:06:09,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:06:09,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:06:09,652 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:06:09,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-1.c [2019-09-16 17:06:09,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b55a4c070/28452668fb1744d798aaf587be127ff6/FLAG8e7ccd28c [2019-09-16 17:06:10,400 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:06:10,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-1.c [2019-09-16 17:06:10,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b55a4c070/28452668fb1744d798aaf587be127ff6/FLAG8e7ccd28c [2019-09-16 17:06:10,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b55a4c070/28452668fb1744d798aaf587be127ff6 [2019-09-16 17:06:10,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:06:10,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:06:10,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:06:10,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:06:10,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:06:10,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:06:10" (1/1) ... [2019-09-16 17:06:10,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d428e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:10, skipping insertion in model container [2019-09-16 17:06:10,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:06:10" (1/1) ... [2019-09-16 17:06:10,620 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:06:10,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:06:11,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:06:11,447 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:06:11,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:06:11,605 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:06:11,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11 WrapperNode [2019-09-16 17:06:11,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:06:11,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:06:11,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:06:11,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:06:11,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... [2019-09-16 17:06:11,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:06:11,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:06:11,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:06:11,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:06:11,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:06:11,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:06:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:06:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:06:11,868 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:06:11,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:06:11,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:06:11,868 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:06:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:06:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:06:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:06:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:06:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:06:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:06:11,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:06:11,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:06:11,872 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:06:11,872 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:06:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:06:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:06:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:06:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:06:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:06:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:06:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:06:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:06:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:06:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:06:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:06:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:06:11,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:06:11,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:06:11,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:06:11,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:06:12,361 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:06:13,221 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:06:13,222 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:06:13,243 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:06:13,243 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:06:13,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:06:13 BoogieIcfgContainer [2019-09-16 17:06:13,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:06:13,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:06:13,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:06:13,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:06:13,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:06:10" (1/3) ... [2019-09-16 17:06:13,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77703aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:06:13, skipping insertion in model container [2019-09-16 17:06:13,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:11" (2/3) ... [2019-09-16 17:06:13,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77703aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:06:13, skipping insertion in model container [2019-09-16 17:06:13,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:06:13" (3/3) ... [2019-09-16 17:06:13,253 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2019-09-16 17:06:13,263 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:06:13,273 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:06:13,291 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:06:13,321 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:06:13,321 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:06:13,322 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:06:13,322 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:06:13,322 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:06:13,322 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:06:13,322 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:06:13,322 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:06:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-16 17:06:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 17:06:13,384 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,386 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:13,389 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1765805398, now seen corresponding path program 1 times [2019-09-16 17:06:13,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:13,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,906 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 4 states. [2019-09-16 17:06:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,398 INFO L93 Difference]: Finished difference Result 198 states and 326 transitions. [2019-09-16 17:06:14,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-16 17:06:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,426 INFO L225 Difference]: With dead ends: 198 [2019-09-16 17:06:14,426 INFO L226 Difference]: Without dead ends: 177 [2019-09-16 17:06:14,431 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-16 17:06:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-09-16 17:06:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:06:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2019-09-16 17:06:14,528 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 49 [2019-09-16 17:06:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,529 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2019-09-16 17:06:14,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2019-09-16 17:06:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:06:14,534 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,534 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:14,536 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2089385858, now seen corresponding path program 1 times [2019-09-16 17:06:14,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:14,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,670 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand 4 states. [2019-09-16 17:06:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,104 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2019-09-16 17:06:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-16 17:06:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,108 INFO L225 Difference]: With dead ends: 177 [2019-09-16 17:06:15,108 INFO L226 Difference]: Without dead ends: 177 [2019-09-16 17:06:15,109 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-16 17:06:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-09-16 17:06:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:06:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2019-09-16 17:06:15,121 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 62 [2019-09-16 17:06:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,122 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2019-09-16 17:06:15,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2019-09-16 17:06:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:15,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,125 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:15,125 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1535183890, now seen corresponding path program 1 times [2019-09-16 17:06:15,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:15,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,271 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand 4 states. [2019-09-16 17:06:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,591 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2019-09-16 17:06:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,594 INFO L225 Difference]: With dead ends: 176 [2019-09-16 17:06:15,594 INFO L226 Difference]: Without dead ends: 176 [2019-09-16 17:06:15,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-16 17:06:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 160. [2019-09-16 17:06:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:06:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2019-09-16 17:06:15,617 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 63 [2019-09-16 17:06:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,617 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2019-09-16 17:06:15,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2019-09-16 17:06:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:15,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,624 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:15,624 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,625 INFO L82 PathProgramCache]: Analyzing trace with hash -872879962, now seen corresponding path program 1 times [2019-09-16 17:06:15,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:15,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:15,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:15,791 INFO L87 Difference]: Start difference. First operand 160 states and 246 transitions. Second operand 5 states. [2019-09-16 17:06:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,295 INFO L93 Difference]: Finished difference Result 181 states and 274 transitions. [2019-09-16 17:06:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:06:16,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-16 17:06:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,299 INFO L225 Difference]: With dead ends: 181 [2019-09-16 17:06:16,299 INFO L226 Difference]: Without dead ends: 181 [2019-09-16 17:06:16,300 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:06:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-16 17:06:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-16 17:06:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-16 17:06:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2019-09-16 17:06:16,309 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 63 [2019-09-16 17:06:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,310 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2019-09-16 17:06:16,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2019-09-16 17:06:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:16,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,312 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:16,313 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 309686878, now seen corresponding path program 1 times [2019-09-16 17:06:16,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:16,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,406 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2019-09-16 17:06:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,728 INFO L93 Difference]: Finished difference Result 195 states and 290 transitions. [2019-09-16 17:06:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,731 INFO L225 Difference]: With dead ends: 195 [2019-09-16 17:06:16,731 INFO L226 Difference]: Without dead ends: 195 [2019-09-16 17:06:16,731 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-16 17:06:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2019-09-16 17:06:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-16 17:06:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2019-09-16 17:06:16,746 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 63 [2019-09-16 17:06:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,747 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2019-09-16 17:06:16,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2019-09-16 17:06:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:16,748 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,749 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:16,749 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash 242126877, now seen corresponding path program 1 times [2019-09-16 17:06:16,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,819 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2019-09-16 17:06:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,143 INFO L93 Difference]: Finished difference Result 193 states and 287 transitions. [2019-09-16 17:06:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,146 INFO L225 Difference]: With dead ends: 193 [2019-09-16 17:06:17,146 INFO L226 Difference]: Without dead ends: 193 [2019-09-16 17:06:17,146 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-16 17:06:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-16 17:06:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-16 17:06:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 271 transitions. [2019-09-16 17:06:17,155 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 271 transitions. Word has length 63 [2019-09-16 17:06:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,155 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 271 transitions. [2019-09-16 17:06:17,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 271 transitions. [2019-09-16 17:06:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:06:17,158 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,159 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:17,159 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash -303724929, now seen corresponding path program 1 times [2019-09-16 17:06:17,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:17,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,250 INFO L87 Difference]: Start difference. First operand 180 states and 271 transitions. Second operand 4 states. [2019-09-16 17:06:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,535 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2019-09-16 17:06:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:06:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,538 INFO L225 Difference]: With dead ends: 193 [2019-09-16 17:06:17,539 INFO L226 Difference]: Without dead ends: 193 [2019-09-16 17:06:17,539 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-16 17:06:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-16 17:06:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-16 17:06:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 270 transitions. [2019-09-16 17:06:17,548 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 270 transitions. Word has length 64 [2019-09-16 17:06:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,548 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 270 transitions. [2019-09-16 17:06:17,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 270 transitions. [2019-09-16 17:06:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:06:17,549 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,550 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:17,550 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -598835814, now seen corresponding path program 1 times [2019-09-16 17:06:17,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:17,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,623 INFO L87 Difference]: Start difference. First operand 180 states and 270 transitions. Second operand 4 states. [2019-09-16 17:06:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,908 INFO L93 Difference]: Finished difference Result 193 states and 285 transitions. [2019-09-16 17:06:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:06:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,911 INFO L225 Difference]: With dead ends: 193 [2019-09-16 17:06:17,911 INFO L226 Difference]: Without dead ends: 193 [2019-09-16 17:06:17,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-16 17:06:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-16 17:06:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-16 17:06:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 269 transitions. [2019-09-16 17:06:17,920 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 269 transitions. Word has length 65 [2019-09-16 17:06:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,921 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 269 transitions. [2019-09-16 17:06:17,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 269 transitions. [2019-09-16 17:06:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:06:17,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,923 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:17,924 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,924 INFO L82 PathProgramCache]: Analyzing trace with hash -604400838, now seen corresponding path program 1 times [2019-09-16 17:06:17,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:18,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,027 INFO L87 Difference]: Start difference. First operand 180 states and 269 transitions. Second operand 4 states. [2019-09-16 17:06:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,343 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2019-09-16 17:06:18,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:06:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,346 INFO L225 Difference]: With dead ends: 193 [2019-09-16 17:06:18,346 INFO L226 Difference]: Without dead ends: 193 [2019-09-16 17:06:18,346 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-16 17:06:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-16 17:06:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-16 17:06:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2019-09-16 17:06:18,351 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 66 [2019-09-16 17:06:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,352 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2019-09-16 17:06:18,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2019-09-16 17:06:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:06:18,353 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,353 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:18,354 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -822498919, now seen corresponding path program 1 times [2019-09-16 17:06:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:18,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,414 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand 4 states. [2019-09-16 17:06:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,710 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2019-09-16 17:06:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:06:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,712 INFO L225 Difference]: With dead ends: 222 [2019-09-16 17:06:18,712 INFO L226 Difference]: Without dead ends: 222 [2019-09-16 17:06:18,713 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-16 17:06:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2019-09-16 17:06:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 305 transitions. [2019-09-16 17:06:18,719 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 305 transitions. Word has length 66 [2019-09-16 17:06:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,720 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 305 transitions. [2019-09-16 17:06:18,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 305 transitions. [2019-09-16 17:06:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-16 17:06:18,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,721 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:06:18,722 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash -223978763, now seen corresponding path program 1 times [2019-09-16 17:06:18,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:18,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,776 INFO L87 Difference]: Start difference. First operand 202 states and 305 transitions. Second operand 4 states. [2019-09-16 17:06:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,018 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2019-09-16 17:06:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-16 17:06:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,021 INFO L225 Difference]: With dead ends: 205 [2019-09-16 17:06:19,021 INFO L226 Difference]: Without dead ends: 205 [2019-09-16 17:06:19,021 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-16 17:06:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-09-16 17:06:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2019-09-16 17:06:19,028 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 67 [2019-09-16 17:06:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,028 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2019-09-16 17:06:19,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2019-09-16 17:06:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:06:19,030 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,030 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,030 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1269381901, now seen corresponding path program 1 times [2019-09-16 17:06:19,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:19,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,092 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand 4 states. [2019-09-16 17:06:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,371 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-16 17:06:19,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:06:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,373 INFO L225 Difference]: With dead ends: 222 [2019-09-16 17:06:19,373 INFO L226 Difference]: Without dead ends: 222 [2019-09-16 17:06:19,374 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-16 17:06:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2019-09-16 17:06:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2019-09-16 17:06:19,380 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 79 [2019-09-16 17:06:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,381 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2019-09-16 17:06:19,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2019-09-16 17:06:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:19,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,382 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:19,382 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash -732898547, now seen corresponding path program 1 times [2019-09-16 17:06:19,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:19,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,447 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand 4 states. [2019-09-16 17:06:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,759 INFO L93 Difference]: Finished difference Result 221 states and 326 transitions. [2019-09-16 17:06:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,761 INFO L225 Difference]: With dead ends: 221 [2019-09-16 17:06:19,761 INFO L226 Difference]: Without dead ends: 221 [2019-09-16 17:06:19,762 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-16 17:06:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 202. [2019-09-16 17:06:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2019-09-16 17:06:19,768 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 80 [2019-09-16 17:06:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,790 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2019-09-16 17:06:19,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2019-09-16 17:06:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:19,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,792 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:19,792 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -800458548, now seen corresponding path program 1 times [2019-09-16 17:06:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:19,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,857 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand 4 states. [2019-09-16 17:06:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,123 INFO L93 Difference]: Finished difference Result 219 states and 323 transitions. [2019-09-16 17:06:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,126 INFO L225 Difference]: With dead ends: 219 [2019-09-16 17:06:20,126 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:06:20,126 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:06:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-16 17:06:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2019-09-16 17:06:20,137 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 80 [2019-09-16 17:06:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,137 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2019-09-16 17:06:20,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2019-09-16 17:06:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:06:20,138 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,139 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,139 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1735865264, now seen corresponding path program 1 times [2019-09-16 17:06:20,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:20,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,216 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 4 states. [2019-09-16 17:06:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,590 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-16 17:06:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:06:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,592 INFO L225 Difference]: With dead ends: 219 [2019-09-16 17:06:20,592 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:06:20,593 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:06:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-16 17:06:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 300 transitions. [2019-09-16 17:06:20,599 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 300 transitions. Word has length 81 [2019-09-16 17:06:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,600 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 300 transitions. [2019-09-16 17:06:20,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 300 transitions. [2019-09-16 17:06:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:06:20,601 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,602 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,602 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1796049271, now seen corresponding path program 1 times [2019-09-16 17:06:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:20,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,667 INFO L87 Difference]: Start difference. First operand 202 states and 300 transitions. Second operand 4 states. [2019-09-16 17:06:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,956 INFO L93 Difference]: Finished difference Result 219 states and 321 transitions. [2019-09-16 17:06:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:06:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,958 INFO L225 Difference]: With dead ends: 219 [2019-09-16 17:06:20,958 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:06:20,959 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:06:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-16 17:06:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2019-09-16 17:06:20,966 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 82 [2019-09-16 17:06:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,967 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2019-09-16 17:06:20,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2019-09-16 17:06:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:06:20,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,969 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-16 17:06:20,969 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash 936687659, now seen corresponding path program 1 times [2019-09-16 17:06:20,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:21,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,028 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand 4 states. [2019-09-16 17:06:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,343 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2019-09-16 17:06:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:06:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,346 INFO L225 Difference]: With dead ends: 219 [2019-09-16 17:06:21,346 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:06:21,347 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:06:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-16 17:06:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2019-09-16 17:06:21,353 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 83 [2019-09-16 17:06:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,354 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2019-09-16 17:06:21,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2019-09-16 17:06:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-16 17:06:21,356 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,356 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,357 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash 305124388, now seen corresponding path program 1 times [2019-09-16 17:06:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:06:21,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,467 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand 4 states. [2019-09-16 17:06:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,803 INFO L93 Difference]: Finished difference Result 209 states and 307 transitions. [2019-09-16 17:06:21,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-16 17:06:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,805 INFO L225 Difference]: With dead ends: 209 [2019-09-16 17:06:21,805 INFO L226 Difference]: Without dead ends: 209 [2019-09-16 17:06:21,805 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-16 17:06:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2019-09-16 17:06:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-16 17:06:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 297 transitions. [2019-09-16 17:06:21,811 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 297 transitions. Word has length 84 [2019-09-16 17:06:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,811 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 297 transitions. [2019-09-16 17:06:21,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 297 transitions. [2019-09-16 17:06:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-16 17:06:21,813 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,813 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,813 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196548, now seen corresponding path program 1 times [2019-09-16 17:06:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:21,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,900 INFO L87 Difference]: Start difference. First operand 202 states and 297 transitions. Second operand 4 states. [2019-09-16 17:06:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,424 INFO L93 Difference]: Finished difference Result 314 states and 470 transitions. [2019-09-16 17:06:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-16 17:06:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,426 INFO L225 Difference]: With dead ends: 314 [2019-09-16 17:06:22,427 INFO L226 Difference]: Without dead ends: 314 [2019-09-16 17:06:22,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-16 17:06:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 243. [2019-09-16 17:06:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-16 17:06:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2019-09-16 17:06:22,436 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 88 [2019-09-16 17:06:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,436 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2019-09-16 17:06:22,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2019-09-16 17:06:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-16 17:06:22,437 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,438 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,438 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1271549826, now seen corresponding path program 1 times [2019-09-16 17:06:22,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:22,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,521 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand 4 states. [2019-09-16 17:06:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,837 INFO L93 Difference]: Finished difference Result 292 states and 443 transitions. [2019-09-16 17:06:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-16 17:06:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,841 INFO L225 Difference]: With dead ends: 292 [2019-09-16 17:06:22,841 INFO L226 Difference]: Without dead ends: 292 [2019-09-16 17:06:22,842 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-16 17:06:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 267. [2019-09-16 17:06:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-16 17:06:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2019-09-16 17:06:22,849 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 88 [2019-09-16 17:06:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,850 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2019-09-16 17:06:22,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2019-09-16 17:06:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-16 17:06:22,851 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,852 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,852 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 130094744, now seen corresponding path program 1 times [2019-09-16 17:06:22,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:22,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,973 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2019-09-16 17:06:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,487 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-09-16 17:06:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-16 17:06:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,492 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:06:23,492 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:06:23,493 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:06:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2019-09-16 17:06:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 412 transitions. [2019-09-16 17:06:23,505 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 412 transitions. Word has length 89 [2019-09-16 17:06:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,505 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 412 transitions. [2019-09-16 17:06:23,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 412 transitions. [2019-09-16 17:06:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:06:23,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,509 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:23,509 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash 981654768, now seen corresponding path program 1 times [2019-09-16 17:06:23,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:23,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,601 INFO L87 Difference]: Start difference. First operand 268 states and 412 transitions. Second operand 4 states. [2019-09-16 17:06:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,135 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-09-16 17:06:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:06:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,140 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:06:24,140 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:06:24,141 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:06:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2019-09-16 17:06:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 411 transitions. [2019-09-16 17:06:24,150 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 411 transitions. Word has length 101 [2019-09-16 17:06:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,150 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 411 transitions. [2019-09-16 17:06:24,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 411 transitions. [2019-09-16 17:06:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:06:24,152 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,152 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:24,153 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1857673774, now seen corresponding path program 1 times [2019-09-16 17:06:24,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:24,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,262 INFO L87 Difference]: Start difference. First operand 268 states and 411 transitions. Second operand 4 states. [2019-09-16 17:06:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,679 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2019-09-16 17:06:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:06:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,682 INFO L225 Difference]: With dead ends: 293 [2019-09-16 17:06:24,683 INFO L226 Difference]: Without dead ends: 293 [2019-09-16 17:06:24,684 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-16 17:06:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2019-09-16 17:06:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2019-09-16 17:06:24,694 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 101 [2019-09-16 17:06:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,695 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2019-09-16 17:06:24,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2019-09-16 17:06:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:24,697 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,697 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-16 17:06:24,697 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 329761456, now seen corresponding path program 1 times [2019-09-16 17:06:24,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:24,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,777 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2019-09-16 17:06:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,188 INFO L93 Difference]: Finished difference Result 329 states and 495 transitions. [2019-09-16 17:06:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,191 INFO L225 Difference]: With dead ends: 329 [2019-09-16 17:06:25,191 INFO L226 Difference]: Without dead ends: 329 [2019-09-16 17:06:25,192 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-16 17:06:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 268. [2019-09-16 17:06:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2019-09-16 17:06:25,200 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 102 [2019-09-16 17:06:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,201 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2019-09-16 17:06:25,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2019-09-16 17:06:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:25,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,202 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:25,203 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash 262201455, now seen corresponding path program 1 times [2019-09-16 17:06:25,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,270 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 4 states. [2019-09-16 17:06:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,733 INFO L93 Difference]: Finished difference Result 327 states and 492 transitions. [2019-09-16 17:06:25,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,736 INFO L225 Difference]: With dead ends: 327 [2019-09-16 17:06:25,736 INFO L226 Difference]: Without dead ends: 327 [2019-09-16 17:06:25,737 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-16 17:06:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-16 17:06:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2019-09-16 17:06:25,747 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 102 [2019-09-16 17:06:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,747 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2019-09-16 17:06:25,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2019-09-16 17:06:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:25,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,751 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-16 17:06:25,751 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1716546866, now seen corresponding path program 1 times [2019-09-16 17:06:25,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:25,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,850 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 4 states. [2019-09-16 17:06:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,194 INFO L93 Difference]: Finished difference Result 292 states and 438 transitions. [2019-09-16 17:06:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,197 INFO L225 Difference]: With dead ends: 292 [2019-09-16 17:06:26,197 INFO L226 Difference]: Without dead ends: 292 [2019-09-16 17:06:26,197 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-16 17:06:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2019-09-16 17:06:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2019-09-16 17:06:26,204 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 102 [2019-09-16 17:06:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,205 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2019-09-16 17:06:26,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2019-09-16 17:06:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:26,206 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,206 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:26,207 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1648986865, now seen corresponding path program 1 times [2019-09-16 17:06:26,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,305 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 4 states. [2019-09-16 17:06:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,649 INFO L93 Difference]: Finished difference Result 290 states and 435 transitions. [2019-09-16 17:06:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,653 INFO L225 Difference]: With dead ends: 290 [2019-09-16 17:06:26,653 INFO L226 Difference]: Without dead ends: 290 [2019-09-16 17:06:26,654 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-16 17:06:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-16 17:06:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2019-09-16 17:06:26,663 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 102 [2019-09-16 17:06:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,663 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2019-09-16 17:06:26,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2019-09-16 17:06:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:26,665 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,665 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:26,666 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,666 INFO L82 PathProgramCache]: Analyzing trace with hash 318586989, now seen corresponding path program 1 times [2019-09-16 17:06:26,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:26,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,742 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 4 states. [2019-09-16 17:06:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,138 INFO L93 Difference]: Finished difference Result 327 states and 489 transitions. [2019-09-16 17:06:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,141 INFO L225 Difference]: With dead ends: 327 [2019-09-16 17:06:27,142 INFO L226 Difference]: Without dead ends: 327 [2019-09-16 17:06:27,142 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-16 17:06:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-16 17:06:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2019-09-16 17:06:27,150 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 103 [2019-09-16 17:06:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,150 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2019-09-16 17:06:27,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2019-09-16 17:06:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:27,152 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,152 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:27,152 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash 359261739, now seen corresponding path program 1 times [2019-09-16 17:06:27,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:27,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,217 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 4 states. [2019-09-16 17:06:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,528 INFO L93 Difference]: Finished difference Result 290 states and 433 transitions. [2019-09-16 17:06:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,531 INFO L225 Difference]: With dead ends: 290 [2019-09-16 17:06:27,531 INFO L226 Difference]: Without dead ends: 290 [2019-09-16 17:06:27,532 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-16 17:06:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-16 17:06:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2019-09-16 17:06:27,540 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 103 [2019-09-16 17:06:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,540 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2019-09-16 17:06:27,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2019-09-16 17:06:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:27,542 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,542 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:27,543 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1512964460, now seen corresponding path program 1 times [2019-09-16 17:06:27,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:27,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,607 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand 4 states. [2019-09-16 17:06:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,019 INFO L93 Difference]: Finished difference Result 327 states and 487 transitions. [2019-09-16 17:06:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:06:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,022 INFO L225 Difference]: With dead ends: 327 [2019-09-16 17:06:28,023 INFO L226 Difference]: Without dead ends: 327 [2019-09-16 17:06:28,023 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-16 17:06:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-16 17:06:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 403 transitions. [2019-09-16 17:06:28,032 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 403 transitions. Word has length 104 [2019-09-16 17:06:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,032 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 403 transitions. [2019-09-16 17:06:28,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 403 transitions. [2019-09-16 17:06:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:28,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,034 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:28,035 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1521085586, now seen corresponding path program 1 times [2019-09-16 17:06:28,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:28,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,112 INFO L87 Difference]: Start difference. First operand 268 states and 403 transitions. Second operand 4 states. [2019-09-16 17:06:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,413 INFO L93 Difference]: Finished difference Result 290 states and 431 transitions. [2019-09-16 17:06:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:06:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,417 INFO L225 Difference]: With dead ends: 290 [2019-09-16 17:06:28,417 INFO L226 Difference]: Without dead ends: 290 [2019-09-16 17:06:28,418 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-16 17:06:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-16 17:06:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 402 transitions. [2019-09-16 17:06:28,426 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 402 transitions. Word has length 104 [2019-09-16 17:06:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,427 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 402 transitions. [2019-09-16 17:06:28,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 402 transitions. [2019-09-16 17:06:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:06:28,429 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,429 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:28,430 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 436898216, now seen corresponding path program 1 times [2019-09-16 17:06:28,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:28,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,515 INFO L87 Difference]: Start difference. First operand 268 states and 402 transitions. Second operand 4 states. [2019-09-16 17:06:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,947 INFO L93 Difference]: Finished difference Result 327 states and 485 transitions. [2019-09-16 17:06:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:06:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,950 INFO L225 Difference]: With dead ends: 327 [2019-09-16 17:06:28,951 INFO L226 Difference]: Without dead ends: 327 [2019-09-16 17:06:28,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-16 17:06:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-16 17:06:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 401 transitions. [2019-09-16 17:06:28,958 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 401 transitions. Word has length 105 [2019-09-16 17:06:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,959 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 401 transitions. [2019-09-16 17:06:28,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2019-09-16 17:06:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:06:28,960 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,960 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:28,961 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 870627302, now seen corresponding path program 1 times [2019-09-16 17:06:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:29,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,032 INFO L87 Difference]: Start difference. First operand 268 states and 401 transitions. Second operand 4 states. [2019-09-16 17:06:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,339 INFO L93 Difference]: Finished difference Result 290 states and 429 transitions. [2019-09-16 17:06:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:06:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,341 INFO L225 Difference]: With dead ends: 290 [2019-09-16 17:06:29,341 INFO L226 Difference]: Without dead ends: 290 [2019-09-16 17:06:29,342 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-16 17:06:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-16 17:06:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 400 transitions. [2019-09-16 17:06:29,348 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 400 transitions. Word has length 105 [2019-09-16 17:06:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,348 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 400 transitions. [2019-09-16 17:06:29,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 400 transitions. [2019-09-16 17:06:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:06:29,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,351 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:29,351 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1991520839, now seen corresponding path program 1 times [2019-09-16 17:06:29,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:29,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,414 INFO L87 Difference]: Start difference. First operand 268 states and 400 transitions. Second operand 4 states. [2019-09-16 17:06:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,775 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2019-09-16 17:06:29,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:06:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,779 INFO L225 Difference]: With dead ends: 317 [2019-09-16 17:06:29,779 INFO L226 Difference]: Without dead ends: 317 [2019-09-16 17:06:29,779 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-16 17:06:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2019-09-16 17:06:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 399 transitions. [2019-09-16 17:06:29,786 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 399 transitions. Word has length 106 [2019-09-16 17:06:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,786 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 399 transitions. [2019-09-16 17:06:29,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 399 transitions. [2019-09-16 17:06:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:06:29,788 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,788 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:29,788 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1742746679, now seen corresponding path program 1 times [2019-09-16 17:06:29,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:29,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,855 INFO L87 Difference]: Start difference. First operand 268 states and 399 transitions. Second operand 4 states. [2019-09-16 17:06:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,114 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2019-09-16 17:06:30,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:06:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,117 INFO L225 Difference]: With dead ends: 280 [2019-09-16 17:06:30,117 INFO L226 Difference]: Without dead ends: 280 [2019-09-16 17:06:30,117 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-16 17:06:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2019-09-16 17:06:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2019-09-16 17:06:30,123 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 106 [2019-09-16 17:06:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,123 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2019-09-16 17:06:30,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2019-09-16 17:06:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:06:30,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,125 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:30,125 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash -214368275, now seen corresponding path program 1 times [2019-09-16 17:06:30,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,197 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand 4 states. [2019-09-16 17:06:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,572 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2019-09-16 17:06:30,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-16 17:06:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,575 INFO L225 Difference]: With dead ends: 317 [2019-09-16 17:06:30,575 INFO L226 Difference]: Without dead ends: 317 [2019-09-16 17:06:30,575 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-16 17:06:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2019-09-16 17:06:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 397 transitions. [2019-09-16 17:06:30,582 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 397 transitions. Word has length 110 [2019-09-16 17:06:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,582 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 397 transitions. [2019-09-16 17:06:30,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 397 transitions. [2019-09-16 17:06:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:06:30,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,584 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:30,584 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -631764881, now seen corresponding path program 1 times [2019-09-16 17:06:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:30,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,692 INFO L87 Difference]: Start difference. First operand 268 states and 397 transitions. Second operand 4 states. [2019-09-16 17:06:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,053 INFO L93 Difference]: Finished difference Result 321 states and 477 transitions. [2019-09-16 17:06:31,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-16 17:06:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,056 INFO L225 Difference]: With dead ends: 321 [2019-09-16 17:06:31,056 INFO L226 Difference]: Without dead ends: 321 [2019-09-16 17:06:31,057 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-16 17:06:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 294. [2019-09-16 17:06:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2019-09-16 17:06:31,066 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 110 [2019-09-16 17:06:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,068 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2019-09-16 17:06:31,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2019-09-16 17:06:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-16 17:06:31,070 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,070 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,070 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1079792269, now seen corresponding path program 1 times [2019-09-16 17:06:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:31,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:31,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:31,173 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand 4 states. [2019-09-16 17:06:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,544 INFO L93 Difference]: Finished difference Result 343 states and 513 transitions. [2019-09-16 17:06:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-16 17:06:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,547 INFO L225 Difference]: With dead ends: 343 [2019-09-16 17:06:31,547 INFO L226 Difference]: Without dead ends: 343 [2019-09-16 17:06:31,547 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-16 17:06:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2019-09-16 17:06:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 441 transitions. [2019-09-16 17:06:31,554 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 441 transitions. Word has length 113 [2019-09-16 17:06:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,555 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 441 transitions. [2019-09-16 17:06:31,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2019-09-16 17:06:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-16 17:06:31,556 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,557 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,557 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1649875916, now seen corresponding path program 1 times [2019-09-16 17:06:31,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:31,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:31,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:31,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:31,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:31,645 INFO L87 Difference]: Start difference. First operand 294 states and 441 transitions. Second operand 4 states. [2019-09-16 17:06:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,962 INFO L93 Difference]: Finished difference Result 335 states and 499 transitions. [2019-09-16 17:06:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-16 17:06:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,965 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:06:31,965 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:06:31,966 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:06:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-16 17:06:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 440 transitions. [2019-09-16 17:06:31,972 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 440 transitions. Word has length 114 [2019-09-16 17:06:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,972 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 440 transitions. [2019-09-16 17:06:31,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 440 transitions. [2019-09-16 17:06:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-16 17:06:31,973 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,974 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:31,974 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash 365337133, now seen corresponding path program 1 times [2019-09-16 17:06:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,058 INFO L87 Difference]: Start difference. First operand 294 states and 440 transitions. Second operand 4 states. [2019-09-16 17:06:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:32,411 INFO L93 Difference]: Finished difference Result 335 states and 498 transitions. [2019-09-16 17:06:32,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:32,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-16 17:06:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:32,413 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:06:32,413 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:06:32,413 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:06:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-16 17:06:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2019-09-16 17:06:32,420 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 115 [2019-09-16 17:06:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,420 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2019-09-16 17:06:32,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2019-09-16 17:06:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-16 17:06:32,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,422 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:32,422 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1808480386, now seen corresponding path program 1 times [2019-09-16 17:06:32,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:32,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,506 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand 4 states. [2019-09-16 17:06:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:32,825 INFO L93 Difference]: Finished difference Result 335 states and 497 transitions. [2019-09-16 17:06:32,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:32,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-16 17:06:32,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:32,827 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:06:32,827 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:06:32,828 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:06:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-16 17:06:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 438 transitions. [2019-09-16 17:06:32,834 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 438 transitions. Word has length 116 [2019-09-16 17:06:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,834 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 438 transitions. [2019-09-16 17:06:32,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 438 transitions. [2019-09-16 17:06:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-16 17:06:32,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,836 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:32,836 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1131758348, now seen corresponding path program 1 times [2019-09-16 17:06:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:32,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,923 INFO L87 Difference]: Start difference. First operand 294 states and 438 transitions. Second operand 4 states. [2019-09-16 17:06:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:33,253 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2019-09-16 17:06:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:33,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-16 17:06:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:33,255 INFO L225 Difference]: With dead ends: 333 [2019-09-16 17:06:33,255 INFO L226 Difference]: Without dead ends: 333 [2019-09-16 17:06:33,256 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-16 17:06:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 294. [2019-09-16 17:06:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 437 transitions. [2019-09-16 17:06:33,263 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 437 transitions. Word has length 116 [2019-09-16 17:06:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:33,263 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 437 transitions. [2019-09-16 17:06:33,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 437 transitions. [2019-09-16 17:06:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-16 17:06:33,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:33,265 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:33,265 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash 110289475, now seen corresponding path program 1 times [2019-09-16 17:06:33,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:33,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,357 INFO L87 Difference]: Start difference. First operand 294 states and 437 transitions. Second operand 4 states. [2019-09-16 17:06:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:33,712 INFO L93 Difference]: Finished difference Result 331 states and 490 transitions. [2019-09-16 17:06:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:33,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-16 17:06:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:33,715 INFO L225 Difference]: With dead ends: 331 [2019-09-16 17:06:33,715 INFO L226 Difference]: Without dead ends: 331 [2019-09-16 17:06:33,715 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-16 17:06:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2019-09-16 17:06:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2019-09-16 17:06:33,722 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 117 [2019-09-16 17:06:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:33,722 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2019-09-16 17:06:33,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2019-09-16 17:06:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-16 17:06:33,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:33,724 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:33,724 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 656255755, now seen corresponding path program 1 times [2019-09-16 17:06:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:33,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,803 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand 4 states. [2019-09-16 17:06:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,133 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2019-09-16 17:06:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-16 17:06:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,135 INFO L225 Difference]: With dead ends: 328 [2019-09-16 17:06:34,135 INFO L226 Difference]: Without dead ends: 328 [2019-09-16 17:06:34,136 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-16 17:06:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2019-09-16 17:06:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 435 transitions. [2019-09-16 17:06:34,143 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 435 transitions. Word has length 117 [2019-09-16 17:06:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,144 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 435 transitions. [2019-09-16 17:06:34,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 435 transitions. [2019-09-16 17:06:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:06:34,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,146 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:34,147 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash 775115364, now seen corresponding path program 1 times [2019-09-16 17:06:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:34,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:34,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:34,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:34,242 INFO L87 Difference]: Start difference. First operand 294 states and 435 transitions. Second operand 4 states. [2019-09-16 17:06:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,573 INFO L93 Difference]: Finished difference Result 328 states and 484 transitions. [2019-09-16 17:06:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-16 17:06:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,576 INFO L225 Difference]: With dead ends: 328 [2019-09-16 17:06:34,576 INFO L226 Difference]: Without dead ends: 328 [2019-09-16 17:06:34,576 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-16 17:06:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2019-09-16 17:06:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2019-09-16 17:06:34,582 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 120 [2019-09-16 17:06:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,583 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2019-09-16 17:06:34,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2019-09-16 17:06:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:06:34,584 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,585 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:34,585 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,585 INFO L82 PathProgramCache]: Analyzing trace with hash -82969504, now seen corresponding path program 1 times [2019-09-16 17:06:34,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:34,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:34,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:34,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:34,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:34,665 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand 4 states. [2019-09-16 17:06:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,964 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2019-09-16 17:06:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:06:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,967 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:06:34,967 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:06:34,967 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:06:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2019-09-16 17:06:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 433 transitions. [2019-09-16 17:06:34,974 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 433 transitions. Word has length 121 [2019-09-16 17:06:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,974 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 433 transitions. [2019-09-16 17:06:34,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 433 transitions. [2019-09-16 17:06:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:06:34,976 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,976 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:34,976 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash -430689443, now seen corresponding path program 1 times [2019-09-16 17:06:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:35,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,052 INFO L87 Difference]: Start difference. First operand 294 states and 433 transitions. Second operand 4 states. [2019-09-16 17:06:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,356 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-09-16 17:06:35,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:06:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,359 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:06:35,359 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:06:35,359 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:06:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2019-09-16 17:06:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2019-09-16 17:06:35,365 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 121 [2019-09-16 17:06:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,365 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2019-09-16 17:06:35,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2019-09-16 17:06:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:06:35,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,367 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:35,367 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -38534783, now seen corresponding path program 1 times [2019-09-16 17:06:35,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:35,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,445 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 4 states. [2019-09-16 17:06:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,743 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-09-16 17:06:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-16 17:06:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,746 INFO L225 Difference]: With dead ends: 319 [2019-09-16 17:06:35,746 INFO L226 Difference]: Without dead ends: 319 [2019-09-16 17:06:35,747 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-16 17:06:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2019-09-16 17:06:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2019-09-16 17:06:35,754 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 122 [2019-09-16 17:06:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,755 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2019-09-16 17:06:35,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2019-09-16 17:06:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:06:35,756 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,756 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:35,756 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1029717653, now seen corresponding path program 1 times [2019-09-16 17:06:35,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:35,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,888 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand 4 states. [2019-09-16 17:06:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,197 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2019-09-16 17:06:36,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:36,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:06:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,200 INFO L225 Difference]: With dead ends: 319 [2019-09-16 17:06:36,200 INFO L226 Difference]: Without dead ends: 319 [2019-09-16 17:06:36,200 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-16 17:06:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2019-09-16 17:06:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-16 17:06:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2019-09-16 17:06:36,206 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 123 [2019-09-16 17:06:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,206 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2019-09-16 17:06:36,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2019-09-16 17:06:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:06:36,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,208 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:36,208 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -785927715, now seen corresponding path program 1 times [2019-09-16 17:06:36,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-16 17:06:36,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:36,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:36,290 INFO L87 Difference]: Start difference. First operand 294 states and 430 transitions. Second operand 4 states. [2019-09-16 17:06:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,699 INFO L93 Difference]: Finished difference Result 366 states and 541 transitions. [2019-09-16 17:06:36,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:36,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:06:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,702 INFO L225 Difference]: With dead ends: 366 [2019-09-16 17:06:36,702 INFO L226 Difference]: Without dead ends: 366 [2019-09-16 17:06:36,702 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-16 17:06:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 326. [2019-09-16 17:06:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-16 17:06:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2019-09-16 17:06:36,711 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 123 [2019-09-16 17:06:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,712 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2019-09-16 17:06:36,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2019-09-16 17:06:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:06:36,713 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,714 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:36,714 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205657, now seen corresponding path program 1 times [2019-09-16 17:06:36,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:36,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:36,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:36,801 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand 4 states. [2019-09-16 17:06:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,115 INFO L93 Difference]: Finished difference Result 348 states and 519 transitions. [2019-09-16 17:06:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:37,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:06:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,118 INFO L225 Difference]: With dead ends: 348 [2019-09-16 17:06:37,118 INFO L226 Difference]: Without dead ends: 348 [2019-09-16 17:06:37,118 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-16 17:06:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 326. [2019-09-16 17:06:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-16 17:06:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2019-09-16 17:06:37,125 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 124 [2019-09-16 17:06:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,125 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2019-09-16 17:06:37,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2019-09-16 17:06:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:06:37,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,127 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:37,127 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1369279331, now seen corresponding path program 1 times [2019-09-16 17:06:37,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:37,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:37,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:37,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:37,202 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand 4 states. [2019-09-16 17:06:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,641 INFO L93 Difference]: Finished difference Result 436 states and 657 transitions. [2019-09-16 17:06:37,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:37,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:06:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,644 INFO L225 Difference]: With dead ends: 436 [2019-09-16 17:06:37,644 INFO L226 Difference]: Without dead ends: 436 [2019-09-16 17:06:37,644 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-16 17:06:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 365. [2019-09-16 17:06:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-16 17:06:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 557 transitions. [2019-09-16 17:06:37,650 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 557 transitions. Word has length 124 [2019-09-16 17:06:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,650 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 557 transitions. [2019-09-16 17:06:37,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 557 transitions. [2019-09-16 17:06:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-16 17:06:37,651 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,652 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:37,652 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1816097254, now seen corresponding path program 1 times [2019-09-16 17:06:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:37,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:37,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:37,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:37,724 INFO L87 Difference]: Start difference. First operand 365 states and 557 transitions. Second operand 4 states. [2019-09-16 17:06:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,003 INFO L93 Difference]: Finished difference Result 392 states and 591 transitions. [2019-09-16 17:06:38,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:38,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-16 17:06:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,006 INFO L225 Difference]: With dead ends: 392 [2019-09-16 17:06:38,007 INFO L226 Difference]: Without dead ends: 392 [2019-09-16 17:06:38,007 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-16 17:06:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2019-09-16 17:06:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-16 17:06:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 556 transitions. [2019-09-16 17:06:38,012 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 556 transitions. Word has length 125 [2019-09-16 17:06:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,013 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 556 transitions. [2019-09-16 17:06:38,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions. [2019-09-16 17:06:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-16 17:06:38,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,014 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:38,015 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash 639566481, now seen corresponding path program 1 times [2019-09-16 17:06:38,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:38,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:38,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:38,089 INFO L87 Difference]: Start difference. First operand 365 states and 556 transitions. Second operand 4 states. [2019-09-16 17:06:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,495 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2019-09-16 17:06:38,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:38,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-16 17:06:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,498 INFO L225 Difference]: With dead ends: 428 [2019-09-16 17:06:38,498 INFO L226 Difference]: Without dead ends: 428 [2019-09-16 17:06:38,499 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-09-16 17:06:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 364. [2019-09-16 17:06:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-16 17:06:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 555 transitions. [2019-09-16 17:06:38,507 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 555 transitions. Word has length 125 [2019-09-16 17:06:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,508 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 555 transitions. [2019-09-16 17:06:38,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 555 transitions. [2019-09-16 17:06:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-16 17:06:38,509 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,510 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:38,510 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash -237737633, now seen corresponding path program 1 times [2019-09-16 17:06:38,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:38,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:38,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:38,595 INFO L87 Difference]: Start difference. First operand 364 states and 555 transitions. Second operand 4 states. [2019-09-16 17:06:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,919 INFO L93 Difference]: Finished difference Result 391 states and 589 transitions. [2019-09-16 17:06:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:38,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-16 17:06:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,921 INFO L225 Difference]: With dead ends: 391 [2019-09-16 17:06:38,922 INFO L226 Difference]: Without dead ends: 391 [2019-09-16 17:06:38,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-16 17:06:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2019-09-16 17:06:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-16 17:06:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 554 transitions. [2019-09-16 17:06:38,927 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 554 transitions. Word has length 126 [2019-09-16 17:06:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,927 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 554 transitions. [2019-09-16 17:06:38,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 554 transitions. [2019-09-16 17:06:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-16 17:06:38,929 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,931 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:38,932 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1999708181, now seen corresponding path program 1 times [2019-09-16 17:06:38,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:39,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:39,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:39,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:39,006 INFO L87 Difference]: Start difference. First operand 364 states and 554 transitions. Second operand 4 states. [2019-09-16 17:06:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,305 INFO L93 Difference]: Finished difference Result 391 states and 588 transitions. [2019-09-16 17:06:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:39,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-16 17:06:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,308 INFO L225 Difference]: With dead ends: 391 [2019-09-16 17:06:39,308 INFO L226 Difference]: Without dead ends: 391 [2019-09-16 17:06:39,309 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-16 17:06:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2019-09-16 17:06:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-16 17:06:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2019-09-16 17:06:39,315 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 127 [2019-09-16 17:06:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,316 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2019-09-16 17:06:39,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2019-09-16 17:06:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:06:39,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,318 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:39,318 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1100977798, now seen corresponding path program 1 times [2019-09-16 17:06:39,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:39,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:39,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:39,397 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 4 states. [2019-09-16 17:06:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,669 INFO L93 Difference]: Finished difference Result 381 states and 575 transitions. [2019-09-16 17:06:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:39,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:06:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,671 INFO L225 Difference]: With dead ends: 381 [2019-09-16 17:06:39,671 INFO L226 Difference]: Without dead ends: 381 [2019-09-16 17:06:39,672 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-16 17:06:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 364. [2019-09-16 17:06:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-16 17:06:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2019-09-16 17:06:39,678 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 128 [2019-09-16 17:06:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,678 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2019-09-16 17:06:39,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2019-09-16 17:06:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-16 17:06:39,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,680 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:39,680 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1151985996, now seen corresponding path program 1 times [2019-09-16 17:06:39,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:39,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:39,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:39,751 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2019-09-16 17:06:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,824 INFO L93 Difference]: Finished difference Result 699 states and 1056 transitions. [2019-09-16 17:06:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:39,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-16 17:06:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,828 INFO L225 Difference]: With dead ends: 699 [2019-09-16 17:06:39,828 INFO L226 Difference]: Without dead ends: 699 [2019-09-16 17:06:39,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-16 17:06:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2019-09-16 17:06:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-16 17:06:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-09-16 17:06:39,839 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 129 [2019-09-16 17:06:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,839 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-09-16 17:06:39,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-09-16 17:06:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-16 17:06:39,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,842 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:39,842 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,842 INFO L82 PathProgramCache]: Analyzing trace with hash -369166995, now seen corresponding path program 1 times [2019-09-16 17:06:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:39,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:39,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:39,926 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-09-16 17:06:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:40,339 INFO L93 Difference]: Finished difference Result 913 states and 1383 transitions. [2019-09-16 17:06:40,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:40,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-16 17:06:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:40,345 INFO L225 Difference]: With dead ends: 913 [2019-09-16 17:06:40,345 INFO L226 Difference]: Without dead ends: 913 [2019-09-16 17:06:40,346 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-16 17:06:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 775. [2019-09-16 17:06:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-09-16 17:06:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1197 transitions. [2019-09-16 17:06:40,358 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1197 transitions. Word has length 131 [2019-09-16 17:06:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:40,359 INFO L475 AbstractCegarLoop]: Abstraction has 775 states and 1197 transitions. [2019-09-16 17:06:40,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1197 transitions. [2019-09-16 17:06:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-16 17:06:40,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:40,361 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:40,361 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1712662073, now seen corresponding path program 1 times [2019-09-16 17:06:40,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:40,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:40,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:40,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:40,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:40,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:40,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:40,440 INFO L87 Difference]: Start difference. First operand 775 states and 1197 transitions. Second operand 4 states. [2019-09-16 17:06:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:40,851 INFO L93 Difference]: Finished difference Result 901 states and 1366 transitions. [2019-09-16 17:06:40,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:40,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-16 17:06:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:40,856 INFO L225 Difference]: With dead ends: 901 [2019-09-16 17:06:40,856 INFO L226 Difference]: Without dead ends: 901 [2019-09-16 17:06:40,857 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-16 17:06:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 697. [2019-09-16 17:06:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-16 17:06:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-09-16 17:06:40,867 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 132 [2019-09-16 17:06:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:40,867 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-09-16 17:06:40,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-09-16 17:06:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-16 17:06:40,869 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:40,869 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:40,870 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1341406511, now seen corresponding path program 1 times [2019-09-16 17:06:40,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:40,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:40,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:40,952 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-09-16 17:06:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:41,245 INFO L93 Difference]: Finished difference Result 729 states and 1097 transitions. [2019-09-16 17:06:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:41,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-16 17:06:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:41,248 INFO L225 Difference]: With dead ends: 729 [2019-09-16 17:06:41,248 INFO L226 Difference]: Without dead ends: 729 [2019-09-16 17:06:41,249 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-09-16 17:06:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2019-09-16 17:06:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-16 17:06:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1061 transitions. [2019-09-16 17:06:41,258 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1061 transitions. Word has length 133 [2019-09-16 17:06:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:41,258 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1061 transitions. [2019-09-16 17:06:41,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1061 transitions. [2019-09-16 17:06:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-16 17:06:41,260 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:41,260 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:41,261 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2100763372, now seen corresponding path program 1 times [2019-09-16 17:06:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:41,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:41,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:41,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:41,355 INFO L87 Difference]: Start difference. First operand 703 states and 1061 transitions. Second operand 4 states. [2019-09-16 17:06:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:41,620 INFO L93 Difference]: Finished difference Result 737 states and 1105 transitions. [2019-09-16 17:06:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:41,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-16 17:06:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:41,624 INFO L225 Difference]: With dead ends: 737 [2019-09-16 17:06:41,624 INFO L226 Difference]: Without dead ends: 737 [2019-09-16 17:06:41,625 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-16 17:06:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 703. [2019-09-16 17:06:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-16 17:06:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1059 transitions. [2019-09-16 17:06:41,632 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1059 transitions. Word has length 138 [2019-09-16 17:06:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:41,632 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1059 transitions. [2019-09-16 17:06:41,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1059 transitions. [2019-09-16 17:06:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-16 17:06:41,634 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:41,634 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:41,634 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash -663860235, now seen corresponding path program 1 times [2019-09-16 17:06:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:41,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:41,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:41,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:41,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:41,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:41,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:41,725 INFO L87 Difference]: Start difference. First operand 703 states and 1059 transitions. Second operand 4 states. [2019-09-16 17:06:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:42,083 INFO L93 Difference]: Finished difference Result 829 states and 1253 transitions. [2019-09-16 17:06:42,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:42,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-16 17:06:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:42,088 INFO L225 Difference]: With dead ends: 829 [2019-09-16 17:06:42,088 INFO L226 Difference]: Without dead ends: 829 [2019-09-16 17:06:42,088 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-16 17:06:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 759. [2019-09-16 17:06:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-16 17:06:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1157 transitions. [2019-09-16 17:06:42,099 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1157 transitions. Word has length 138 [2019-09-16 17:06:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:42,099 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1157 transitions. [2019-09-16 17:06:42,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1157 transitions. [2019-09-16 17:06:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-16 17:06:42,103 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:42,103 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-09-16 17:06:42,103 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash 462308518, now seen corresponding path program 1 times [2019-09-16 17:06:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:42,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:42,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:42,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:42,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:42,188 INFO L87 Difference]: Start difference. First operand 759 states and 1157 transitions. Second operand 4 states. [2019-09-16 17:06:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:42,572 INFO L93 Difference]: Finished difference Result 963 states and 1466 transitions. [2019-09-16 17:06:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:42,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-16 17:06:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:42,576 INFO L225 Difference]: With dead ends: 963 [2019-09-16 17:06:42,576 INFO L226 Difference]: Without dead ends: 963 [2019-09-16 17:06:42,576 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-16 17:06:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 783. [2019-09-16 17:06:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:06:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1191 transitions. [2019-09-16 17:06:42,586 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1191 transitions. Word has length 139 [2019-09-16 17:06:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:42,586 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1191 transitions. [2019-09-16 17:06:42,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1191 transitions. [2019-09-16 17:06:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-16 17:06:42,588 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:42,589 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 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] [2019-09-16 17:06:42,589 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1617694983, now seen corresponding path program 1 times [2019-09-16 17:06:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:42,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:42,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:42,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:42,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:42,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:42,665 INFO L87 Difference]: Start difference. First operand 783 states and 1191 transitions. Second operand 4 states. [2019-09-16 17:06:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:42,942 INFO L93 Difference]: Finished difference Result 813 states and 1231 transitions. [2019-09-16 17:06:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:42,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-16 17:06:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:42,947 INFO L225 Difference]: With dead ends: 813 [2019-09-16 17:06:42,947 INFO L226 Difference]: Without dead ends: 813 [2019-09-16 17:06:42,948 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-16 17:06:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 783. [2019-09-16 17:06:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-16 17:06:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1189 transitions. [2019-09-16 17:06:42,959 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1189 transitions. Word has length 139 [2019-09-16 17:06:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:42,960 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1189 transitions. [2019-09-16 17:06:42,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1189 transitions. [2019-09-16 17:06:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:06:42,962 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:42,962 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-09-16 17:06:42,962 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1673364563, now seen corresponding path program 1 times [2019-09-16 17:06:42,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:43,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:43,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:43,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:43,044 INFO L87 Difference]: Start difference. First operand 783 states and 1189 transitions. Second operand 4 states. [2019-09-16 17:06:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:43,423 INFO L93 Difference]: Finished difference Result 963 states and 1462 transitions. [2019-09-16 17:06:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:43,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-16 17:06:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:43,428 INFO L225 Difference]: With dead ends: 963 [2019-09-16 17:06:43,429 INFO L226 Difference]: Without dead ends: 963 [2019-09-16 17:06:43,429 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-16 17:06:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 785. [2019-09-16 17:06:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-16 17:06:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1191 transitions. [2019-09-16 17:06:43,438 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1191 transitions. Word has length 140 [2019-09-16 17:06:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:43,438 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1191 transitions. [2019-09-16 17:06:43,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1191 transitions. [2019-09-16 17:06:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:06:43,439 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:43,440 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-09-16 17:06:43,440 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1114334113, now seen corresponding path program 1 times [2019-09-16 17:06:43,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:43,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:43,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:43,518 INFO L87 Difference]: Start difference. First operand 785 states and 1191 transitions. Second operand 4 states. [2019-09-16 17:06:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:43,893 INFO L93 Difference]: Finished difference Result 963 states and 1460 transitions. [2019-09-16 17:06:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:43,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:06:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:43,900 INFO L225 Difference]: With dead ends: 963 [2019-09-16 17:06:43,900 INFO L226 Difference]: Without dead ends: 963 [2019-09-16 17:06:43,900 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-16 17:06:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 787. [2019-09-16 17:06:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-09-16 17:06:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1193 transitions. [2019-09-16 17:06:43,910 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1193 transitions. Word has length 141 [2019-09-16 17:06:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:43,910 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1193 transitions. [2019-09-16 17:06:43,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1193 transitions. [2019-09-16 17:06:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:06:43,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:43,912 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-09-16 17:06:43,912 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1517197166, now seen corresponding path program 1 times [2019-09-16 17:06:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:43,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:43,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:43,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:43,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:43,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:43,986 INFO L87 Difference]: Start difference. First operand 787 states and 1193 transitions. Second operand 4 states. [2019-09-16 17:06:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:44,386 INFO L93 Difference]: Finished difference Result 943 states and 1434 transitions. [2019-09-16 17:06:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:44,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:06:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:44,393 INFO L225 Difference]: With dead ends: 943 [2019-09-16 17:06:44,393 INFO L226 Difference]: Without dead ends: 943 [2019-09-16 17:06:44,394 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-16 17:06:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 789. [2019-09-16 17:06:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-16 17:06:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1195 transitions. [2019-09-16 17:06:44,405 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1195 transitions. Word has length 142 [2019-09-16 17:06:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:44,405 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1195 transitions. [2019-09-16 17:06:44,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1195 transitions. [2019-09-16 17:06:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 17:06:44,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:44,407 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:44,407 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash -895597220, now seen corresponding path program 1 times [2019-09-16 17:06:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:44,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:44,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:44,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:44,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:44,480 INFO L87 Difference]: Start difference. First operand 789 states and 1195 transitions. Second operand 4 states. [2019-09-16 17:06:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:44,894 INFO L93 Difference]: Finished difference Result 963 states and 1456 transitions. [2019-09-16 17:06:44,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:44,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-16 17:06:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:44,900 INFO L225 Difference]: With dead ends: 963 [2019-09-16 17:06:44,900 INFO L226 Difference]: Without dead ends: 963 [2019-09-16 17:06:44,900 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-16 17:06:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2019-09-16 17:06:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-16 17:06:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1193 transitions. [2019-09-16 17:06:44,911 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1193 transitions. Word has length 146 [2019-09-16 17:06:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:44,911 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1193 transitions. [2019-09-16 17:06:44,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1193 transitions. [2019-09-16 17:06:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:06:44,913 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:44,913 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:44,914 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:44,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1767007651, now seen corresponding path program 1 times [2019-09-16 17:06:44,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:44,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:44,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:44,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:44,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:44,990 INFO L87 Difference]: Start difference. First operand 789 states and 1193 transitions. Second operand 4 states. [2019-09-16 17:06:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:45,408 INFO L93 Difference]: Finished difference Result 963 states and 1454 transitions. [2019-09-16 17:06:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:45,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-16 17:06:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:45,412 INFO L225 Difference]: With dead ends: 963 [2019-09-16 17:06:45,412 INFO L226 Difference]: Without dead ends: 963 [2019-09-16 17:06:45,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-16 17:06:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2019-09-16 17:06:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-16 17:06:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1191 transitions. [2019-09-16 17:06:45,422 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1191 transitions. Word has length 147 [2019-09-16 17:06:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:45,422 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1191 transitions. [2019-09-16 17:06:45,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1191 transitions. [2019-09-16 17:06:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-16 17:06:45,424 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:45,424 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:45,424 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1836977879, now seen corresponding path program 1 times [2019-09-16 17:06:45,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:45,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:45,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:45,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:45,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:45,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:45,483 INFO L87 Difference]: Start difference. First operand 789 states and 1191 transitions. Second operand 4 states. [2019-09-16 17:06:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:45,894 INFO L93 Difference]: Finished difference Result 963 states and 1452 transitions. [2019-09-16 17:06:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:45,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-16 17:06:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:45,897 INFO L225 Difference]: With dead ends: 963 [2019-09-16 17:06:45,897 INFO L226 Difference]: Without dead ends: 963 [2019-09-16 17:06:45,898 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-16 17:06:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2019-09-16 17:06:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-16 17:06:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1189 transitions. [2019-09-16 17:06:45,906 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1189 transitions. Word has length 148 [2019-09-16 17:06:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:45,906 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1189 transitions. [2019-09-16 17:06:45,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1189 transitions. [2019-09-16 17:06:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:06:45,907 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:45,908 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:45,908 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1850649864, now seen corresponding path program 1 times [2019-09-16 17:06:45,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:45,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:45,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:45,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:45,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:45,985 INFO L87 Difference]: Start difference. First operand 789 states and 1189 transitions. Second operand 4 states. [2019-09-16 17:06:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:46,369 INFO L93 Difference]: Finished difference Result 943 states and 1426 transitions. [2019-09-16 17:06:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:46,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:06:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:46,372 INFO L225 Difference]: With dead ends: 943 [2019-09-16 17:06:46,372 INFO L226 Difference]: Without dead ends: 943 [2019-09-16 17:06:46,373 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-16 17:06:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 759. [2019-09-16 17:06:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-16 17:06:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1147 transitions. [2019-09-16 17:06:46,384 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1147 transitions. Word has length 149 [2019-09-16 17:06:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:46,384 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1147 transitions. [2019-09-16 17:06:46,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1147 transitions. [2019-09-16 17:06:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:06:46,386 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:46,387 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:46,387 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1097081734, now seen corresponding path program 1 times [2019-09-16 17:06:46,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:46,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:46,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:46,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:46,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:46,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:46,460 INFO L87 Difference]: Start difference. First operand 759 states and 1147 transitions. Second operand 4 states. [2019-09-16 17:06:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:46,862 INFO L93 Difference]: Finished difference Result 943 states and 1424 transitions. [2019-09-16 17:06:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:46,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:06:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:46,865 INFO L225 Difference]: With dead ends: 943 [2019-09-16 17:06:46,865 INFO L226 Difference]: Without dead ends: 943 [2019-09-16 17:06:46,866 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-16 17:06:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 815. [2019-09-16 17:06:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-09-16 17:06:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1237 transitions. [2019-09-16 17:06:46,877 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1237 transitions. Word has length 149 [2019-09-16 17:06:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:46,878 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1237 transitions. [2019-09-16 17:06:46,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1237 transitions. [2019-09-16 17:06:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-16 17:06:46,880 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:46,880 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:46,880 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2109117965, now seen corresponding path program 1 times [2019-09-16 17:06:46,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:46,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:46,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:46,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:46,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:46,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:46,953 INFO L87 Difference]: Start difference. First operand 815 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:47,349 INFO L93 Difference]: Finished difference Result 927 states and 1396 transitions. [2019-09-16 17:06:47,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:47,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-16 17:06:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:47,350 INFO L225 Difference]: With dead ends: 927 [2019-09-16 17:06:47,351 INFO L226 Difference]: Without dead ends: 927 [2019-09-16 17:06:47,351 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-16 17:06:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2019-09-16 17:06:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-16 17:06:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1239 transitions. [2019-09-16 17:06:47,358 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1239 transitions. Word has length 150 [2019-09-16 17:06:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:47,358 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1239 transitions. [2019-09-16 17:06:47,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1239 transitions. [2019-09-16 17:06:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:06:47,359 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:47,359 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 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] [2019-09-16 17:06:47,360 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:47,360 INFO L82 PathProgramCache]: Analyzing trace with hash -47487008, now seen corresponding path program 1 times [2019-09-16 17:06:47,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:47,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:47,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:47,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:47,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:47,431 INFO L87 Difference]: Start difference. First operand 817 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:47,772 INFO L93 Difference]: Finished difference Result 927 states and 1394 transitions. [2019-09-16 17:06:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:47,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:47,775 INFO L225 Difference]: With dead ends: 927 [2019-09-16 17:06:47,775 INFO L226 Difference]: Without dead ends: 927 [2019-09-16 17:06:47,776 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-16 17:06:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2019-09-16 17:06:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-16 17:06:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1237 transitions. [2019-09-16 17:06:47,787 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1237 transitions. Word has length 152 [2019-09-16 17:06:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:47,787 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1237 transitions. [2019-09-16 17:06:47,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1237 transitions. [2019-09-16 17:06:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:47,789 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:47,789 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:47,790 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash -848144508, now seen corresponding path program 1 times [2019-09-16 17:06:47,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:47,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:47,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:47,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:47,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:47,872 INFO L87 Difference]: Start difference. First operand 817 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:48,232 INFO L93 Difference]: Finished difference Result 921 states and 1384 transitions. [2019-09-16 17:06:48,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:48,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:48,234 INFO L225 Difference]: With dead ends: 921 [2019-09-16 17:06:48,235 INFO L226 Difference]: Without dead ends: 921 [2019-09-16 17:06:48,235 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-16 17:06:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 823. [2019-09-16 17:06:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-16 17:06:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1247 transitions. [2019-09-16 17:06:48,245 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1247 transitions. Word has length 153 [2019-09-16 17:06:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:48,245 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1247 transitions. [2019-09-16 17:06:48,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1247 transitions. [2019-09-16 17:06:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:48,247 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:48,247 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 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] [2019-09-16 17:06:48,247 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -553557357, now seen corresponding path program 1 times [2019-09-16 17:06:48,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:48,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:48,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:48,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:48,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:48,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:48,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:48,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:48,311 INFO L87 Difference]: Start difference. First operand 823 states and 1247 transitions. Second operand 4 states. [2019-09-16 17:06:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:48,633 INFO L93 Difference]: Finished difference Result 917 states and 1378 transitions. [2019-09-16 17:06:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:48,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:48,636 INFO L225 Difference]: With dead ends: 917 [2019-09-16 17:06:48,636 INFO L226 Difference]: Without dead ends: 917 [2019-09-16 17:06:48,636 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-16 17:06:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 823. [2019-09-16 17:06:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-16 17:06:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1245 transitions. [2019-09-16 17:06:48,646 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1245 transitions. Word has length 153 [2019-09-16 17:06:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:48,646 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1245 transitions. [2019-09-16 17:06:48,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1245 transitions. [2019-09-16 17:06:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:48,648 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:48,648 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:48,648 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash 643173844, now seen corresponding path program 1 times [2019-09-16 17:06:48,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:48,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:48,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:48,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:48,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:48,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:48,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:48,715 INFO L87 Difference]: Start difference. First operand 823 states and 1245 transitions. Second operand 4 states. [2019-09-16 17:06:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:49,072 INFO L93 Difference]: Finished difference Result 893 states and 1339 transitions. [2019-09-16 17:06:49,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:49,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:49,075 INFO L225 Difference]: With dead ends: 893 [2019-09-16 17:06:49,075 INFO L226 Difference]: Without dead ends: 893 [2019-09-16 17:06:49,075 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-16 17:06:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-09-16 17:06:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-16 17:06:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1243 transitions. [2019-09-16 17:06:49,084 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1243 transitions. Word has length 153 [2019-09-16 17:06:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:49,085 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1243 transitions. [2019-09-16 17:06:49,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1243 transitions. [2019-09-16 17:06:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:49,087 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:49,087 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:49,087 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:49,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1309744923, now seen corresponding path program 1 times [2019-09-16 17:06:49,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:49,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:49,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:49,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:49,163 INFO L87 Difference]: Start difference. First operand 823 states and 1243 transitions. Second operand 4 states. [2019-09-16 17:06:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:49,518 INFO L93 Difference]: Finished difference Result 893 states and 1337 transitions. [2019-09-16 17:06:49,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:49,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:49,521 INFO L225 Difference]: With dead ends: 893 [2019-09-16 17:06:49,521 INFO L226 Difference]: Without dead ends: 893 [2019-09-16 17:06:49,522 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-16 17:06:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-09-16 17:06:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-16 17:06:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1241 transitions. [2019-09-16 17:06:49,531 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1241 transitions. Word has length 154 [2019-09-16 17:06:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:49,531 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1241 transitions. [2019-09-16 17:06:49,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1241 transitions. [2019-09-16 17:06:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:49,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:49,533 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:49,533 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1167746737, now seen corresponding path program 1 times [2019-09-16 17:06:49,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:49,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:49,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:49,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:49,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:49,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:49,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:49,600 INFO L87 Difference]: Start difference. First operand 823 states and 1241 transitions. Second operand 4 states. [2019-09-16 17:06:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:49,972 INFO L93 Difference]: Finished difference Result 893 states and 1335 transitions. [2019-09-16 17:06:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:49,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:49,975 INFO L225 Difference]: With dead ends: 893 [2019-09-16 17:06:49,975 INFO L226 Difference]: Without dead ends: 893 [2019-09-16 17:06:49,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-16 17:06:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-09-16 17:06:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-16 17:06:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1239 transitions. [2019-09-16 17:06:49,982 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1239 transitions. Word has length 155 [2019-09-16 17:06:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:49,982 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1239 transitions. [2019-09-16 17:06:49,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1239 transitions. [2019-09-16 17:06:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:49,984 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:49,984 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:49,984 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 923482300, now seen corresponding path program 1 times [2019-09-16 17:06:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:50,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:50,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:50,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:50,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:50,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:50,069 INFO L87 Difference]: Start difference. First operand 823 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:50,484 INFO L93 Difference]: Finished difference Result 943 states and 1408 transitions. [2019-09-16 17:06:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:50,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:50,487 INFO L225 Difference]: With dead ends: 943 [2019-09-16 17:06:50,488 INFO L226 Difference]: Without dead ends: 943 [2019-09-16 17:06:50,488 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-16 17:06:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 823. [2019-09-16 17:06:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-16 17:06:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1237 transitions. [2019-09-16 17:06:50,498 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1237 transitions. Word has length 156 [2019-09-16 17:06:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:50,499 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1237 transitions. [2019-09-16 17:06:50,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1237 transitions. [2019-09-16 17:06:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:50,501 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:50,501 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:50,501 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1170614091, now seen corresponding path program 1 times [2019-09-16 17:06:50,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:50,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:50,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:50,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:50,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:50,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:50,591 INFO L87 Difference]: Start difference. First operand 823 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:50,931 INFO L93 Difference]: Finished difference Result 917 states and 1368 transitions. [2019-09-16 17:06:50,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:50,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:50,933 INFO L225 Difference]: With dead ends: 917 [2019-09-16 17:06:50,934 INFO L226 Difference]: Without dead ends: 917 [2019-09-16 17:06:50,934 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-16 17:06:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 825. [2019-09-16 17:06:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-16 17:06:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1239 transitions. [2019-09-16 17:06:50,947 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1239 transitions. Word has length 156 [2019-09-16 17:06:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:50,947 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1239 transitions. [2019-09-16 17:06:50,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1239 transitions. [2019-09-16 17:06:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:50,949 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:50,949 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:50,950 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash -507832448, now seen corresponding path program 1 times [2019-09-16 17:06:50,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:50,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:51,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:51,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:51,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:51,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:51,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:51,019 INFO L87 Difference]: Start difference. First operand 825 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:51,327 INFO L93 Difference]: Finished difference Result 875 states and 1309 transitions. [2019-09-16 17:06:51,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:51,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:51,329 INFO L225 Difference]: With dead ends: 875 [2019-09-16 17:06:51,329 INFO L226 Difference]: Without dead ends: 875 [2019-09-16 17:06:51,329 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-09-16 17:06:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 825. [2019-09-16 17:06:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-16 17:06:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1237 transitions. [2019-09-16 17:06:51,339 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1237 transitions. Word has length 156 [2019-09-16 17:06:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:51,339 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1237 transitions. [2019-09-16 17:06:51,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1237 transitions. [2019-09-16 17:06:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:51,342 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:51,342 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:51,342 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1099234173, now seen corresponding path program 1 times [2019-09-16 17:06:51,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:51,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:51,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:51,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:51,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:51,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:51,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:51,412 INFO L87 Difference]: Start difference. First operand 825 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:51,793 INFO L93 Difference]: Finished difference Result 927 states and 1376 transitions. [2019-09-16 17:06:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:51,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:51,796 INFO L225 Difference]: With dead ends: 927 [2019-09-16 17:06:51,796 INFO L226 Difference]: Without dead ends: 927 [2019-09-16 17:06:51,796 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-16 17:06:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 825. [2019-09-16 17:06:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-16 17:06:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1235 transitions. [2019-09-16 17:06:51,805 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1235 transitions. Word has length 157 [2019-09-16 17:06:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:51,805 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1235 transitions. [2019-09-16 17:06:51,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1235 transitions. [2019-09-16 17:06:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:51,806 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:51,806 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:51,807 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash -707410855, now seen corresponding path program 1 times [2019-09-16 17:06:51,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:51,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:51,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:51,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:51,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:51,869 INFO L87 Difference]: Start difference. First operand 825 states and 1235 transitions. Second operand 4 states. [2019-09-16 17:06:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:52,191 INFO L93 Difference]: Finished difference Result 905 states and 1346 transitions. [2019-09-16 17:06:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:52,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:52,193 INFO L225 Difference]: With dead ends: 905 [2019-09-16 17:06:52,193 INFO L226 Difference]: Without dead ends: 905 [2019-09-16 17:06:52,193 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-16 17:06:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 827. [2019-09-16 17:06:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-09-16 17:06:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1237 transitions. [2019-09-16 17:06:52,205 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1237 transitions. Word has length 157 [2019-09-16 17:06:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:52,205 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 1237 transitions. [2019-09-16 17:06:52,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1237 transitions. [2019-09-16 17:06:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:52,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:52,209 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:52,211 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -631484072, now seen corresponding path program 1 times [2019-09-16 17:06:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:52,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:52,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:52,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:52,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:52,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:52,273 INFO L87 Difference]: Start difference. First operand 827 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:52,590 INFO L93 Difference]: Finished difference Result 905 states and 1344 transitions. [2019-09-16 17:06:52,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:52,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:52,592 INFO L225 Difference]: With dead ends: 905 [2019-09-16 17:06:52,593 INFO L226 Difference]: Without dead ends: 905 [2019-09-16 17:06:52,593 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-16 17:06:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 829. [2019-09-16 17:06:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-16 17:06:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1239 transitions. [2019-09-16 17:06:52,602 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1239 transitions. Word has length 157 [2019-09-16 17:06:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:52,602 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1239 transitions. [2019-09-16 17:06:52,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1239 transitions. [2019-09-16 17:06:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:52,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:52,604 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:52,604 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1792700758, now seen corresponding path program 1 times [2019-09-16 17:06:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:52,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:52,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:52,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:52,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:52,678 INFO L87 Difference]: Start difference. First operand 829 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:53,110 INFO L93 Difference]: Finished difference Result 899 states and 1335 transitions. [2019-09-16 17:06:53,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:53,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:53,113 INFO L225 Difference]: With dead ends: 899 [2019-09-16 17:06:53,113 INFO L226 Difference]: Without dead ends: 899 [2019-09-16 17:06:53,113 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-16 17:06:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 831. [2019-09-16 17:06:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-16 17:06:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1241 transitions. [2019-09-16 17:06:53,125 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1241 transitions. Word has length 158 [2019-09-16 17:06:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:53,125 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1241 transitions. [2019-09-16 17:06:53,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1241 transitions. [2019-09-16 17:06:53,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:53,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:53,128 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:53,128 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:53,128 INFO L82 PathProgramCache]: Analyzing trace with hash -607600918, now seen corresponding path program 1 times [2019-09-16 17:06:53,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:53,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:53,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:53,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:53,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:53,230 INFO L87 Difference]: Start difference. First operand 831 states and 1241 transitions. Second operand 4 states. [2019-09-16 17:06:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:53,593 INFO L93 Difference]: Finished difference Result 927 states and 1368 transitions. [2019-09-16 17:06:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:53,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:53,596 INFO L225 Difference]: With dead ends: 927 [2019-09-16 17:06:53,596 INFO L226 Difference]: Without dead ends: 927 [2019-09-16 17:06:53,596 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-16 17:06:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-09-16 17:06:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-16 17:06:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1239 transitions. [2019-09-16 17:06:53,605 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1239 transitions. Word has length 159 [2019-09-16 17:06:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:53,605 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1239 transitions. [2019-09-16 17:06:53,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1239 transitions. [2019-09-16 17:06:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:53,606 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:53,606 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:53,607 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1634319792, now seen corresponding path program 1 times [2019-09-16 17:06:53,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:53,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:53,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:53,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:53,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:53,689 INFO L87 Difference]: Start difference. First operand 831 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:54,004 INFO L93 Difference]: Finished difference Result 899 states and 1331 transitions. [2019-09-16 17:06:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:54,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:54,006 INFO L225 Difference]: With dead ends: 899 [2019-09-16 17:06:54,006 INFO L226 Difference]: Without dead ends: 899 [2019-09-16 17:06:54,006 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-16 17:06:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 833. [2019-09-16 17:06:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-16 17:06:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1241 transitions. [2019-09-16 17:06:54,014 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1241 transitions. Word has length 159 [2019-09-16 17:06:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:54,014 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1241 transitions. [2019-09-16 17:06:54,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1241 transitions. [2019-09-16 17:06:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:54,015 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:54,016 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:54,016 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1031806534, now seen corresponding path program 1 times [2019-09-16 17:06:54,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:54,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:54,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:54,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:54,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:54,079 INFO L87 Difference]: Start difference. First operand 833 states and 1241 transitions. Second operand 4 states. [2019-09-16 17:06:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:54,417 INFO L93 Difference]: Finished difference Result 921 states and 1356 transitions. [2019-09-16 17:06:54,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:54,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:54,418 INFO L225 Difference]: With dead ends: 921 [2019-09-16 17:06:54,419 INFO L226 Difference]: Without dead ends: 921 [2019-09-16 17:06:54,419 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-16 17:06:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 833. [2019-09-16 17:06:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-16 17:06:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1239 transitions. [2019-09-16 17:06:54,430 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1239 transitions. Word has length 160 [2019-09-16 17:06:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:54,430 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1239 transitions. [2019-09-16 17:06:54,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1239 transitions. [2019-09-16 17:06:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:54,432 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:54,433 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:54,433 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -737219383, now seen corresponding path program 1 times [2019-09-16 17:06:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:54,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:54,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:54,509 INFO L87 Difference]: Start difference. First operand 833 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:54,831 INFO L93 Difference]: Finished difference Result 917 states and 1350 transitions. [2019-09-16 17:06:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:54,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:54,835 INFO L225 Difference]: With dead ends: 917 [2019-09-16 17:06:54,835 INFO L226 Difference]: Without dead ends: 917 [2019-09-16 17:06:54,835 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-16 17:06:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 833. [2019-09-16 17:06:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-16 17:06:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1237 transitions. [2019-09-16 17:06:54,844 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1237 transitions. Word has length 160 [2019-09-16 17:06:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:54,845 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1237 transitions. [2019-09-16 17:06:54,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1237 transitions. [2019-09-16 17:06:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:54,847 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:54,847 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:54,847 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash 350923714, now seen corresponding path program 1 times [2019-09-16 17:06:54,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:54,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:54,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:54,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:54,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:54,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:54,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:54,923 INFO L87 Difference]: Start difference. First operand 833 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:55,235 INFO L93 Difference]: Finished difference Result 893 states and 1318 transitions. [2019-09-16 17:06:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:55,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:55,237 INFO L225 Difference]: With dead ends: 893 [2019-09-16 17:06:55,237 INFO L226 Difference]: Without dead ends: 893 [2019-09-16 17:06:55,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-16 17:06:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 835. [2019-09-16 17:06:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-09-16 17:06:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1239 transitions. [2019-09-16 17:06:55,245 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1239 transitions. Word has length 160 [2019-09-16 17:06:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:55,245 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1239 transitions. [2019-09-16 17:06:55,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1239 transitions. [2019-09-16 17:06:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:55,247 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:55,247 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:55,247 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1483532629, now seen corresponding path program 1 times [2019-09-16 17:06:55,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:55,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:55,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:55,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:55,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:55,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:55,308 INFO L87 Difference]: Start difference. First operand 835 states and 1239 transitions. Second operand 4 states. [2019-09-16 17:06:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:55,637 INFO L93 Difference]: Finished difference Result 917 states and 1346 transitions. [2019-09-16 17:06:55,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:55,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:55,638 INFO L225 Difference]: With dead ends: 917 [2019-09-16 17:06:55,638 INFO L226 Difference]: Without dead ends: 917 [2019-09-16 17:06:55,639 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-16 17:06:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 835. [2019-09-16 17:06:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-09-16 17:06:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1237 transitions. [2019-09-16 17:06:55,650 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1237 transitions. Word has length 163 [2019-09-16 17:06:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:55,651 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1237 transitions. [2019-09-16 17:06:55,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1237 transitions. [2019-09-16 17:06:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:55,653 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:55,653 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-16 17:06:55,653 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 282905396, now seen corresponding path program 1 times [2019-09-16 17:06:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:55,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:55,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:55,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:55,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:55,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:55,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:55,737 INFO L87 Difference]: Start difference. First operand 835 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,106 INFO L93 Difference]: Finished difference Result 969 states and 1443 transitions. [2019-09-16 17:06:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:56,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,109 INFO L225 Difference]: With dead ends: 969 [2019-09-16 17:06:56,109 INFO L226 Difference]: Without dead ends: 969 [2019-09-16 17:06:56,110 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-16 17:06:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 895. [2019-09-16 17:06:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1343 transitions. [2019-09-16 17:06:56,136 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1343 transitions. Word has length 163 [2019-09-16 17:06:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,136 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1343 transitions. [2019-09-16 17:06:56,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1343 transitions. [2019-09-16 17:06:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 17:06:56,138 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,138 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:56,139 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,139 INFO L82 PathProgramCache]: Analyzing trace with hash 403129231, now seen corresponding path program 1 times [2019-09-16 17:06:56,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:56,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:56,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:56,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:56,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:56,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:56,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:56,209 INFO L87 Difference]: Start difference. First operand 895 states and 1343 transitions. Second operand 4 states. [2019-09-16 17:06:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,533 INFO L93 Difference]: Finished difference Result 965 states and 1434 transitions. [2019-09-16 17:06:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-16 17:06:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,535 INFO L225 Difference]: With dead ends: 965 [2019-09-16 17:06:56,535 INFO L226 Difference]: Without dead ends: 965 [2019-09-16 17:06:56,536 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-16 17:06:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2019-09-16 17:06:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1341 transitions. [2019-09-16 17:06:56,543 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1341 transitions. Word has length 164 [2019-09-16 17:06:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,544 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1341 transitions. [2019-09-16 17:06:56,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1341 transitions. [2019-09-16 17:06:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 17:06:56,545 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,545 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:56,545 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash 479056014, now seen corresponding path program 1 times [2019-09-16 17:06:56,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:56,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:56,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:56,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:56,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:56,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:56,598 INFO L87 Difference]: Start difference. First operand 895 states and 1341 transitions. Second operand 4 states. [2019-09-16 17:06:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,944 INFO L93 Difference]: Finished difference Result 965 states and 1432 transitions. [2019-09-16 17:06:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:56,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-16 17:06:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,946 INFO L225 Difference]: With dead ends: 965 [2019-09-16 17:06:56,946 INFO L226 Difference]: Without dead ends: 965 [2019-09-16 17:06:56,947 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-16 17:06:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2019-09-16 17:06:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1339 transitions. [2019-09-16 17:06:56,954 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1339 transitions. Word has length 164 [2019-09-16 17:06:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,955 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1339 transitions. [2019-09-16 17:06:56,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1339 transitions. [2019-09-16 17:06:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:06:56,956 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,956 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:56,957 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1725696460, now seen corresponding path program 1 times [2019-09-16 17:06:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:57,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:57,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:57,029 INFO L87 Difference]: Start difference. First operand 895 states and 1339 transitions. Second operand 4 states. [2019-09-16 17:06:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:57,369 INFO L93 Difference]: Finished difference Result 959 states and 1423 transitions. [2019-09-16 17:06:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:57,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:06:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:57,371 INFO L225 Difference]: With dead ends: 959 [2019-09-16 17:06:57,371 INFO L226 Difference]: Without dead ends: 959 [2019-09-16 17:06:57,372 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-16 17:06:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2019-09-16 17:06:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1337 transitions. [2019-09-16 17:06:57,379 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1337 transitions. Word has length 165 [2019-09-16 17:06:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:57,379 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1337 transitions. [2019-09-16 17:06:57,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1337 transitions. [2019-09-16 17:06:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:57,381 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:57,381 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:57,382 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 442813446, now seen corresponding path program 1 times [2019-09-16 17:06:57,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:57,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:57,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:57,455 INFO L87 Difference]: Start difference. First operand 895 states and 1337 transitions. Second operand 4 states. [2019-09-16 17:06:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:57,798 INFO L93 Difference]: Finished difference Result 959 states and 1421 transitions. [2019-09-16 17:06:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:57,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:57,800 INFO L225 Difference]: With dead ends: 959 [2019-09-16 17:06:57,800 INFO L226 Difference]: Without dead ends: 959 [2019-09-16 17:06:57,801 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-16 17:06:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2019-09-16 17:06:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1335 transitions. [2019-09-16 17:06:57,808 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1335 transitions. Word has length 166 [2019-09-16 17:06:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:57,809 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1335 transitions. [2019-09-16 17:06:57,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1335 transitions. [2019-09-16 17:06:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:57,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:57,810 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:57,810 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1593288899, now seen corresponding path program 1 times [2019-09-16 17:06:57,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:57,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:57,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:57,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:57,866 INFO L87 Difference]: Start difference. First operand 895 states and 1335 transitions. Second operand 4 states. [2019-09-16 17:06:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:58,191 INFO L93 Difference]: Finished difference Result 953 states and 1412 transitions. [2019-09-16 17:06:58,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:58,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:58,194 INFO L225 Difference]: With dead ends: 953 [2019-09-16 17:06:58,194 INFO L226 Difference]: Without dead ends: 953 [2019-09-16 17:06:58,194 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-09-16 17:06:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 895. [2019-09-16 17:06:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1333 transitions. [2019-09-16 17:06:58,203 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1333 transitions. Word has length 166 [2019-09-16 17:06:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:58,203 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1333 transitions. [2019-09-16 17:06:58,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1333 transitions. [2019-09-16 17:06:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:58,204 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:58,204 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:58,205 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1494451854, now seen corresponding path program 1 times [2019-09-16 17:06:58,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:58,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:58,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:06:58,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:58,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:58,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:58,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:58,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:58,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:58,289 INFO L87 Difference]: Start difference. First operand 895 states and 1333 transitions. Second operand 4 states. [2019-09-16 17:06:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:58,667 INFO L93 Difference]: Finished difference Result 975 states and 1439 transitions. [2019-09-16 17:06:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:58,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:58,669 INFO L225 Difference]: With dead ends: 975 [2019-09-16 17:06:58,669 INFO L226 Difference]: Without dead ends: 975 [2019-09-16 17:06:58,670 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-09-16 17:06:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 895. [2019-09-16 17:06:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-16 17:06:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2019-09-16 17:06:58,682 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 166 [2019-09-16 17:06:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:58,682 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2019-09-16 17:06:58,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2019-09-16 17:06:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:58,684 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:58,685 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:06:58,685 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 317544652, now seen corresponding path program 1 times [2019-09-16 17:06:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:58,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:58,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:58,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:58,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:58,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:58,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:58,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:58,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:58,763 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 4 states. [2019-09-16 17:06:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:59,121 INFO L93 Difference]: Finished difference Result 953 states and 1408 transitions. [2019-09-16 17:06:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:59,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-16 17:06:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:59,123 INFO L225 Difference]: With dead ends: 953 [2019-09-16 17:06:59,124 INFO L226 Difference]: Without dead ends: 953 [2019-09-16 17:06:59,124 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-09-16 17:06:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 879. [2019-09-16 17:06:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-16 17:06:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1311 transitions. [2019-09-16 17:06:59,134 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1311 transitions. Word has length 167 [2019-09-16 17:06:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:59,134 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1311 transitions. [2019-09-16 17:06:59,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1311 transitions. [2019-09-16 17:06:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:59,135 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:59,135 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:59,136 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1143335175, now seen corresponding path program 1 times [2019-09-16 17:06:59,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:06:59,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:59,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:59,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:59,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:59,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:59,214 INFO L87 Difference]: Start difference. First operand 879 states and 1311 transitions. Second operand 4 states. [2019-09-16 17:06:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:59,565 INFO L93 Difference]: Finished difference Result 959 states and 1417 transitions. [2019-09-16 17:06:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:59,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-16 17:06:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:59,567 INFO L225 Difference]: With dead ends: 959 [2019-09-16 17:06:59,567 INFO L226 Difference]: Without dead ends: 959 [2019-09-16 17:06:59,567 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-16 17:06:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 879. [2019-09-16 17:06:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-16 17:06:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1309 transitions. [2019-09-16 17:06:59,574 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1309 transitions. Word has length 167 [2019-09-16 17:06:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:59,575 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1309 transitions. [2019-09-16 17:06:59,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1309 transitions. [2019-09-16 17:06:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-16 17:06:59,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:59,576 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:06:59,576 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1863292269, now seen corresponding path program 1 times [2019-09-16 17:06:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:06:59,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:59,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:59,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:59,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:59,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:59,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:59,645 INFO L87 Difference]: Start difference. First operand 879 states and 1309 transitions. Second operand 4 states. [2019-09-16 17:06:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:59,949 INFO L93 Difference]: Finished difference Result 929 states and 1379 transitions. [2019-09-16 17:06:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:59,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-16 17:06:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:59,951 INFO L225 Difference]: With dead ends: 929 [2019-09-16 17:06:59,951 INFO L226 Difference]: Without dead ends: 929 [2019-09-16 17:06:59,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-16 17:06:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 879. [2019-09-16 17:06:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-16 17:06:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1307 transitions. [2019-09-16 17:06:59,958 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1307 transitions. Word has length 168 [2019-09-16 17:06:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:59,958 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1307 transitions. [2019-09-16 17:06:59,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1307 transitions. [2019-09-16 17:06:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-16 17:06:59,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:59,959 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:59,960 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash 640511377, now seen corresponding path program 1 times [2019-09-16 17:06:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:07:00,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:00,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:07:00,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:00,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:07:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:07:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:07:00,048 INFO L87 Difference]: Start difference. First operand 879 states and 1307 transitions. Second operand 4 states. [2019-09-16 17:07:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:00,363 INFO L93 Difference]: Finished difference Result 949 states and 1398 transitions. [2019-09-16 17:07:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:00,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-16 17:07:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:00,365 INFO L225 Difference]: With dead ends: 949 [2019-09-16 17:07:00,365 INFO L226 Difference]: Without dead ends: 949 [2019-09-16 17:07:00,366 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-16 17:07:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 881. [2019-09-16 17:07:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-16 17:07:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1309 transitions. [2019-09-16 17:07:00,373 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1309 transitions. Word has length 169 [2019-09-16 17:07:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:00,374 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1309 transitions. [2019-09-16 17:07:00,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:07:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2019-09-16 17:07:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-16 17:07:00,375 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:00,375 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:07:00,375 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1876057418, now seen corresponding path program 1 times [2019-09-16 17:07:00,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-16 17:07:00,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:00,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:07:00,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:00,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:07:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:07:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:07:00,448 INFO L87 Difference]: Start difference. First operand 881 states and 1309 transitions. Second operand 4 states. [2019-09-16 17:07:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:00,702 INFO L93 Difference]: Finished difference Result 909 states and 1347 transitions. [2019-09-16 17:07:00,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:00,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-16 17:07:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:00,703 INFO L225 Difference]: With dead ends: 909 [2019-09-16 17:07:00,703 INFO L226 Difference]: Without dead ends: 909 [2019-09-16 17:07:00,704 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-16 17:07:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2019-09-16 17:07:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-16 17:07:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1307 transitions. [2019-09-16 17:07:00,710 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1307 transitions. Word has length 169 [2019-09-16 17:07:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:00,710 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1307 transitions. [2019-09-16 17:07:00,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:07:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1307 transitions. [2019-09-16 17:07:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-16 17:07:00,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:00,711 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-16 17:07:00,711 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 436595249, now seen corresponding path program 1 times [2019-09-16 17:07:00,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:00,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:00,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:07:00,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:00,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:07:00,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:00,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:07:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:07:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:00,865 INFO L87 Difference]: Start difference. First operand 881 states and 1307 transitions. Second operand 5 states. [2019-09-16 17:07:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:01,457 INFO L93 Difference]: Finished difference Result 1039 states and 1549 transitions. [2019-09-16 17:07:01,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:07:01,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-16 17:07:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:01,459 INFO L225 Difference]: With dead ends: 1039 [2019-09-16 17:07:01,459 INFO L226 Difference]: Without dead ends: 1039 [2019-09-16 17:07:01,459 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:07:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-09-16 17:07:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 947. [2019-09-16 17:07:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-16 17:07:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1425 transitions. [2019-09-16 17:07:01,469 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1425 transitions. Word has length 169 [2019-09-16 17:07:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:01,469 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1425 transitions. [2019-09-16 17:07:01,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:07:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1425 transitions. [2019-09-16 17:07:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-16 17:07:01,471 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:01,471 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-16 17:07:01,472 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1881827196, now seen corresponding path program 1 times [2019-09-16 17:07:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:01,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:07:01,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:01,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:07:01,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:01,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:07:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:07:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:07:01,543 INFO L87 Difference]: Start difference. First operand 947 states and 1425 transitions. Second operand 4 states. [2019-09-16 17:07:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:01,860 INFO L93 Difference]: Finished difference Result 993 states and 1491 transitions. [2019-09-16 17:07:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:01,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-16 17:07:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:01,861 INFO L225 Difference]: With dead ends: 993 [2019-09-16 17:07:01,861 INFO L226 Difference]: Without dead ends: 993 [2019-09-16 17:07:01,862 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-16 17:07:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 947. [2019-09-16 17:07:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-16 17:07:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1423 transitions. [2019-09-16 17:07:01,871 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1423 transitions. Word has length 169 [2019-09-16 17:07:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:01,871 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1423 transitions. [2019-09-16 17:07:01,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:07:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1423 transitions. [2019-09-16 17:07:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-16 17:07:01,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:01,873 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:07:01,873 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash 918435720, now seen corresponding path program 1 times [2019-09-16 17:07:01,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:01,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:01,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-16 17:07:01,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:01,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:07:01,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:01,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:07:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:07:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:07:01,964 INFO L87 Difference]: Start difference. First operand 947 states and 1423 transitions. Second operand 4 states. [2019-09-16 17:07:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:02,405 INFO L93 Difference]: Finished difference Result 1019 states and 1514 transitions. [2019-09-16 17:07:02,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:02,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-16 17:07:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:02,407 INFO L225 Difference]: With dead ends: 1019 [2019-09-16 17:07:02,407 INFO L226 Difference]: Without dead ends: 1019 [2019-09-16 17:07:02,408 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-16 17:07:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 947. [2019-09-16 17:07:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-16 17:07:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1421 transitions. [2019-09-16 17:07:02,418 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1421 transitions. Word has length 175 [2019-09-16 17:07:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:02,418 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1421 transitions. [2019-09-16 17:07:02,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:07:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1421 transitions. [2019-09-16 17:07:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-16 17:07:02,420 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:02,420 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:07:02,420 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -155464761, now seen corresponding path program 1 times [2019-09-16 17:07:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:02,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-16 17:07:02,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:02,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:07:02,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:02,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:07:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:07:02,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:07:02,486 INFO L87 Difference]: Start difference. First operand 947 states and 1421 transitions. Second operand 4 states. [2019-09-16 17:07:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:02,796 INFO L93 Difference]: Finished difference Result 1015 states and 1508 transitions. [2019-09-16 17:07:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:02,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-16 17:07:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:02,798 INFO L225 Difference]: With dead ends: 1015 [2019-09-16 17:07:02,799 INFO L226 Difference]: Without dead ends: 1015 [2019-09-16 17:07:02,799 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-16 17:07:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 885. [2019-09-16 17:07:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-16 17:07:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1327 transitions. [2019-09-16 17:07:02,807 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1327 transitions. Word has length 176 [2019-09-16 17:07:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:02,807 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1327 transitions. [2019-09-16 17:07:02,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:07:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1327 transitions. [2019-09-16 17:07:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-16 17:07:02,808 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:02,808 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:07:02,809 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1080081280, now seen corresponding path program 1 times [2019-09-16 17:07:02,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:02,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:07:03,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:07:03,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:07:03,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2019-09-16 17:07:03,406 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [339], [343], [548], [553], [558], [563], [578], [583], [588], [593], [598], [604], [609], [611], [616], [621], [626], [632], [635], [639], [660], [694], [696], [708], [711], [712], [724], [732], [733], [734] [2019-09-16 17:07:03,497 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:07:03,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:07:03,573 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:07:03,575 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:07:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:03,580 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:07:03,682 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:07:03,682 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:07:03,694 INFO L420 sIntCurrentIteration]: We unified 175 AI predicates to 175 [2019-09-16 17:07:03,694 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:07:03,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:07:03,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-09-16 17:07:03,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:03,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:07:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:07:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:07:03,698 INFO L87 Difference]: Start difference. First operand 885 states and 1327 transitions. Second operand 2 states. [2019-09-16 17:07:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:03,699 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:07:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:07:03,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-09-16 17:07:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:03,699 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:07:03,700 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:07:03,700 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:07:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:07:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:07:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:07:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:07:03,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-09-16 17:07:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:03,702 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:07:03,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:07:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:07:03,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:07:03,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:07:03 BoogieIcfgContainer [2019-09-16 17:07:03,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:07:03,711 INFO L168 Benchmark]: Toolchain (without parser) took 53109.22 ms. Allocated memory was 130.0 MB in the beginning and 847.8 MB in the end (delta: 717.8 MB). Free memory was 83.8 MB in the beginning and 467.1 MB in the end (delta: -383.3 MB). Peak memory consumption was 334.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:03,718 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 130.0 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:07:03,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1004.98 ms. Allocated memory was 130.0 MB in the beginning and 198.7 MB in the end (delta: 68.7 MB). Free memory was 83.4 MB in the beginning and 153.9 MB in the end (delta: -70.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:03,722 INFO L168 Benchmark]: Boogie Preprocessor took 164.21 ms. Allocated memory is still 198.7 MB. Free memory was 153.9 MB in the beginning and 145.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:03,723 INFO L168 Benchmark]: RCFGBuilder took 1473.66 ms. Allocated memory was 198.7 MB in the beginning and 216.5 MB in the end (delta: 17.8 MB). Free memory was 145.6 MB in the beginning and 160.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:03,723 INFO L168 Benchmark]: TraceAbstraction took 50461.57 ms. Allocated memory was 216.5 MB in the beginning and 847.8 MB in the end (delta: 631.2 MB). Free memory was 160.4 MB in the beginning and 467.1 MB in the end (delta: -306.7 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:03,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 130.0 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1004.98 ms. Allocated memory was 130.0 MB in the beginning and 198.7 MB in the end (delta: 68.7 MB). Free memory was 83.4 MB in the beginning and 153.9 MB in the end (delta: -70.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.21 ms. Allocated memory is still 198.7 MB. Free memory was 153.9 MB in the beginning and 145.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1473.66 ms. Allocated memory was 198.7 MB in the beginning and 216.5 MB in the end (delta: 17.8 MB). Free memory was 145.6 MB in the beginning and 160.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50461.57 ms. Allocated memory was 216.5 MB in the beginning and 847.8 MB in the end (delta: 631.2 MB). Free memory was 160.4 MB in the beginning and 467.1 MB in the end (delta: -306.7 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1762]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 194 locations, 1 error locations. SAFE Result, 50.3s OverallTime, 110 OverallIterations, 7 TraceHistogramMax, 38.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26434 SDtfs, 7518 SDslu, 39873 SDs, 0 SdLazy, 22829 SolverSat, 815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 399 SyntacticMatches, 46 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=947occurred in iteration=106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.217142857142857 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 110 MinimizatonAttempts, 6591 StatesRemovedByMinimization, 109 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 13836 NumberOfCodeBlocks, 13836 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 13726 ConstructedInterpolants, 0 QuantifiedInterpolants, 4879695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 110 InterpolantComputations, 109 PerfectInterpolantSequences, 13674/13848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...