java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:48:40,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:48:40,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:48:40,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:48:40,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:48:40,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:48:40,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:48:40,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:48:40,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:48:40,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:48:40,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:48:40,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:48:40,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:48:40,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:48:40,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:48:40,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:48:40,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:48:40,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:48:40,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:48:40,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:48:40,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:48:40,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:48:40,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:48:40,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:48:40,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:48:40,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:48:40,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:48:40,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:48:40,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:48:40,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:48:40,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:48:40,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:48:40,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:48:40,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:48:40,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:48:40,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:48:40,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:48:40,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:48:40,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:48:40,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:48:40,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:48:40,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:48:40,134 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:48:40,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:48:40,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:48:40,135 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:48:40,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:48:40,136 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:48:40,136 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:48:40,136 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:48:40,137 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:48:40,137 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:48:40,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:48:40,139 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:48:40,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:48:40,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:48:40,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:48:40,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:48:40,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:48:40,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:48:40,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:48:40,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:48:40,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:48:40,141 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:48:40,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:48:40,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:48:40,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:48:40,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:48:40,142 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:48:40,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:48:40,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:48:40,143 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:48:40,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:48:40,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:48:40,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:48:40,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:48:40,215 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:48:40,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-09-09 05:48:40,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363fbce4b/15f4f21379b04f24bea67c5d891d8d57/FLAG76df91b0d [2019-09-09 05:48:40,838 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:48:40,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-09-09 05:48:40,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363fbce4b/15f4f21379b04f24bea67c5d891d8d57/FLAG76df91b0d [2019-09-09 05:48:41,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363fbce4b/15f4f21379b04f24bea67c5d891d8d57 [2019-09-09 05:48:41,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:48:41,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:48:41,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:48:41,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:48:41,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:48:41,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fda248a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41, skipping insertion in model container [2019-09-09 05:48:41,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:48:41,221 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:48:41,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:48:41,492 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:48:41,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:48:41,691 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:48:41,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41 WrapperNode [2019-09-09 05:48:41,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:48:41,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:48:41,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:48:41,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:48:41,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... [2019-09-09 05:48:41,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:48:41,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:48:41,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:48:41,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:48:41,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:48:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:48:41,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:48:41,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:48:41,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:48:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:48:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:48:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:48:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:48:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:48:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:48:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:48:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:48:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:48:42,056 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:48:42,618 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:48:42,619 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:48:42,622 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:48:42,623 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:48:42,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:48:42 BoogieIcfgContainer [2019-09-09 05:48:42,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:48:42,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:48:42,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:48:42,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:48:42,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:48:41" (1/3) ... [2019-09-09 05:48:42,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f85e120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:48:42, skipping insertion in model container [2019-09-09 05:48:42,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:41" (2/3) ... [2019-09-09 05:48:42,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f85e120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:48:42, skipping insertion in model container [2019-09-09 05:48:42,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:48:42" (3/3) ... [2019-09-09 05:48:42,646 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-09-09 05:48:42,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:48:42,670 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:48:42,687 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:48:42,715 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:48:42,715 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:48:42,715 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:48:42,715 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:48:42,716 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:48:42,716 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:48:42,716 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:48:42,716 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:48:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-09 05:48:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:48:42,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:42,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:42,751 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:42,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-09-09 05:48:42,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:42,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:42,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:42,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:48:43,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:43,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:43,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:43,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:43,078 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-09-09 05:48:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:43,541 INFO L93 Difference]: Finished difference Result 201 states and 337 transitions. [2019-09-09 05:48:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:43,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:48:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:43,563 INFO L225 Difference]: With dead ends: 201 [2019-09-09 05:48:43,563 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:48:43,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:48:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-09-09 05:48:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:48:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-09-09 05:48:43,663 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-09-09 05:48:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:43,664 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-09-09 05:48:43,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-09-09 05:48:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:48:43,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:43,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:43,672 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-09-09 05:48:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:43,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:43,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:48:43,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:43,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:43,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:43,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:43,833 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-09-09 05:48:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:44,155 INFO L93 Difference]: Finished difference Result 223 states and 365 transitions. [2019-09-09 05:48:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:44,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:48:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:44,160 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:48:44,160 INFO L226 Difference]: Without dead ends: 221 [2019-09-09 05:48:44,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-09 05:48:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-09-09 05:48:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-09 05:48:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-09-09 05:48:44,190 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-09-09 05:48:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:44,191 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-09-09 05:48:44,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-09-09 05:48:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:48:44,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:44,202 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:44,202 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770299, now seen corresponding path program 1 times [2019-09-09 05:48:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:48:44,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:44,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:44,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:44,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:44,333 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-09-09 05:48:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:44,622 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-09-09 05:48:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:44,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-09 05:48:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:44,628 INFO L225 Difference]: With dead ends: 247 [2019-09-09 05:48:44,629 INFO L226 Difference]: Without dead ends: 247 [2019-09-09 05:48:44,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-09 05:48:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-09 05:48:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-09 05:48:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-09-09 05:48:44,648 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-09-09 05:48:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:44,649 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-09-09 05:48:44,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-09-09 05:48:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:48:44,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:44,655 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:44,656 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1202289061, now seen corresponding path program 1 times [2019-09-09 05:48:44,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:44,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:44,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:44,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:44,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:44,791 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-09-09 05:48:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:44,977 INFO L93 Difference]: Finished difference Result 264 states and 438 transitions. [2019-09-09 05:48:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:44,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:48:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:44,981 INFO L225 Difference]: With dead ends: 264 [2019-09-09 05:48:44,981 INFO L226 Difference]: Without dead ends: 264 [2019-09-09 05:48:44,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-09 05:48:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-09 05:48:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-09 05:48:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-09-09 05:48:44,992 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-09-09 05:48:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:44,993 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-09-09 05:48:44,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-09-09 05:48:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:48:44,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:44,995 INFO L399 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, 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] [2019-09-09 05:48:44,995 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1597952639, now seen corresponding path program 1 times [2019-09-09 05:48:44,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:44,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:48:45,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:45,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:45,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:45,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:45,068 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-09-09 05:48:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:45,290 INFO L93 Difference]: Finished difference Result 309 states and 517 transitions. [2019-09-09 05:48:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:45,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:48:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:45,293 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:48:45,293 INFO L226 Difference]: Without dead ends: 309 [2019-09-09 05:48:45,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-09 05:48:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2019-09-09 05:48:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:48:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-09-09 05:48:45,304 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-09-09 05:48:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:45,305 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-09-09 05:48:45,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-09-09 05:48:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:48:45,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:45,307 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:45,307 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:45,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2044645757, now seen corresponding path program 1 times [2019-09-09 05:48:45,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:45,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:45,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:45,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:45,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:45,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:45,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:45,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:45,377 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-09-09 05:48:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:45,581 INFO L93 Difference]: Finished difference Result 306 states and 508 transitions. [2019-09-09 05:48:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:45,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:48:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:45,584 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:48:45,584 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:48:45,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:48:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-09 05:48:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:48:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-09-09 05:48:45,594 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-09-09 05:48:45,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:45,594 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-09-09 05:48:45,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-09-09 05:48:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:48:45,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:45,596 INFO L399 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, 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] [2019-09-09 05:48:45,596 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash -176213692, now seen corresponding path program 1 times [2019-09-09 05:48:45,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:45,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:45,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:48:45,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:45,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:45,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:45,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:45,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:45,654 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-09-09 05:48:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:45,898 INFO L93 Difference]: Finished difference Result 309 states and 511 transitions. [2019-09-09 05:48:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:45,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:48:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:45,902 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:48:45,902 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:48:45,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:48:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2019-09-09 05:48:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-09 05:48:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-09-09 05:48:45,912 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-09-09 05:48:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:45,912 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-09-09 05:48:45,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-09-09 05:48:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:48:45,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:45,915 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:45,915 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:45,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash -690895868, now seen corresponding path program 1 times [2019-09-09 05:48:45,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:45,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:45,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:45,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:48:45,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:45,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:45,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:45,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:45,982 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-09-09 05:48:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:46,187 INFO L93 Difference]: Finished difference Result 311 states and 507 transitions. [2019-09-09 05:48:46,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:46,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-09 05:48:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:46,192 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:48:46,192 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:48:46,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:48:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-09-09 05:48:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-09 05:48:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-09-09 05:48:46,203 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-09-09 05:48:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:46,204 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-09-09 05:48:46,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-09-09 05:48:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:48:46,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:46,206 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:46,206 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:46,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1568096766, now seen corresponding path program 1 times [2019-09-09 05:48:46,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:46,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:46,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:46,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:46,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:46,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:46,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:46,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:46,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:46,329 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-09-09 05:48:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:46,572 INFO L93 Difference]: Finished difference Result 342 states and 556 transitions. [2019-09-09 05:48:46,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:46,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:48:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:46,575 INFO L225 Difference]: With dead ends: 342 [2019-09-09 05:48:46,575 INFO L226 Difference]: Without dead ends: 342 [2019-09-09 05:48:46,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-09 05:48:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-09 05:48:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:48:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-09-09 05:48:46,586 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-09-09 05:48:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:46,586 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-09-09 05:48:46,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-09-09 05:48:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:48:46,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:46,589 INFO L399 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, 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-09-09 05:48:46,589 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash -314967930, now seen corresponding path program 1 times [2019-09-09 05:48:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:46,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:46,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:46,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:46,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:46,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:46,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:46,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:46,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:46,649 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-09-09 05:48:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:46,833 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-09-09 05:48:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:46,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:48:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:46,838 INFO L225 Difference]: With dead ends: 342 [2019-09-09 05:48:46,838 INFO L226 Difference]: Without dead ends: 342 [2019-09-09 05:48:46,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-09 05:48:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-09 05:48:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:48:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-09-09 05:48:46,847 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-09-09 05:48:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:46,847 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-09-09 05:48:46,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-09-09 05:48:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:48:46,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:46,849 INFO L399 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] [2019-09-09 05:48:46,850 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1055150734, now seen corresponding path program 1 times [2019-09-09 05:48:46,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:46,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:46,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:46,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:46,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:46,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:46,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:46,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:46,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:46,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:46,902 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-09-09 05:48:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:47,123 INFO L93 Difference]: Finished difference Result 375 states and 605 transitions. [2019-09-09 05:48:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:47,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:48:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:47,126 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:48:47,126 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:48:47,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:48:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-09 05:48:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:48:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-09-09 05:48:47,135 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-09-09 05:48:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:47,135 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-09-09 05:48:47,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-09-09 05:48:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:48:47,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:47,138 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:47,138 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2124208522, now seen corresponding path program 1 times [2019-09-09 05:48:47,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:47,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:47,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:47,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:47,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:47,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:47,199 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-09-09 05:48:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:47,430 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-09-09 05:48:47,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:47,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-09 05:48:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:47,434 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:48:47,434 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:48:47,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:48:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-09 05:48:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:48:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-09-09 05:48:47,450 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-09-09 05:48:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:47,451 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-09-09 05:48:47,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-09-09 05:48:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:48:47,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:47,455 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:47,457 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1027752783, now seen corresponding path program 1 times [2019-09-09 05:48:47,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:47,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:47,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:47,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:47,603 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-09-09 05:48:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:47,851 INFO L93 Difference]: Finished difference Result 392 states and 622 transitions. [2019-09-09 05:48:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:47,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-09 05:48:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:47,855 INFO L225 Difference]: With dead ends: 392 [2019-09-09 05:48:47,856 INFO L226 Difference]: Without dead ends: 392 [2019-09-09 05:48:47,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-09 05:48:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-09 05:48:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:48:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-09-09 05:48:47,869 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-09-09 05:48:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:47,870 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-09-09 05:48:47,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-09-09 05:48:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:48:47,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:47,874 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:47,874 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1923701177, now seen corresponding path program 1 times [2019-09-09 05:48:47,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:47,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:47,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:47,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:47,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:47,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:47,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:47,944 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-09-09 05:48:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:48,146 INFO L93 Difference]: Finished difference Result 392 states and 616 transitions. [2019-09-09 05:48:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:48,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:48:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:48,149 INFO L225 Difference]: With dead ends: 392 [2019-09-09 05:48:48,149 INFO L226 Difference]: Without dead ends: 392 [2019-09-09 05:48:48,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-09 05:48:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-09 05:48:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:48:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-09-09 05:48:48,160 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-09-09 05:48:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:48,160 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-09-09 05:48:48,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-09-09 05:48:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:48:48,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,162 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:48,163 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1132457392, now seen corresponding path program 1 times [2019-09-09 05:48:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-09 05:48:48,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:48,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:48,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,223 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-09-09 05:48:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:48,261 INFO L93 Difference]: Finished difference Result 761 states and 1201 transitions. [2019-09-09 05:48:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:48,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-09 05:48:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:48,266 INFO L225 Difference]: With dead ends: 761 [2019-09-09 05:48:48,266 INFO L226 Difference]: Without dead ends: 761 [2019-09-09 05:48:48,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-09-09 05:48:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-09-09 05:48:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-09 05:48:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-09-09 05:48:48,285 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-09-09 05:48:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:48,286 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-09-09 05:48:48,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-09-09 05:48:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:48:48,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,290 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:48,290 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1143263811, now seen corresponding path program 1 times [2019-09-09 05:48:48,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:48:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:48,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:48,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:48,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:48,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,354 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-09-09 05:48:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:48,392 INFO L93 Difference]: Finished difference Result 1089 states and 1718 transitions. [2019-09-09 05:48:48,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:48,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-09 05:48:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:48,400 INFO L225 Difference]: With dead ends: 1089 [2019-09-09 05:48:48,400 INFO L226 Difference]: Without dead ends: 1089 [2019-09-09 05:48:48,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-09-09 05:48:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2019-09-09 05:48:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-09-09 05:48:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1718 transitions. [2019-09-09 05:48:48,427 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1718 transitions. Word has length 127 [2019-09-09 05:48:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:48,428 INFO L475 AbstractCegarLoop]: Abstraction has 1089 states and 1718 transitions. [2019-09-09 05:48:48,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1718 transitions. [2019-09-09 05:48:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:48:48,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,431 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:48,432 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash 733219007, now seen corresponding path program 1 times [2019-09-09 05:48:48,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:48,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:48,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,474 INFO L87 Difference]: Start difference. First operand 1089 states and 1718 transitions. Second operand 3 states. [2019-09-09 05:48:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:48,511 INFO L93 Difference]: Finished difference Result 1458 states and 2300 transitions. [2019-09-09 05:48:48,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:48,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-09 05:48:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:48,520 INFO L225 Difference]: With dead ends: 1458 [2019-09-09 05:48:48,521 INFO L226 Difference]: Without dead ends: 1458 [2019-09-09 05:48:48,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-09-09 05:48:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2019-09-09 05:48:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-09-09 05:48:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2300 transitions. [2019-09-09 05:48:48,551 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2300 transitions. Word has length 127 [2019-09-09 05:48:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:48,551 INFO L475 AbstractCegarLoop]: Abstraction has 1458 states and 2300 transitions. [2019-09-09 05:48:48,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2300 transitions. [2019-09-09 05:48:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:48:48,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,578 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:48,578 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2122513021, now seen corresponding path program 1 times [2019-09-09 05:48:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-09 05:48:48,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:48,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:48,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:48,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,612 INFO L87 Difference]: Start difference. First operand 1458 states and 2300 transitions. Second operand 3 states. [2019-09-09 05:48:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:48,646 INFO L93 Difference]: Finished difference Result 1809 states and 2851 transitions. [2019-09-09 05:48:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:48,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-09 05:48:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:48,655 INFO L225 Difference]: With dead ends: 1809 [2019-09-09 05:48:48,656 INFO L226 Difference]: Without dead ends: 1809 [2019-09-09 05:48:48,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-09-09 05:48:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2019-09-09 05:48:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-09-09 05:48:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2851 transitions. [2019-09-09 05:48:48,697 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2851 transitions. Word has length 127 [2019-09-09 05:48:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:48,698 INFO L475 AbstractCegarLoop]: Abstraction has 1809 states and 2851 transitions. [2019-09-09 05:48:48,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2851 transitions. [2019-09-09 05:48:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:48:48,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:48,704 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:48,704 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 913291395, now seen corresponding path program 1 times [2019-09-09 05:48:48,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:48,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-09 05:48:48,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:48,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:48,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:48,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:48,791 INFO L87 Difference]: Start difference. First operand 1809 states and 2851 transitions. Second operand 3 states. [2019-09-09 05:48:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:49,033 INFO L93 Difference]: Finished difference Result 1859 states and 2839 transitions. [2019-09-09 05:48:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:49,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-09 05:48:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:49,046 INFO L225 Difference]: With dead ends: 1859 [2019-09-09 05:48:49,046 INFO L226 Difference]: Without dead ends: 1859 [2019-09-09 05:48:49,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-09-09 05:48:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2019-09-09 05:48:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-09-09 05:48:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2779 transitions. [2019-09-09 05:48:49,098 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2779 transitions. Word has length 204 [2019-09-09 05:48:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:49,099 INFO L475 AbstractCegarLoop]: Abstraction has 1809 states and 2779 transitions. [2019-09-09 05:48:49,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2779 transitions. [2019-09-09 05:48:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-09 05:48:49,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:49,106 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:49,106 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash -555522276, now seen corresponding path program 1 times [2019-09-09 05:48:49,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:49,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-09 05:48:49,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:49,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:49,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:49,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:49,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:49,187 INFO L87 Difference]: Start difference. First operand 1809 states and 2779 transitions. Second operand 3 states. [2019-09-09 05:48:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:49,386 INFO L93 Difference]: Finished difference Result 1908 states and 2831 transitions. [2019-09-09 05:48:49,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:49,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-09 05:48:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:49,396 INFO L225 Difference]: With dead ends: 1908 [2019-09-09 05:48:49,396 INFO L226 Difference]: Without dead ends: 1908 [2019-09-09 05:48:49,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-09-09 05:48:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1815. [2019-09-09 05:48:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-09-09 05:48:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2712 transitions. [2019-09-09 05:48:49,446 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2712 transitions. Word has length 218 [2019-09-09 05:48:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:49,447 INFO L475 AbstractCegarLoop]: Abstraction has 1815 states and 2712 transitions. [2019-09-09 05:48:49,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2712 transitions. [2019-09-09 05:48:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-09 05:48:49,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:49,454 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-09-09 05:48:49,454 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2121219740, now seen corresponding path program 1 times [2019-09-09 05:48:49,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:49,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:49,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-09 05:48:49,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:49,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:49,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2019-09-09 05:48:49,581 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [308], [312], [438], [440], [488], [493], [496], [498], [501], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:48:49,632 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:49,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:50,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:50,842 INFO L272 AbstractInterpreter]: Visited 76 different actions 1155 times. Merged at 65 different actions 976 times. Widened at 11 different actions 96 times. Performed 2689 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 99 fixpoints after 14 different actions. Largest state had 94 variables. [2019-09-09 05:48:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:50,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:50,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:50,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:48:50,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:50,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:50,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:50,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-09 05:48:51,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-09 05:48:51,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:48:51,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:48:51,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:51,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:48:51,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:48:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:51,177 INFO L87 Difference]: Start difference. First operand 1815 states and 2712 transitions. Second operand 4 states. [2019-09-09 05:48:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:51,570 INFO L93 Difference]: Finished difference Result 2516 states and 3663 transitions. [2019-09-09 05:48:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:51,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-09 05:48:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:51,587 INFO L225 Difference]: With dead ends: 2516 [2019-09-09 05:48:51,587 INFO L226 Difference]: Without dead ends: 2483 [2019-09-09 05:48:51,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:48:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-09-09 05:48:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1641. [2019-09-09 05:48:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-09-09 05:48:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2418 transitions. [2019-09-09 05:48:51,669 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2418 transitions. Word has length 237 [2019-09-09 05:48:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:51,670 INFO L475 AbstractCegarLoop]: Abstraction has 1641 states and 2418 transitions. [2019-09-09 05:48:51,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:48:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2418 transitions. [2019-09-09 05:48:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-09 05:48:51,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:51,679 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:48:51,679 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 499648914, now seen corresponding path program 1 times [2019-09-09 05:48:51,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:51,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:51,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:51,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-09-09 05:48:51,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:51,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:51,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:51,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:51,897 INFO L87 Difference]: Start difference. First operand 1641 states and 2418 transitions. Second operand 3 states. [2019-09-09 05:48:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:52,086 INFO L93 Difference]: Finished difference Result 1846 states and 2620 transitions. [2019-09-09 05:48:52,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:52,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-09 05:48:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:52,095 INFO L225 Difference]: With dead ends: 1846 [2019-09-09 05:48:52,095 INFO L226 Difference]: Without dead ends: 1726 [2019-09-09 05:48:52,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-09 05:48:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1716. [2019-09-09 05:48:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-09-09 05:48:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2483 transitions. [2019-09-09 05:48:52,137 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2483 transitions. Word has length 246 [2019-09-09 05:48:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:52,137 INFO L475 AbstractCegarLoop]: Abstraction has 1716 states and 2483 transitions. [2019-09-09 05:48:52,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2483 transitions. [2019-09-09 05:48:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-09 05:48:52,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:52,143 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-09-09 05:48:52,144 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1931626416, now seen corresponding path program 1 times [2019-09-09 05:48:52,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:52,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:52,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:52,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:52,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:48:52,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:52,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:52,261 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-09-09 05:48:52,262 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [305], [308], [312], [438], [440], [488], [493], [496], [498], [501], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:48:52,273 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:52,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:53,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:53,265 INFO L272 AbstractInterpreter]: Visited 77 different actions 1280 times. Merged at 66 different actions 1079 times. Widened at 11 different actions 97 times. Performed 2989 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2989 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 118 fixpoints after 17 different actions. Largest state had 94 variables. [2019-09-09 05:48:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:53,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:53,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:53,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:48:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:53,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:53,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:53,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:48:53,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:48:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:48:53,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:48:53,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:53,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:48:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:48:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:53,507 INFO L87 Difference]: Start difference. First operand 1716 states and 2483 transitions. Second operand 4 states. [2019-09-09 05:48:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:53,890 INFO L93 Difference]: Finished difference Result 3696 states and 4990 transitions. [2019-09-09 05:48:53,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:53,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-09 05:48:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:53,908 INFO L225 Difference]: With dead ends: 3696 [2019-09-09 05:48:53,908 INFO L226 Difference]: Without dead ends: 3696 [2019-09-09 05:48:53,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:48:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2019-09-09 05:48:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 2041. [2019-09-09 05:48:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-09-09 05:48:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2785 transitions. [2019-09-09 05:48:53,959 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2785 transitions. Word has length 258 [2019-09-09 05:48:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:53,960 INFO L475 AbstractCegarLoop]: Abstraction has 2041 states and 2785 transitions. [2019-09-09 05:48:53,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:48:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2785 transitions. [2019-09-09 05:48:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-09 05:48:53,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:53,967 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-09-09 05:48:53,967 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2074521490, now seen corresponding path program 1 times [2019-09-09 05:48:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:53,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:53,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-09 05:48:54,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:54,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:54,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:54,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,111 INFO L87 Difference]: Start difference. First operand 2041 states and 2785 transitions. Second operand 3 states. [2019-09-09 05:48:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:54,156 INFO L93 Difference]: Finished difference Result 3783 states and 5191 transitions. [2019-09-09 05:48:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:54,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-09 05:48:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:54,174 INFO L225 Difference]: With dead ends: 3783 [2019-09-09 05:48:54,174 INFO L226 Difference]: Without dead ends: 3783 [2019-09-09 05:48:54,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-09-09 05:48:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2019-09-09 05:48:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-09-09 05:48:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5190 transitions. [2019-09-09 05:48:54,240 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5190 transitions. Word has length 258 [2019-09-09 05:48:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:54,241 INFO L475 AbstractCegarLoop]: Abstraction has 3781 states and 5190 transitions. [2019-09-09 05:48:54,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5190 transitions. [2019-09-09 05:48:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-09 05:48:54,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:54,250 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:48:54,250 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -381613367, now seen corresponding path program 1 times [2019-09-09 05:48:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:54,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:54,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:48:54,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:54,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:54,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:54,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,323 INFO L87 Difference]: Start difference. First operand 3781 states and 5190 transitions. Second operand 3 states. [2019-09-09 05:48:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:54,480 INFO L93 Difference]: Finished difference Result 4009 states and 5396 transitions. [2019-09-09 05:48:54,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:54,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-09 05:48:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:54,489 INFO L225 Difference]: With dead ends: 4009 [2019-09-09 05:48:54,490 INFO L226 Difference]: Without dead ends: 4009 [2019-09-09 05:48:54,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-09-09 05:48:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3781. [2019-09-09 05:48:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-09-09 05:48:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5086 transitions. [2019-09-09 05:48:54,555 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5086 transitions. Word has length 261 [2019-09-09 05:48:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:54,556 INFO L475 AbstractCegarLoop]: Abstraction has 3781 states and 5086 transitions. [2019-09-09 05:48:54,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5086 transitions. [2019-09-09 05:48:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-09 05:48:54,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:54,565 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:54,565 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 281332617, now seen corresponding path program 1 times [2019-09-09 05:48:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:54,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-09-09 05:48:54,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:54,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:54,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:54,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:54,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:54,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,639 INFO L87 Difference]: Start difference. First operand 3781 states and 5086 transitions. Second operand 3 states. [2019-09-09 05:48:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:54,771 INFO L93 Difference]: Finished difference Result 3913 states and 5248 transitions. [2019-09-09 05:48:54,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:54,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-09-09 05:48:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:54,781 INFO L225 Difference]: With dead ends: 3913 [2019-09-09 05:48:54,781 INFO L226 Difference]: Without dead ends: 3913 [2019-09-09 05:48:54,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2019-09-09 05:48:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3873. [2019-09-09 05:48:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-09-09 05:48:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5198 transitions. [2019-09-09 05:48:54,838 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5198 transitions. Word has length 295 [2019-09-09 05:48:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:54,838 INFO L475 AbstractCegarLoop]: Abstraction has 3873 states and 5198 transitions. [2019-09-09 05:48:54,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5198 transitions. [2019-09-09 05:48:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-09 05:48:54,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:54,850 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:54,850 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1099840201, now seen corresponding path program 1 times [2019-09-09 05:48:54,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:54,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:54,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-09 05:48:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:54,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:54,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:54,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:54,991 INFO L87 Difference]: Start difference. First operand 3873 states and 5198 transitions. Second operand 3 states. [2019-09-09 05:48:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:55,125 INFO L93 Difference]: Finished difference Result 4253 states and 5708 transitions. [2019-09-09 05:48:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:55,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-09 05:48:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:55,135 INFO L225 Difference]: With dead ends: 4253 [2019-09-09 05:48:55,135 INFO L226 Difference]: Without dead ends: 4253 [2019-09-09 05:48:55,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2019-09-09 05:48:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 4123. [2019-09-09 05:48:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2019-09-09 05:48:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5498 transitions. [2019-09-09 05:48:55,193 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5498 transitions. Word has length 316 [2019-09-09 05:48:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:55,194 INFO L475 AbstractCegarLoop]: Abstraction has 4123 states and 5498 transitions. [2019-09-09 05:48:55,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5498 transitions. [2019-09-09 05:48:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-09 05:48:55,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:55,206 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:55,206 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1319175701, now seen corresponding path program 1 times [2019-09-09 05:48:55,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:55,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:55,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:55,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-09-09 05:48:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:55,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:55,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:55,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:55,299 INFO L87 Difference]: Start difference. First operand 4123 states and 5498 transitions. Second operand 3 states. [2019-09-09 05:48:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:55,418 INFO L93 Difference]: Finished difference Result 2814 states and 3625 transitions. [2019-09-09 05:48:55,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:55,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-09 05:48:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:55,424 INFO L225 Difference]: With dead ends: 2814 [2019-09-09 05:48:55,424 INFO L226 Difference]: Without dead ends: 2170 [2019-09-09 05:48:55,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-09-09 05:48:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2019-09-09 05:48:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-09-09 05:48:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2829 transitions. [2019-09-09 05:48:55,457 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2829 transitions. Word has length 326 [2019-09-09 05:48:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:55,457 INFO L475 AbstractCegarLoop]: Abstraction has 2170 states and 2829 transitions. [2019-09-09 05:48:55,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2829 transitions. [2019-09-09 05:48:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-09 05:48:55,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:55,463 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:55,464 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash -231239372, now seen corresponding path program 1 times [2019-09-09 05:48:55,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:55,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-09 05:48:55,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:55,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:55,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:55,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:55,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:55,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:55,594 INFO L87 Difference]: Start difference. First operand 2170 states and 2829 transitions. Second operand 3 states. [2019-09-09 05:48:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:55,736 INFO L93 Difference]: Finished difference Result 2210 states and 2854 transitions. [2019-09-09 05:48:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:55,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-09 05:48:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:55,743 INFO L225 Difference]: With dead ends: 2210 [2019-09-09 05:48:55,743 INFO L226 Difference]: Without dead ends: 2210 [2019-09-09 05:48:55,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-09-09 05:48:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2170. [2019-09-09 05:48:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-09-09 05:48:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2789 transitions. [2019-09-09 05:48:55,790 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2789 transitions. Word has length 342 [2019-09-09 05:48:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:55,790 INFO L475 AbstractCegarLoop]: Abstraction has 2170 states and 2789 transitions. [2019-09-09 05:48:55,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2789 transitions. [2019-09-09 05:48:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-09 05:48:55,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:55,798 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:55,798 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash -516641400, now seen corresponding path program 1 times [2019-09-09 05:48:55,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:55,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:55,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-09-09 05:48:55,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:55,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:55,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:55,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:55,982 INFO L87 Difference]: Start difference. First operand 2170 states and 2789 transitions. Second operand 3 states. [2019-09-09 05:48:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:56,152 INFO L93 Difference]: Finished difference Result 2180 states and 2759 transitions. [2019-09-09 05:48:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:56,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-09-09 05:48:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:56,158 INFO L225 Difference]: With dead ends: 2180 [2019-09-09 05:48:56,159 INFO L226 Difference]: Without dead ends: 2180 [2019-09-09 05:48:56,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-09-09 05:48:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2170. [2019-09-09 05:48:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-09-09 05:48:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2749 transitions. [2019-09-09 05:48:56,199 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2749 transitions. Word has length 365 [2019-09-09 05:48:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:56,199 INFO L475 AbstractCegarLoop]: Abstraction has 2170 states and 2749 transitions. [2019-09-09 05:48:56,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2749 transitions. [2019-09-09 05:48:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-09 05:48:56,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:56,210 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:56,210 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:56,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash -753815824, now seen corresponding path program 1 times [2019-09-09 05:48:56,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:56,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:56,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:56,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-09 05:48:56,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:56,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:56,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2019-09-09 05:48:56,445 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [305], [308], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [479], [484], [486], [488], [493], [496], [498], [501], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:48:56,453 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:56,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:56,560 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:58,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:58,300 INFO L272 AbstractInterpreter]: Visited 101 different actions 2345 times. Merged at 88 different actions 1934 times. Widened at 20 different actions 292 times. Performed 5611 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5611 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 305 fixpoints after 29 different actions. Largest state had 97 variables. [2019-09-09 05:48:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:58,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:58,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:58,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:48:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:58,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:58,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:58,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-09-09 05:48:58,560 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-09-09 05:48:58,701 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:58,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:48:58,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:58,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:58,702 INFO L87 Difference]: Start difference. First operand 2170 states and 2749 transitions. Second operand 3 states. [2019-09-09 05:48:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:58,724 INFO L93 Difference]: Finished difference Result 2610 states and 3348 transitions. [2019-09-09 05:48:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:58,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-09 05:48:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:58,731 INFO L225 Difference]: With dead ends: 2610 [2019-09-09 05:48:58,731 INFO L226 Difference]: Without dead ends: 2610 [2019-09-09 05:48:58,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 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-09-09 05:48:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-09-09 05:48:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2034. [2019-09-09 05:48:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-09-09 05:48:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2595 transitions. [2019-09-09 05:48:58,765 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2595 transitions. Word has length 398 [2019-09-09 05:48:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:58,766 INFO L475 AbstractCegarLoop]: Abstraction has 2034 states and 2595 transitions. [2019-09-09 05:48:58,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2595 transitions. [2019-09-09 05:48:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-09 05:48:58,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:58,772 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:58,772 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1467408517, now seen corresponding path program 1 times [2019-09-09 05:48:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:58,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-09 05:48:58,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:58,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:58,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2019-09-09 05:48:58,913 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [479], [484], [486], [488], [493], [496], [498], [501], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:48:58,915 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:58,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:58,966 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:00,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:00,216 INFO L272 AbstractInterpreter]: Visited 99 different actions 2043 times. Merged at 83 different actions 1703 times. Widened at 19 different actions 261 times. Performed 4694 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4694 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 219 fixpoints after 20 different actions. Largest state had 97 variables. [2019-09-09 05:49:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:00,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:00,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:00,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:49:00,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:00,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:00,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:00,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-09 05:49:00,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-09 05:49:00,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:00,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:00,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:00,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:00,616 INFO L87 Difference]: Start difference. First operand 2034 states and 2595 transitions. Second operand 4 states. [2019-09-09 05:49:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:00,960 INFO L93 Difference]: Finished difference Result 3084 states and 3913 transitions. [2019-09-09 05:49:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:00,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 414 [2019-09-09 05:49:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:00,968 INFO L225 Difference]: With dead ends: 3084 [2019-09-09 05:49:00,968 INFO L226 Difference]: Without dead ends: 3042 [2019-09-09 05:49:00,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 828 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2019-09-09 05:49:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2194. [2019-09-09 05:49:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2019-09-09 05:49:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2815 transitions. [2019-09-09 05:49:01,013 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2815 transitions. Word has length 414 [2019-09-09 05:49:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:01,013 INFO L475 AbstractCegarLoop]: Abstraction has 2194 states and 2815 transitions. [2019-09-09 05:49:01,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2815 transitions. [2019-09-09 05:49:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-09 05:49:01,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:01,022 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:01,022 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash 591946799, now seen corresponding path program 1 times [2019-09-09 05:49:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:01,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:01,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-09-09 05:49:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:01,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:01,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:01,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:01,226 INFO L87 Difference]: Start difference. First operand 2194 states and 2815 transitions. Second operand 3 states. [2019-09-09 05:49:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:01,410 INFO L93 Difference]: Finished difference Result 2374 states and 3020 transitions. [2019-09-09 05:49:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:01,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-09 05:49:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:01,416 INFO L225 Difference]: With dead ends: 2374 [2019-09-09 05:49:01,416 INFO L226 Difference]: Without dead ends: 2374 [2019-09-09 05:49:01,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-09-09 05:49:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2364. [2019-09-09 05:49:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-09-09 05:49:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3010 transitions. [2019-09-09 05:49:01,461 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3010 transitions. Word has length 476 [2019-09-09 05:49:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:01,462 INFO L475 AbstractCegarLoop]: Abstraction has 2364 states and 3010 transitions. [2019-09-09 05:49:01,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3010 transitions. [2019-09-09 05:49:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-09-09 05:49:01,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:01,474 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:01,474 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash -957066491, now seen corresponding path program 1 times [2019-09-09 05:49:01,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:01,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:01,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-09-09 05:49:01,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:01,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:01,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:01,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:01,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:01,763 INFO L87 Difference]: Start difference. First operand 2364 states and 3010 transitions. Second operand 3 states. [2019-09-09 05:49:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:01,922 INFO L93 Difference]: Finished difference Result 2361 states and 2942 transitions. [2019-09-09 05:49:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:01,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 538 [2019-09-09 05:49:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:01,928 INFO L225 Difference]: With dead ends: 2361 [2019-09-09 05:49:01,929 INFO L226 Difference]: Without dead ends: 2361 [2019-09-09 05:49:01,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2019-09-09 05:49:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2019-09-09 05:49:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-09-09 05:49:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 2940 transitions. [2019-09-09 05:49:01,956 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 2940 transitions. Word has length 538 [2019-09-09 05:49:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:01,957 INFO L475 AbstractCegarLoop]: Abstraction has 2359 states and 2940 transitions. [2019-09-09 05:49:01,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2940 transitions. [2019-09-09 05:49:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-09-09 05:49:01,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:01,965 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:01,965 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash -995203399, now seen corresponding path program 1 times [2019-09-09 05:49:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:01,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:01,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:49:02,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:02,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:02,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 605 with the following transitions: [2019-09-09 05:49:02,284 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [442], [447], [452], [457], [460], [465], [467], [472], [474], [479], [484], [486], [488], [493], [496], [498], [501], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:02,292 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:02,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:02,374 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:03,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:03,686 INFO L272 AbstractInterpreter]: Visited 110 different actions 2232 times. Merged at 93 different actions 1813 times. Widened at 22 different actions 292 times. Performed 5348 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5348 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 260 fixpoints after 22 different actions. Largest state had 101 variables. [2019-09-09 05:49:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:03,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:03,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:03,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:03,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:03,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:03,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:03,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:49:03,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:49:04,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:04,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:04,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:04,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:04,195 INFO L87 Difference]: Start difference. First operand 2359 states and 2940 transitions. Second operand 4 states. [2019-09-09 05:49:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:04,405 INFO L93 Difference]: Finished difference Result 1640 states and 2020 transitions. [2019-09-09 05:49:04,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:49:04,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 604 [2019-09-09 05:49:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:04,407 INFO L225 Difference]: With dead ends: 1640 [2019-09-09 05:49:04,408 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:04,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:04,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2019-09-09 05:49:04,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:04,411 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:04,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:04,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:04,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:04 BoogieIcfgContainer [2019-09-09 05:49:04,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:04,421 INFO L168 Benchmark]: Toolchain (without parser) took 23270.77 ms. Allocated memory was 139.5 MB in the beginning and 1.1 GB in the end (delta: 997.2 MB). Free memory was 86.6 MB in the beginning and 980.4 MB in the end (delta: -893.8 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:04,422 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 105.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:49:04,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.45 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 86.2 MB in the beginning and 175.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:04,426 INFO L168 Benchmark]: Boogie Preprocessor took 94.91 ms. Allocated memory is still 200.3 MB. Free memory was 175.0 MB in the beginning and 171.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:04,435 INFO L168 Benchmark]: RCFGBuilder took 837.17 ms. Allocated memory is still 200.3 MB. Free memory was 171.9 MB in the beginning and 123.3 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:04,435 INFO L168 Benchmark]: TraceAbstraction took 21792.18 ms. Allocated memory was 200.3 MB in the beginning and 1.1 GB in the end (delta: 936.4 MB). Free memory was 122.4 MB in the beginning and 980.4 MB in the end (delta: -858.0 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:04,444 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 105.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 539.45 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 86.2 MB in the beginning and 175.0 MB in the end (delta: -88.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.91 ms. Allocated memory is still 200.3 MB. Free memory was 175.0 MB in the beginning and 171.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.17 ms. Allocated memory is still 200.3 MB. Free memory was 171.9 MB in the beginning and 123.3 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21792.18 ms. Allocated memory was 200.3 MB in the beginning and 1.1 GB in the end (delta: 936.4 MB). Free memory was 122.4 MB in the beginning and 980.4 MB in the end (delta: -858.0 MB). Peak memory consumption was 78.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 149 locations, 1 error locations. SAFE Result, 21.7s OverallTime, 35 OverallIterations, 19 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7143 SDtfs, 7553 SDslu, 5543 SDs, 0 SdLazy, 4512 SolverSat, 988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3977 GetRequests, 3882 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4123occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.8s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4588 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 9449 NumberOfCodeBlocks, 9449 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 11315 ConstructedInterpolants, 0 QuantifiedInterpolants, 5283884 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3300 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 45 InterpolantComputations, 32 PerfectInterpolantSequences, 38793/39101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...