java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:06,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:06,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:06,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:06,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:06,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:06,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:06,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:06,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:06,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:06,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:06,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:06,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:06,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:06,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:06,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:06,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:06,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:06,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:06,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:06,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:06,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:06,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:06,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:06,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:06,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:06,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:06,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:06,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:06,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:06,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:06,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:06,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:06,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:06,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:06,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:06,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:06,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:06,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:06,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:06,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:06,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:06,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:06,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:06,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:06,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:06,960 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:06,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:06,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:06,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:06,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:06,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:06,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:06,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:06,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:06,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:06,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:06,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:06,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:06,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:06,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:06,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:06,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:06,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:06,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:06,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:06,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:06,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:06,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:06,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:06,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:07,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:07,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:07,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:07,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:07,280 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:07,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-15 01:28:07,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a745a5a2c/991cad9026294e01bb642ed5b83eddb0/FLAG1c841f33e [2019-10-15 01:28:07,822 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:07,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-15 01:28:07,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a745a5a2c/991cad9026294e01bb642ed5b83eddb0/FLAG1c841f33e [2019-10-15 01:28:08,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a745a5a2c/991cad9026294e01bb642ed5b83eddb0 [2019-10-15 01:28:08,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:08,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:08,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:08,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:08,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:08,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2aad96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08, skipping insertion in model container [2019-10-15 01:28:08,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,234 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:08,284 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:08,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:08,593 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:08,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:08,789 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:08,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08 WrapperNode [2019-10-15 01:28:08,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:08,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:08,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:08,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:08,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... [2019-10-15 01:28:08,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:08,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:08,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:08,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:08,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:08,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:28:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:28:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:28:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:28:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:28:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:09,136 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:28:09,734 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:28:09,735 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:28:09,737 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:09,738 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:28:09,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:09 BoogieIcfgContainer [2019-10-15 01:28:09,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:09,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:09,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:09,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:09,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:08" (1/3) ... [2019-10-15 01:28:09,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60196a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:09, skipping insertion in model container [2019-10-15 01:28:09,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:08" (2/3) ... [2019-10-15 01:28:09,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60196a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:09, skipping insertion in model container [2019-10-15 01:28:09,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:09" (3/3) ... [2019-10-15 01:28:09,749 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-10-15 01:28:09,759 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:09,767 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:09,778 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:09,812 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:09,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:09,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:09,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:09,813 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:09,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:09,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:09,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-15 01:28:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:28:09,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,842 INFO L380 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] [2019-10-15 01:28:09,843 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-10-15 01:28:09,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939436669] [2019-10-15 01:28:09,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:10,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939436669] [2019-10-15 01:28:10,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857814675] [2019-10-15 01:28:10,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,144 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-15 01:28:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,609 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-10-15 01:28:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:10,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:28:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,627 INFO L225 Difference]: With dead ends: 338 [2019-10-15 01:28:10,627 INFO L226 Difference]: Without dead ends: 176 [2019-10-15 01:28:10,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-15 01:28:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-10-15 01:28:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-15 01:28:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-10-15 01:28:10,716 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-10-15 01:28:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,717 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-10-15 01:28:10,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-10-15 01:28:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:28:10,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,725 INFO L380 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] [2019-10-15 01:28:10,726 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-10-15 01:28:10,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156967191] [2019-10-15 01:28:10,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:10,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156967191] [2019-10-15 01:28:10,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:10,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315653370] [2019-10-15 01:28:10,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:10,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:10,918 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-10-15 01:28:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,198 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-10-15 01:28:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-15 01:28:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,202 INFO L225 Difference]: With dead ends: 356 [2019-10-15 01:28:11,202 INFO L226 Difference]: Without dead ends: 204 [2019-10-15 01:28:11,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-15 01:28:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-10-15 01:28:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-15 01:28:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-10-15 01:28:11,246 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-10-15 01:28:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,246 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-10-15 01:28:11,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-10-15 01:28:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:28:11,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,251 INFO L380 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] [2019-10-15 01:28:11,253 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-10-15 01:28:11,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491554726] [2019-10-15 01:28:11,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:11,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491554726] [2019-10-15 01:28:11,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57387798] [2019-10-15 01:28:11,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,415 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-10-15 01:28:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,736 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-10-15 01:28:11,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:11,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-15 01:28:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,742 INFO L225 Difference]: With dead ends: 417 [2019-10-15 01:28:11,742 INFO L226 Difference]: Without dead ends: 237 [2019-10-15 01:28:11,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-15 01:28:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-10-15 01:28:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-15 01:28:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-10-15 01:28:11,784 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-10-15 01:28:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,785 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-10-15 01:28:11,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-10-15 01:28:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:11,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:11,792 INFO L380 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] [2019-10-15 01:28:11,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-10-15 01:28:11,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:11,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666493053] [2019-10-15 01:28:11,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:11,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:11,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666493053] [2019-10-15 01:28:11,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:11,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792051871] [2019-10-15 01:28:11,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:11,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:11,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:11,875 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-10-15 01:28:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,127 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-10-15 01:28:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 01:28:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,132 INFO L225 Difference]: With dead ends: 466 [2019-10-15 01:28:12,133 INFO L226 Difference]: Without dead ends: 248 [2019-10-15 01:28:12,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-15 01:28:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-10-15 01:28:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-15 01:28:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-10-15 01:28:12,162 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-10-15 01:28:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,165 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-10-15 01:28:12,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-10-15 01:28:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 01:28:12,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,172 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:28:12,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-10-15 01:28:12,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530858114] [2019-10-15 01:28:12,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:12,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530858114] [2019-10-15 01:28:12,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128407878] [2019-10-15 01:28:12,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,313 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-10-15 01:28:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,525 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-10-15 01:28:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-15 01:28:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,528 INFO L225 Difference]: With dead ends: 510 [2019-10-15 01:28:12,529 INFO L226 Difference]: Without dead ends: 281 [2019-10-15 01:28:12,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-15 01:28:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-15 01:28:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-15 01:28:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-10-15 01:28:12,543 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-10-15 01:28:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,543 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-10-15 01:28:12,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-10-15 01:28:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:28:12,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,545 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:28:12,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-10-15 01:28:12,546 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301194093] [2019-10-15 01:28:12,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:12,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301194093] [2019-10-15 01:28:12,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708824919] [2019-10-15 01:28:12,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,605 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-10-15 01:28:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:12,830 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-10-15 01:28:12,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:12,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-15 01:28:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:12,833 INFO L225 Difference]: With dead ends: 535 [2019-10-15 01:28:12,833 INFO L226 Difference]: Without dead ends: 281 [2019-10-15 01:28:12,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-15 01:28:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-15 01:28:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-15 01:28:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-10-15 01:28:12,849 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-10-15 01:28:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:12,849 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-10-15 01:28:12,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-10-15 01:28:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 01:28:12,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,851 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:12,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-10-15 01:28:12,852 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920385886] [2019-10-15 01:28:12,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:12,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920385886] [2019-10-15 01:28:12,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:12,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:12,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049711641] [2019-10-15 01:28:12,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:12,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:12,921 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-10-15 01:28:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,146 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-10-15 01:28:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-15 01:28:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,150 INFO L225 Difference]: With dead ends: 552 [2019-10-15 01:28:13,151 INFO L226 Difference]: Without dead ends: 298 [2019-10-15 01:28:13,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-15 01:28:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-15 01:28:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-15 01:28:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-10-15 01:28:13,170 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-10-15 01:28:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,170 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-10-15 01:28:13,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-10-15 01:28:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:28:13,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,172 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 01:28:13,172 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-10-15 01:28:13,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788375284] [2019-10-15 01:28:13,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:28:13,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788375284] [2019-10-15 01:28:13,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449910313] [2019-10-15 01:28:13,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,263 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-10-15 01:28:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,436 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-15 01:28:13,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-15 01:28:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,440 INFO L225 Difference]: With dead ends: 600 [2019-10-15 01:28:13,440 INFO L226 Difference]: Without dead ends: 315 [2019-10-15 01:28:13,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-15 01:28:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-10-15 01:28:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-15 01:28:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-10-15 01:28:13,459 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-10-15 01:28:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,459 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-10-15 01:28:13,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-10-15 01:28:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:28:13,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,463 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,463 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-10-15 01:28:13,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181962886] [2019-10-15 01:28:13,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:13,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181962886] [2019-10-15 01:28:13,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10027705] [2019-10-15 01:28:13,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,563 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-10-15 01:28:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,866 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-10-15 01:28:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:13,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-15 01:28:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,870 INFO L225 Difference]: With dead ends: 651 [2019-10-15 01:28:13,870 INFO L226 Difference]: Without dead ends: 351 [2019-10-15 01:28:13,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-15 01:28:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-15 01:28:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-15 01:28:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-10-15 01:28:13,893 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-10-15 01:28:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,895 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-10-15 01:28:13,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-10-15 01:28:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:28:13,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,897 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-15 01:28:13,898 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-10-15 01:28:13,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217557249] [2019-10-15 01:28:13,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:28:13,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217557249] [2019-10-15 01:28:13,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:13,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845987824] [2019-10-15 01:28:13,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:13,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:13,980 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-10-15 01:28:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,192 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-10-15 01:28:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-15 01:28:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,195 INFO L225 Difference]: With dead ends: 687 [2019-10-15 01:28:14,195 INFO L226 Difference]: Without dead ends: 351 [2019-10-15 01:28:14,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-15 01:28:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-15 01:28:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-15 01:28:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-10-15 01:28:14,213 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-10-15 01:28:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,214 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-10-15 01:28:14,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-10-15 01:28:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:28:14,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,216 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,216 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-10-15 01:28:14,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513287168] [2019-10-15 01:28:14,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:14,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513287168] [2019-10-15 01:28:14,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274755289] [2019-10-15 01:28:14,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,270 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-10-15 01:28:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,498 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-10-15 01:28:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-15 01:28:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,501 INFO L225 Difference]: With dead ends: 687 [2019-10-15 01:28:14,501 INFO L226 Difference]: Without dead ends: 351 [2019-10-15 01:28:14,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-15 01:28:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-15 01:28:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-15 01:28:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-10-15 01:28:14,520 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-10-15 01:28:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,520 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-10-15 01:28:14,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-10-15 01:28:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:28:14,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,522 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-15 01:28:14,522 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-10-15 01:28:14,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463818485] [2019-10-15 01:28:14,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:28:14,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463818485] [2019-10-15 01:28:14,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807049446] [2019-10-15 01:28:14,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,585 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-10-15 01:28:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,817 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-10-15 01:28:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:14,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-15 01:28:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,820 INFO L225 Difference]: With dead ends: 714 [2019-10-15 01:28:14,820 INFO L226 Difference]: Without dead ends: 378 [2019-10-15 01:28:14,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-15 01:28:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-15 01:28:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-15 01:28:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-10-15 01:28:14,841 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-10-15 01:28:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,841 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-10-15 01:28:14,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-10-15 01:28:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-15 01:28:14,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,843 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-15 01:28:14,843 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-10-15 01:28:14,844 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685799727] [2019-10-15 01:28:14,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:28:14,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685799727] [2019-10-15 01:28:14,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:14,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143019561] [2019-10-15 01:28:14,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:14,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:14,949 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-10-15 01:28:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,154 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-10-15 01:28:15,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-15 01:28:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,157 INFO L225 Difference]: With dead ends: 738 [2019-10-15 01:28:15,158 INFO L226 Difference]: Without dead ends: 378 [2019-10-15 01:28:15,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-15 01:28:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-15 01:28:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-15 01:28:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-10-15 01:28:15,176 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-10-15 01:28:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,177 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-10-15 01:28:15,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-10-15 01:28:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:28:15,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,179 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-15 01:28:15,179 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-10-15 01:28:15,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186176615] [2019-10-15 01:28:15,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:28:15,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186176615] [2019-10-15 01:28:15,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238485711] [2019-10-15 01:28:15,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,224 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-10-15 01:28:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,404 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-10-15 01:28:15,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:28:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,407 INFO L225 Difference]: With dead ends: 742 [2019-10-15 01:28:15,408 INFO L226 Difference]: Without dead ends: 382 [2019-10-15 01:28:15,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-15 01:28:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-10-15 01:28:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-15 01:28:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-10-15 01:28:15,429 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-10-15 01:28:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,429 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-10-15 01:28:15,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-10-15 01:28:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:28:15,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,432 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:15,432 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-10-15 01:28:15,432 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336836435] [2019-10-15 01:28:15,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:28:15,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336836435] [2019-10-15 01:28:15,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930575183] [2019-10-15 01:28:15,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,484 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-10-15 01:28:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,711 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-10-15 01:28:15,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:15,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:28:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,715 INFO L225 Difference]: With dead ends: 782 [2019-10-15 01:28:15,715 INFO L226 Difference]: Without dead ends: 413 [2019-10-15 01:28:15,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-15 01:28:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-15 01:28:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-15 01:28:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-10-15 01:28:15,739 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-10-15 01:28:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,739 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-10-15 01:28:15,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-10-15 01:28:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:28:15,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,741 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:15,742 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-10-15 01:28:15,742 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052193417] [2019-10-15 01:28:15,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:28:15,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052193417] [2019-10-15 01:28:15,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:15,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672055148] [2019-10-15 01:28:15,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:15,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:15,818 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-10-15 01:28:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,021 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-10-15 01:28:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-15 01:28:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,025 INFO L225 Difference]: With dead ends: 811 [2019-10-15 01:28:16,025 INFO L226 Difference]: Without dead ends: 413 [2019-10-15 01:28:16,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-15 01:28:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-15 01:28:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-15 01:28:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-10-15 01:28:16,045 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-10-15 01:28:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,045 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-10-15 01:28:16,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-10-15 01:28:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:16,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,048 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:16,048 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-10-15 01:28:16,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530713301] [2019-10-15 01:28:16,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-15 01:28:16,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530713301] [2019-10-15 01:28:16,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783339787] [2019-10-15 01:28:16,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,105 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-10-15 01:28:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,324 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-10-15 01:28:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,328 INFO L225 Difference]: With dead ends: 834 [2019-10-15 01:28:16,328 INFO L226 Difference]: Without dead ends: 436 [2019-10-15 01:28:16,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-15 01:28:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-15 01:28:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-15 01:28:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-10-15 01:28:16,358 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-10-15 01:28:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,358 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-10-15 01:28:16,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-10-15 01:28:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:28:16,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,362 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-10-15 01:28:16,362 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-10-15 01:28:16,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618593513] [2019-10-15 01:28:16,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-15 01:28:16,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618593513] [2019-10-15 01:28:16,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805596527] [2019-10-15 01:28:16,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,439 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-10-15 01:28:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:16,716 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-10-15 01:28:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:16,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-15 01:28:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:16,719 INFO L225 Difference]: With dead ends: 855 [2019-10-15 01:28:16,720 INFO L226 Difference]: Without dead ends: 436 [2019-10-15 01:28:16,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-15 01:28:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-15 01:28:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-15 01:28:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-10-15 01:28:16,747 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-10-15 01:28:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:16,747 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-10-15 01:28:16,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-10-15 01:28:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:28:16,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:16,750 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:16,750 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-10-15 01:28:16,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:16,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171514752] [2019-10-15 01:28:16,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:16,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:28:16,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171514752] [2019-10-15 01:28:16,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:16,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:16,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070785701] [2019-10-15 01:28:16,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:16,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:16,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:16,810 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-10-15 01:28:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,035 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-10-15 01:28:17,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-15 01:28:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,039 INFO L225 Difference]: With dead ends: 896 [2019-10-15 01:28:17,039 INFO L226 Difference]: Without dead ends: 477 [2019-10-15 01:28:17,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-15 01:28:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-10-15 01:28:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-15 01:28:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-10-15 01:28:17,066 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-10-15 01:28:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,067 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-10-15 01:28:17,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-10-15 01:28:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:28:17,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,069 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,070 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-10-15 01:28:17,071 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082132278] [2019-10-15 01:28:17,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:28:17,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082132278] [2019-10-15 01:28:17,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207977807] [2019-10-15 01:28:17,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,127 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-10-15 01:28:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,334 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-10-15 01:28:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-15 01:28:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,338 INFO L225 Difference]: With dead ends: 971 [2019-10-15 01:28:17,338 INFO L226 Difference]: Without dead ends: 510 [2019-10-15 01:28:17,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-15 01:28:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-10-15 01:28:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-15 01:28:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-10-15 01:28:17,363 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-10-15 01:28:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,363 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-10-15 01:28:17,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-10-15 01:28:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:28:17,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,366 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,366 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-10-15 01:28:17,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037102294] [2019-10-15 01:28:17,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:28:17,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037102294] [2019-10-15 01:28:17,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105748793] [2019-10-15 01:28:17,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,434 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-10-15 01:28:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,710 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-10-15 01:28:17,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:17,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-15 01:28:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,714 INFO L225 Difference]: With dead ends: 1010 [2019-10-15 01:28:17,714 INFO L226 Difference]: Without dead ends: 513 [2019-10-15 01:28:17,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-15 01:28:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-10-15 01:28:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-15 01:28:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-10-15 01:28:17,740 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-10-15 01:28:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,741 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-10-15 01:28:17,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-10-15 01:28:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:28:17,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,743 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:17,743 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-10-15 01:28:17,744 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051838923] [2019-10-15 01:28:17,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:28:17,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051838923] [2019-10-15 01:28:17,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:17,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980596877] [2019-10-15 01:28:17,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:17,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:17,797 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-10-15 01:28:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,014 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-10-15 01:28:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:18,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-15 01:28:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,019 INFO L225 Difference]: With dead ends: 1009 [2019-10-15 01:28:18,019 INFO L226 Difference]: Without dead ends: 512 [2019-10-15 01:28:18,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-15 01:28:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-10-15 01:28:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-15 01:28:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-10-15 01:28:18,045 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-10-15 01:28:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,045 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-10-15 01:28:18,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-10-15 01:28:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:28:18,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,047 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 01:28:18,048 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-10-15 01:28:18,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47807560] [2019-10-15 01:28:18,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-15 01:28:18,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47807560] [2019-10-15 01:28:18,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:18,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538378414] [2019-10-15 01:28:18,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:18,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,092 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-10-15 01:28:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,140 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-10-15 01:28:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 01:28:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,146 INFO L225 Difference]: With dead ends: 1497 [2019-10-15 01:28:18,146 INFO L226 Difference]: Without dead ends: 1000 [2019-10-15 01:28:18,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-10-15 01:28:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-10-15 01:28:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-15 01:28:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-10-15 01:28:18,176 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-10-15 01:28:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,176 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-10-15 01:28:18,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-10-15 01:28:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:28:18,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,179 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 01:28:18,179 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-10-15 01:28:18,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142908490] [2019-10-15 01:28:18,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-15 01:28:18,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142908490] [2019-10-15 01:28:18,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:18,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564088086] [2019-10-15 01:28:18,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:18,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:18,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,264 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-10-15 01:28:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,354 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-10-15 01:28:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-15 01:28:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,359 INFO L225 Difference]: With dead ends: 1505 [2019-10-15 01:28:18,360 INFO L226 Difference]: Without dead ends: 1007 [2019-10-15 01:28:18,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-10-15 01:28:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-10-15 01:28:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-10-15 01:28:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-10-15 01:28:18,410 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-10-15 01:28:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,411 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-10-15 01:28:18,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-10-15 01:28:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:28:18,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,414 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 01:28:18,414 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-10-15 01:28:18,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698022654] [2019-10-15 01:28:18,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-15 01:28:18,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698022654] [2019-10-15 01:28:18,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:18,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426091801] [2019-10-15 01:28:18,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:18,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,468 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-10-15 01:28:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,581 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-10-15 01:28:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-15 01:28:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,590 INFO L225 Difference]: With dead ends: 2499 [2019-10-15 01:28:18,590 INFO L226 Difference]: Without dead ends: 1505 [2019-10-15 01:28:18,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-10-15 01:28:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-10-15 01:28:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-15 01:28:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-10-15 01:28:18,671 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-10-15 01:28:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:18,672 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-10-15 01:28:18,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-10-15 01:28:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 01:28:18,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,676 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-10-15 01:28:18,676 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-10-15 01:28:18,677 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384982860] [2019-10-15 01:28:18,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-15 01:28:18,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384982860] [2019-10-15 01:28:18,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:18,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:18,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311028142] [2019-10-15 01:28:18,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:18,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:18,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,731 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-10-15 01:28:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:18,858 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-10-15 01:28:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:18,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-15 01:28:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:18,871 INFO L225 Difference]: With dead ends: 2003 [2019-10-15 01:28:18,871 INFO L226 Difference]: Without dead ends: 2001 [2019-10-15 01:28:18,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-10-15 01:28:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-10-15 01:28:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-10-15 01:28:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-10-15 01:28:19,003 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-10-15 01:28:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,004 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-10-15 01:28:19,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-10-15 01:28:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:28:19,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,009 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:19,009 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-10-15 01:28:19,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483309153] [2019-10-15 01:28:19,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-15 01:28:19,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483309153] [2019-10-15 01:28:19,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833280827] [2019-10-15 01:28:19,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,078 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-10-15 01:28:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,471 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-10-15 01:28:19,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:19,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-15 01:28:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,482 INFO L225 Difference]: With dead ends: 4173 [2019-10-15 01:28:19,482 INFO L226 Difference]: Without dead ends: 2187 [2019-10-15 01:28:19,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-15 01:28:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-10-15 01:28:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-10-15 01:28:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-10-15 01:28:19,643 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-10-15 01:28:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,644 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-10-15 01:28:19,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-10-15 01:28:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:28:19,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,652 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:19,653 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-10-15 01:28:19,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878295286] [2019-10-15 01:28:19,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-15 01:28:19,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878295286] [2019-10-15 01:28:19,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038166334] [2019-10-15 01:28:19,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,741 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-10-15 01:28:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,108 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-10-15 01:28:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:20,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-15 01:28:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,120 INFO L225 Difference]: With dead ends: 4337 [2019-10-15 01:28:20,120 INFO L226 Difference]: Without dead ends: 2155 [2019-10-15 01:28:20,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-10-15 01:28:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-10-15 01:28:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-15 01:28:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-10-15 01:28:20,230 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-10-15 01:28:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,230 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-10-15 01:28:20,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-10-15 01:28:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-15 01:28:20,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,237 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,237 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-10-15 01:28:20,238 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50609820] [2019-10-15 01:28:20,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-15 01:28:20,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50609820] [2019-10-15 01:28:20,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750192407] [2019-10-15 01:28:20,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:20,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-15 01:28:20,497 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-15 01:28:20,600 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:20,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:20,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892960509] [2019-10-15 01:28:20,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:20,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:20,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,602 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 3 states. [2019-10-15 01:28:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,781 INFO L93 Difference]: Finished difference Result 4780 states and 7056 transitions. [2019-10-15 01:28:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:20,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-15 01:28:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,794 INFO L225 Difference]: With dead ends: 4780 [2019-10-15 01:28:20,795 INFO L226 Difference]: Without dead ends: 2662 [2019-10-15 01:28:20,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-10-15 01:28:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-10-15 01:28:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-10-15 01:28:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3906 transitions. [2019-10-15 01:28:20,972 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3906 transitions. Word has length 188 [2019-10-15 01:28:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,973 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3906 transitions. [2019-10-15 01:28:20,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3906 transitions. [2019-10-15 01:28:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-15 01:28:20,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,980 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 01:28:21,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,184 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-10-15 01:28:21,185 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848787463] [2019-10-15 01:28:21,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-15 01:28:21,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848787463] [2019-10-15 01:28:21,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:21,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:21,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930271087] [2019-10-15 01:28:21,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:21,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:21,262 INFO L87 Difference]: Start difference. First operand 2660 states and 3906 transitions. Second operand 3 states. [2019-10-15 01:28:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,440 INFO L93 Difference]: Finished difference Result 4249 states and 6242 transitions. [2019-10-15 01:28:21,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:21,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-15 01:28:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,455 INFO L225 Difference]: With dead ends: 4249 [2019-10-15 01:28:21,455 INFO L226 Difference]: Without dead ends: 3189 [2019-10-15 01:28:21,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-10-15 01:28:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2019-10-15 01:28:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-15 01:28:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4686 transitions. [2019-10-15 01:28:21,650 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4686 transitions. Word has length 192 [2019-10-15 01:28:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,650 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4686 transitions. [2019-10-15 01:28:21,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4686 transitions. [2019-10-15 01:28:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-15 01:28:21,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,664 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-10-15 01:28:21,664 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-10-15 01:28:21,665 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002243050] [2019-10-15 01:28:21,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-15 01:28:21,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002243050] [2019-10-15 01:28:21,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:21,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:21,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454101973] [2019-10-15 01:28:21,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:21,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:21,777 INFO L87 Difference]: Start difference. First operand 3189 states and 4686 transitions. Second operand 3 states. [2019-10-15 01:28:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,077 INFO L93 Difference]: Finished difference Result 6425 states and 9427 transitions. [2019-10-15 01:28:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:22,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-15 01:28:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,091 INFO L225 Difference]: With dead ends: 6425 [2019-10-15 01:28:22,092 INFO L226 Difference]: Without dead ends: 3249 [2019-10-15 01:28:22,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-10-15 01:28:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3189. [2019-10-15 01:28:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-15 01:28:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4638 transitions. [2019-10-15 01:28:22,300 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4638 transitions. Word has length 270 [2019-10-15 01:28:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,300 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4638 transitions. [2019-10-15 01:28:22,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4638 transitions. [2019-10-15 01:28:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-15 01:28:22,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,318 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,319 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-10-15 01:28:22,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306196956] [2019-10-15 01:28:22,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-15 01:28:22,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306196956] [2019-10-15 01:28:22,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:22,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368314678] [2019-10-15 01:28:22,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:22,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:22,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:22,530 INFO L87 Difference]: Start difference. First operand 3189 states and 4638 transitions. Second operand 3 states. [2019-10-15 01:28:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,930 INFO L93 Difference]: Finished difference Result 6461 states and 9373 transitions. [2019-10-15 01:28:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:22,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-15 01:28:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,943 INFO L225 Difference]: With dead ends: 6461 [2019-10-15 01:28:22,943 INFO L226 Difference]: Without dead ends: 3285 [2019-10-15 01:28:22,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-10-15 01:28:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3189. [2019-10-15 01:28:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-15 01:28:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4422 transitions. [2019-10-15 01:28:23,100 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4422 transitions. Word has length 274 [2019-10-15 01:28:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,100 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4422 transitions. [2019-10-15 01:28:23,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4422 transitions. [2019-10-15 01:28:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-15 01:28:23,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,111 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1] [2019-10-15 01:28:23,111 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-10-15 01:28:23,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064987149] [2019-10-15 01:28:23,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-15 01:28:23,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064987149] [2019-10-15 01:28:23,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:23,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:23,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524883751] [2019-10-15 01:28:23,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:23,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:23,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:23,193 INFO L87 Difference]: Start difference. First operand 3189 states and 4422 transitions. Second operand 3 states. [2019-10-15 01:28:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:23,505 INFO L93 Difference]: Finished difference Result 6469 states and 8954 transitions. [2019-10-15 01:28:23,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:23,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-15 01:28:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:23,514 INFO L225 Difference]: With dead ends: 6469 [2019-10-15 01:28:23,514 INFO L226 Difference]: Without dead ends: 3293 [2019-10-15 01:28:23,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-10-15 01:28:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3195. [2019-10-15 01:28:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-10-15 01:28:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 4275 transitions. [2019-10-15 01:28:23,667 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 4275 transitions. Word has length 284 [2019-10-15 01:28:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,667 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 4275 transitions. [2019-10-15 01:28:23,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 4275 transitions. [2019-10-15 01:28:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-15 01:28:23,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,677 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:23,677 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash -27112689, now seen corresponding path program 1 times [2019-10-15 01:28:23,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290990958] [2019-10-15 01:28:23,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-15 01:28:23,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290990958] [2019-10-15 01:28:23,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337104989] [2019-10-15 01:28:23,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:23,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-10-15 01:28:24,099 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-10-15 01:28:24,182 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:24,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:24,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809404154] [2019-10-15 01:28:24,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:24,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:24,184 INFO L87 Difference]: Start difference. First operand 3195 states and 4275 transitions. Second operand 3 states. [2019-10-15 01:28:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,458 INFO L93 Difference]: Finished difference Result 9385 states and 12539 transitions. [2019-10-15 01:28:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:24,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-10-15 01:28:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,473 INFO L225 Difference]: With dead ends: 9385 [2019-10-15 01:28:24,474 INFO L226 Difference]: Without dead ends: 6209 [2019-10-15 01:28:24,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-10-15 01:28:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6207. [2019-10-15 01:28:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2019-10-15 01:28:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8271 transitions. [2019-10-15 01:28:24,840 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8271 transitions. Word has length 294 [2019-10-15 01:28:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,841 INFO L462 AbstractCegarLoop]: Abstraction has 6207 states and 8271 transitions. [2019-10-15 01:28:24,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8271 transitions. [2019-10-15 01:28:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-15 01:28:24,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,856 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:25,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:25,069 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 533587089, now seen corresponding path program 1 times [2019-10-15 01:28:25,069 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502190669] [2019-10-15 01:28:25,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-15 01:28:25,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502190669] [2019-10-15 01:28:25,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989737104] [2019-10-15 01:28:25,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:25,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-15 01:28:25,372 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-15 01:28:25,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [722627790] [2019-10-15 01:28:25,449 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 295 [2019-10-15 01:28:25,499 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:25,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:25,834 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:27,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:27,213 INFO L272 AbstractInterpreter]: Visited 98 different actions 1582 times. Merged at 85 different actions 1331 times. Widened at 16 different actions 180 times. Performed 3684 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 136 fixpoints after 18 different actions. Largest state had 97 variables. [2019-10-15 01:28:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:27,223 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:27,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:27,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:27,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468716828] [2019-10-15 01:28:27,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:27,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:27,226 INFO L87 Difference]: Start difference. First operand 6207 states and 8271 transitions. Second operand 6 states. [2019-10-15 01:28:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:28,413 INFO L93 Difference]: Finished difference Result 19340 states and 25403 transitions. [2019-10-15 01:28:28,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:28:28,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2019-10-15 01:28:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:28,440 INFO L225 Difference]: With dead ends: 19340 [2019-10-15 01:28:28,440 INFO L226 Difference]: Without dead ends: 12968 [2019-10-15 01:28:28,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12968 states. [2019-10-15 01:28:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12968 to 6197. [2019-10-15 01:28:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2019-10-15 01:28:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 8207 transitions. [2019-10-15 01:28:28,797 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 8207 transitions. Word has length 294 [2019-10-15 01:28:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:28,797 INFO L462 AbstractCegarLoop]: Abstraction has 6197 states and 8207 transitions. [2019-10-15 01:28:28,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 8207 transitions. [2019-10-15 01:28:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-15 01:28:28,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:28,813 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:29,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:29,026 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1588759982, now seen corresponding path program 1 times [2019-10-15 01:28:29,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:29,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360834694] [2019-10-15 01:28:29,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-15 01:28:29,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360834694] [2019-10-15 01:28:29,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:29,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:29,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673568049] [2019-10-15 01:28:29,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:29,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:29,150 INFO L87 Difference]: Start difference. First operand 6197 states and 8207 transitions. Second operand 3 states. [2019-10-15 01:28:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:29,545 INFO L93 Difference]: Finished difference Result 12761 states and 16914 transitions. [2019-10-15 01:28:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:29,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-15 01:28:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:29,560 INFO L225 Difference]: With dead ends: 12761 [2019-10-15 01:28:29,561 INFO L226 Difference]: Without dead ends: 6387 [2019-10-15 01:28:29,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2019-10-15 01:28:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6377. [2019-10-15 01:28:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6377 states. [2019-10-15 01:28:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6377 states to 6377 states and 8381 transitions. [2019-10-15 01:28:29,951 INFO L78 Accepts]: Start accepts. Automaton has 6377 states and 8381 transitions. Word has length 312 [2019-10-15 01:28:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:29,952 INFO L462 AbstractCegarLoop]: Abstraction has 6377 states and 8381 transitions. [2019-10-15 01:28:29,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6377 states and 8381 transitions. [2019-10-15 01:28:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-15 01:28:29,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:29,969 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:29,969 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:29,970 INFO L82 PathProgramCache]: Analyzing trace with hash -630627056, now seen corresponding path program 1 times [2019-10-15 01:28:29,970 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:29,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161108637] [2019-10-15 01:28:29,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:29,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:28:30,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161108637] [2019-10-15 01:28:30,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829529510] [2019-10-15 01:28:30,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:30,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:28:30,244 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-15 01:28:30,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [938171575] [2019-10-15 01:28:30,365 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 325 [2019-10-15 01:28:30,373 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:30,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:31,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:31,239 INFO L272 AbstractInterpreter]: Visited 80 different actions 1238 times. Merged at 69 different actions 1026 times. Widened at 12 different actions 104 times. Performed 2935 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2935 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 128 fixpoints after 14 different actions. Largest state had 95 variables. [2019-10-15 01:28:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:31,240 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:31,240 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:31,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:31,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908483943] [2019-10-15 01:28:31,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:31,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:31,243 INFO L87 Difference]: Start difference. First operand 6377 states and 8381 transitions. Second operand 6 states. [2019-10-15 01:28:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:32,332 INFO L93 Difference]: Finished difference Result 16309 states and 21142 transitions. [2019-10-15 01:28:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:28:32,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2019-10-15 01:28:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:32,351 INFO L225 Difference]: With dead ends: 16309 [2019-10-15 01:28:32,351 INFO L226 Difference]: Without dead ends: 9971 [2019-10-15 01:28:32,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-10-15 01:28:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 4565. [2019-10-15 01:28:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-10-15 01:28:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5767 transitions. [2019-10-15 01:28:32,703 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5767 transitions. Word has length 324 [2019-10-15 01:28:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:32,703 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5767 transitions. [2019-10-15 01:28:32,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5767 transitions. [2019-10-15 01:28:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-15 01:28:32,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:32,717 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:32,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:32,921 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-10-15 01:28:32,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:32,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912797528] [2019-10-15 01:28:32,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:32,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:32,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-15 01:28:33,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912797528] [2019-10-15 01:28:33,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:33,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:33,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105487542] [2019-10-15 01:28:33,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:33,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:33,014 INFO L87 Difference]: Start difference. First operand 4565 states and 5767 transitions. Second operand 3 states. [2019-10-15 01:28:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:33,276 INFO L93 Difference]: Finished difference Result 9113 states and 11506 transitions. [2019-10-15 01:28:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:33,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-15 01:28:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:33,286 INFO L225 Difference]: With dead ends: 9113 [2019-10-15 01:28:33,286 INFO L226 Difference]: Without dead ends: 4587 [2019-10-15 01:28:33,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-10-15 01:28:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4565. [2019-10-15 01:28:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-10-15 01:28:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5701 transitions. [2019-10-15 01:28:33,485 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5701 transitions. Word has length 327 [2019-10-15 01:28:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5701 transitions. [2019-10-15 01:28:33,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5701 transitions. [2019-10-15 01:28:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-15 01:28:33,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:33,499 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:33,499 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 141772578, now seen corresponding path program 1 times [2019-10-15 01:28:33,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:33,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020792793] [2019-10-15 01:28:33,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:33,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:33,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-15 01:28:33,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020792793] [2019-10-15 01:28:33,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:33,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:33,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794091378] [2019-10-15 01:28:33,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:33,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:33,624 INFO L87 Difference]: Start difference. First operand 4565 states and 5701 transitions. Second operand 3 states. [2019-10-15 01:28:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:33,896 INFO L93 Difference]: Finished difference Result 8025 states and 10084 transitions. [2019-10-15 01:28:33,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:33,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-10-15 01:28:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:33,905 INFO L225 Difference]: With dead ends: 8025 [2019-10-15 01:28:33,905 INFO L226 Difference]: Without dead ends: 4621 [2019-10-15 01:28:33,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2019-10-15 01:28:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4565. [2019-10-15 01:28:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-10-15 01:28:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 5695 transitions. [2019-10-15 01:28:34,154 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 5695 transitions. Word has length 370 [2019-10-15 01:28:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:34,155 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 5695 transitions. [2019-10-15 01:28:34,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 5695 transitions. [2019-10-15 01:28:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-15 01:28:34,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:34,168 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:34,168 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:34,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-10-15 01:28:34,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:34,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320850546] [2019-10-15 01:28:34,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:34,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-15 01:28:34,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320850546] [2019-10-15 01:28:34,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:34,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:34,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389716223] [2019-10-15 01:28:34,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:34,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:34,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:34,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:34,313 INFO L87 Difference]: Start difference. First operand 4565 states and 5695 transitions. Second operand 3 states. [2019-10-15 01:28:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:34,568 INFO L93 Difference]: Finished difference Result 8484 states and 10602 transitions. [2019-10-15 01:28:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:34,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-15 01:28:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:34,576 INFO L225 Difference]: With dead ends: 8484 [2019-10-15 01:28:34,576 INFO L226 Difference]: Without dead ends: 3837 [2019-10-15 01:28:34,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2019-10-15 01:28:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3786. [2019-10-15 01:28:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2019-10-15 01:28:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 4711 transitions. [2019-10-15 01:28:34,753 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 4711 transitions. Word has length 393 [2019-10-15 01:28:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:34,754 INFO L462 AbstractCegarLoop]: Abstraction has 3786 states and 4711 transitions. [2019-10-15 01:28:34,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 4711 transitions. [2019-10-15 01:28:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-15 01:28:34,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:34,763 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:34,763 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:34,764 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-10-15 01:28:34,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:34,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107704050] [2019-10-15 01:28:34,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:34,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:34,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-15 01:28:34,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107704050] [2019-10-15 01:28:34,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:34,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:34,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238309094] [2019-10-15 01:28:34,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:34,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:34,955 INFO L87 Difference]: Start difference. First operand 3786 states and 4711 transitions. Second operand 3 states. [2019-10-15 01:28:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:35,285 INFO L93 Difference]: Finished difference Result 7112 states and 8870 transitions. [2019-10-15 01:28:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:35,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-15 01:28:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:35,293 INFO L225 Difference]: With dead ends: 7112 [2019-10-15 01:28:35,294 INFO L226 Difference]: Without dead ends: 3798 [2019-10-15 01:28:35,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-10-15 01:28:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3786. [2019-10-15 01:28:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2019-10-15 01:28:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 4705 transitions. [2019-10-15 01:28:35,465 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 4705 transitions. Word has length 393 [2019-10-15 01:28:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:35,466 INFO L462 AbstractCegarLoop]: Abstraction has 3786 states and 4705 transitions. [2019-10-15 01:28:35,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 4705 transitions. [2019-10-15 01:28:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-15 01:28:35,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:35,478 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:35,478 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash -676110835, now seen corresponding path program 1 times [2019-10-15 01:28:35,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:35,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080375613] [2019-10-15 01:28:35,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:35,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-15 01:28:35,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080375613] [2019-10-15 01:28:35,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306883273] [2019-10-15 01:28:35,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:35,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:35,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-15 01:28:35,913 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-15 01:28:36,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [3654555] [2019-10-15 01:28:36,000 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 428 [2019-10-15 01:28:36,003 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:36,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:36,053 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:37,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:37,143 INFO L272 AbstractInterpreter]: Visited 115 different actions 1859 times. Merged at 98 different actions 1511 times. Widened at 21 different actions 215 times. Performed 4482 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4482 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 196 fixpoints after 22 different actions. Largest state had 102 variables. [2019-10-15 01:28:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:37,144 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:37,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:37,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:37,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150381836] [2019-10-15 01:28:37,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:37,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:37,146 INFO L87 Difference]: Start difference. First operand 3786 states and 4705 transitions. Second operand 6 states. [2019-10-15 01:28:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,513 INFO L93 Difference]: Finished difference Result 6243 states and 7756 transitions. [2019-10-15 01:28:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:37,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 427 [2019-10-15 01:28:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:37,515 INFO L225 Difference]: With dead ends: 6243 [2019-10-15 01:28:37,515 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:37,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:37,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-10-15 01:28:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:37,525 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:37,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:37,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:37,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:37,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:37,863 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 167 [2019-10-15 01:28:37,977 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 167