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_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:48:15,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:48:15,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:48:15,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:48:15,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:48:15,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:48:15,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:48:15,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:48:15,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:48:15,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:48:15,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:48:15,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:48:15,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:48:15,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:48:15,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:48:15,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:48:15,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:48:15,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:48:15,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:48:15,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:48:15,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:48:15,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:48:15,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:48:15,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:48:15,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:48:15,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:48:15,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:48:15,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:48:15,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:48:15,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:48:15,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:48:15,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:48:15,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:48:15,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:48:15,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:48:15,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:48:15,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:48:15,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:48:15,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:48:15,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:48:15,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:48:15,175 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:15,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:48:15,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:48:15,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:48:15,201 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:48:15,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:48:15,202 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:48:15,202 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:48:15,202 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:48:15,203 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:48:15,203 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:48:15,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:48:15,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:48:15,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:48:15,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:48:15,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:48:15,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:48:15,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:48:15,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:48:15,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:48:15,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:48:15,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:48:15,208 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:48:15,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:48:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:48:15,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:48:15,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:48:15,209 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:48:15,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:48:15,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:48:15,210 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:48:15,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:48:15,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:48:15,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:48:15,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:48:15,269 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:48:15,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-09-09 05:48:15,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6ea6653/6f57ac2cdad14252b01e7588808ec9f2/FLAG2ac073482 [2019-09-09 05:48:15,820 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:48:15,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-09-09 05:48:15,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6ea6653/6f57ac2cdad14252b01e7588808ec9f2/FLAG2ac073482 [2019-09-09 05:48:16,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6ea6653/6f57ac2cdad14252b01e7588808ec9f2 [2019-09-09 05:48:16,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:48:16,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:48:16,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:48:16,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:48:16,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:48:16,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:48:16" (1/1) ... [2019-09-09 05:48:16,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9ff418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:16, skipping insertion in model container [2019-09-09 05:48:16,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:48:16" (1/1) ... [2019-09-09 05:48:16,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:48:16,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:48:16,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:48:16,845 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:48:16,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:48:16,936 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:48:16,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:16 WrapperNode [2019-09-09 05:48:16,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:48:16,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:48:16,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:48:16,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:48:16,947 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:16" (1/1) ... [2019-09-09 05:48:16,948 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:16" (1/1) ... [2019-09-09 05:48:16,956 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:16" (1/1) ... [2019-09-09 05:48:16,957 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:16" (1/1) ... [2019-09-09 05:48:16,969 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:16" (1/1) ... [2019-09-09 05:48:16,983 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:16" (1/1) ... [2019-09-09 05:48:16,986 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:16" (1/1) ... [2019-09-09 05:48:16,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:48:16,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:48:16,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:48:16,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:48:16,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:16" (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:17,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:48:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:48:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:48:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:48:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:48:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:48:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:48:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:48:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:48:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:48:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:48:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:48:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:48:17,278 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:48:17,804 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:48:17,805 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:48:17,808 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:48:17,808 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:48:17,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:48:17 BoogieIcfgContainer [2019-09-09 05:48:17,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:48:17,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:48:17,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:48:17,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:48:17,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:48:16" (1/3) ... [2019-09-09 05:48:17,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4458e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:48:17, skipping insertion in model container [2019-09-09 05:48:17,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:16" (2/3) ... [2019-09-09 05:48:17,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4458e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:48:17, skipping insertion in model container [2019-09-09 05:48:17,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:48:17" (3/3) ... [2019-09-09 05:48:17,831 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-09-09 05:48:17,843 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:48:17,853 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:48:17,867 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:48:17,892 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:48:17,892 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:48:17,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:48:17,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:48:17,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:48:17,893 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:48:17,893 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:48:17,893 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:48:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-09 05:48:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:48:17,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:17,924 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:17,926 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-09-09 05:48:17,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:17,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:17,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:17,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:18,228 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:18,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:18,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:18,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:18,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:18,258 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-09-09 05:48:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:18,693 INFO L93 Difference]: Finished difference Result 201 states and 337 transitions. [2019-09-09 05:48:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:18,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:48:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:18,709 INFO L225 Difference]: With dead ends: 201 [2019-09-09 05:48:18,709 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:48:18,711 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:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:48:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-09-09 05:48:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:48:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-09-09 05:48:18,767 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-09-09 05:48:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:18,767 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-09-09 05:48:18,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-09-09 05:48:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:48:18,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:18,771 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:18,771 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-09-09 05:48:18,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:18,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:18,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:18,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:18,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:18,934 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:18,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:18,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:18,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:18,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:18,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:18,939 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-09-09 05:48:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:19,270 INFO L93 Difference]: Finished difference Result 223 states and 365 transitions. [2019-09-09 05:48:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:19,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:48:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:19,276 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:48:19,276 INFO L226 Difference]: Without dead ends: 221 [2019-09-09 05:48:19,280 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:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-09 05:48:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-09-09 05:48:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-09 05:48:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-09-09 05:48:19,315 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-09-09 05:48:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:19,316 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-09-09 05:48:19,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-09-09 05:48:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:48:19,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:19,321 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:19,321 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-09-09 05:48:19,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:19,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:19,444 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:19,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:19,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:19,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:19,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:19,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:19,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:19,448 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-09-09 05:48:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:19,716 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-09-09 05:48:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:19,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-09 05:48:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:19,723 INFO L225 Difference]: With dead ends: 247 [2019-09-09 05:48:19,724 INFO L226 Difference]: Without dead ends: 247 [2019-09-09 05:48:19,726 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:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-09 05:48:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-09 05:48:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-09 05:48:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-09-09 05:48:19,744 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-09-09 05:48:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:19,745 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-09-09 05:48:19,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-09-09 05:48:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:48:19,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:19,748 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:19,749 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-09-09 05:48:19,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:19,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:19,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:19,858 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:19,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:19,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:19,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:19,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:19,860 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-09-09 05:48:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:20,043 INFO L93 Difference]: Finished difference Result 264 states and 438 transitions. [2019-09-09 05:48:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:20,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:48:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:20,046 INFO L225 Difference]: With dead ends: 264 [2019-09-09 05:48:20,046 INFO L226 Difference]: Without dead ends: 264 [2019-09-09 05:48:20,047 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:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-09 05:48:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-09 05:48:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-09 05:48:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-09-09 05:48:20,064 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-09-09 05:48:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:20,064 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-09-09 05:48:20,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-09-09 05:48:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:48:20,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:20,071 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:20,071 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-09-09 05:48:20,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:20,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:20,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:20,178 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:20,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:20,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:20,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:20,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:20,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:20,180 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-09-09 05:48:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:20,422 INFO L93 Difference]: Finished difference Result 308 states and 515 transitions. [2019-09-09 05:48:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:20,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:48:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:20,425 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:48:20,425 INFO L226 Difference]: Without dead ends: 308 [2019-09-09 05:48:20,425 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:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-09 05:48:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-09-09 05:48:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:48:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-09-09 05:48:20,436 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-09-09 05:48:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:20,437 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-09-09 05:48:20,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-09-09 05:48:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:48:20,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:20,439 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:20,440 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-09-09 05:48:20,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:20,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:20,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:20,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:20,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:20,516 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:20,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:20,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:20,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:20,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:20,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:20,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:20,519 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-09-09 05:48:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:20,708 INFO L93 Difference]: Finished difference Result 306 states and 508 transitions. [2019-09-09 05:48:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:20,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:48:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:20,711 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:48:20,711 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:48:20,711 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:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:48:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-09 05:48:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:48:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-09-09 05:48:20,720 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-09-09 05:48:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:20,721 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-09-09 05:48:20,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-09-09 05:48:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:48:20,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:20,723 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:20,723 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-09-09 05:48:20,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:20,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:20,778 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:20,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:20,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:20,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:20,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:20,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:20,780 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-09-09 05:48:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:21,006 INFO L93 Difference]: Finished difference Result 308 states and 509 transitions. [2019-09-09 05:48:21,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:21,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:48:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:21,009 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:48:21,009 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:48:21,010 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:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:48:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-09-09 05:48:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-09 05:48:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-09-09 05:48:21,016 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-09-09 05:48:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:21,018 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-09-09 05:48:21,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-09-09 05:48:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:48:21,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:21,020 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:21,020 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-09-09 05:48:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:21,090 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:21,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:21,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:21,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:21,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:21,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:21,092 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-09-09 05:48:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:21,257 INFO L93 Difference]: Finished difference Result 311 states and 507 transitions. [2019-09-09 05:48:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:21,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-09 05:48:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:21,259 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:48:21,259 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:48:21,260 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:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:48:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-09-09 05:48:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-09 05:48:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-09-09 05:48:21,268 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-09-09 05:48:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:21,268 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-09-09 05:48:21,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-09-09 05:48:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:48:21,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:21,270 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:21,270 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-09-09 05:48:21,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:21,318 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:21,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:21,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:21,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:21,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:21,320 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-09-09 05:48:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:21,509 INFO L93 Difference]: Finished difference Result 342 states and 556 transitions. [2019-09-09 05:48:21,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:21,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:48:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:21,512 INFO L225 Difference]: With dead ends: 342 [2019-09-09 05:48:21,512 INFO L226 Difference]: Without dead ends: 342 [2019-09-09 05:48:21,512 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:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-09 05:48:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-09 05:48:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:48:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-09-09 05:48:21,521 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-09-09 05:48:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:21,521 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-09-09 05:48:21,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-09-09 05:48:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:48:21,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:21,523 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:21,524 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-09-09 05:48:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:21,578 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:21,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:21,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:21,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:21,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:21,580 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-09-09 05:48:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:21,782 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-09-09 05:48:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:21,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:48:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:21,785 INFO L225 Difference]: With dead ends: 342 [2019-09-09 05:48:21,785 INFO L226 Difference]: Without dead ends: 342 [2019-09-09 05:48:21,786 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:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-09 05:48:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-09 05:48:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:48:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-09-09 05:48:21,796 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-09-09 05:48:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:21,796 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-09-09 05:48:21,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-09-09 05:48:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:48:21,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:21,799 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:21,799 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:21,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-09-09 05:48:21,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:21,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:21,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:21,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:21,864 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:21,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:21,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:21,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:21,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:21,866 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-09-09 05:48:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:22,058 INFO L93 Difference]: Finished difference Result 375 states and 605 transitions. [2019-09-09 05:48:22,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:22,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:48:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:22,061 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:48:22,061 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:48:22,062 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:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:48:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-09 05:48:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:48:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-09-09 05:48:22,071 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-09-09 05:48:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:22,071 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-09-09 05:48:22,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-09-09 05:48:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:48:22,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:22,073 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:22,074 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-09-09 05:48:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:22,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:22,156 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:22,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:22,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:22,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:22,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:22,159 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-09-09 05:48:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:22,381 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-09-09 05:48:22,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:22,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-09 05:48:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:22,384 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:48:22,384 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:48:22,385 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:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:48:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-09 05:48:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:48:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-09-09 05:48:22,393 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-09-09 05:48:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:22,394 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-09-09 05:48:22,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-09-09 05:48:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:48:22,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:22,396 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:22,396 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-09-09 05:48:22,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:22,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:22,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:22,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:22,456 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:22,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:22,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:22,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:22,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:22,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:22,458 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-09-09 05:48:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:22,686 INFO L93 Difference]: Finished difference Result 392 states and 622 transitions. [2019-09-09 05:48:22,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:22,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-09 05:48:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:22,690 INFO L225 Difference]: With dead ends: 392 [2019-09-09 05:48:22,690 INFO L226 Difference]: Without dead ends: 392 [2019-09-09 05:48:22,691 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:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-09 05:48:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-09 05:48:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:48:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-09-09 05:48:22,704 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-09-09 05:48:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:22,704 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-09-09 05:48:22,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-09-09 05:48:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:48:22,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:22,708 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:22,708 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-09-09 05:48:22,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:22,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:22,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:22,770 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:22,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:22,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:22,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:22,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:22,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:22,773 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-09-09 05:48:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:22,999 INFO L93 Difference]: Finished difference Result 392 states and 616 transitions. [2019-09-09 05:48:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:23,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:48:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:23,002 INFO L225 Difference]: With dead ends: 392 [2019-09-09 05:48:23,002 INFO L226 Difference]: Without dead ends: 392 [2019-09-09 05:48:23,002 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:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-09 05:48:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-09 05:48:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:48:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-09-09 05:48:23,011 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-09-09 05:48:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:23,011 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-09-09 05:48:23,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-09-09 05:48:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:48:23,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:23,014 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:23,014 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-09-09 05:48:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:23,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:23,055 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:23,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:23,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:23,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:23,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:23,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:23,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:23,057 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-09-09 05:48:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:23,087 INFO L93 Difference]: Finished difference Result 761 states and 1201 transitions. [2019-09-09 05:48:23,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:23,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-09 05:48:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:23,092 INFO L225 Difference]: With dead ends: 761 [2019-09-09 05:48:23,092 INFO L226 Difference]: Without dead ends: 761 [2019-09-09 05:48:23,092 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:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-09-09 05:48:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-09-09 05:48:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-09 05:48:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-09-09 05:48:23,110 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-09-09 05:48:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:23,110 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-09-09 05:48:23,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-09-09 05:48:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:48:23,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:23,114 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, 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] [2019-09-09 05:48:23,114 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-09-09 05:48:23,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:23,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:23,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:23,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:23,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:23,174 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-09-09 05:48:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:23,401 INFO L93 Difference]: Finished difference Result 845 states and 1331 transitions. [2019-09-09 05:48:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:23,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-09 05:48:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:23,406 INFO L225 Difference]: With dead ends: 845 [2019-09-09 05:48:23,406 INFO L226 Difference]: Without dead ends: 845 [2019-09-09 05:48:23,407 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:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-09 05:48:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-09-09 05:48:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-09 05:48:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-09-09 05:48:23,431 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-09-09 05:48:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:23,431 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-09-09 05:48:23,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-09-09 05:48:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:48:23,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:23,435 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, 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] [2019-09-09 05:48:23,436 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-09-09 05:48:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:23,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:23,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:23,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:23,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:23,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:23,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:23,503 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-09-09 05:48:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:23,709 INFO L93 Difference]: Finished difference Result 845 states and 1325 transitions. [2019-09-09 05:48:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:23,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-09 05:48:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:23,713 INFO L225 Difference]: With dead ends: 845 [2019-09-09 05:48:23,713 INFO L226 Difference]: Without dead ends: 841 [2019-09-09 05:48:23,714 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:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-09 05:48:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-09-09 05:48:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-09 05:48:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-09-09 05:48:23,732 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-09-09 05:48:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:23,732 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-09-09 05:48:23,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-09-09 05:48:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:48:23,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:23,735 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:23,736 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-09-09 05:48:23,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:23,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 05:48:23,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:23,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:23,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:23,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:23,796 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-09-09 05:48:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:24,001 INFO L93 Difference]: Finished difference Result 909 states and 1419 transitions. [2019-09-09 05:48:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:24,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-09-09 05:48:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:24,008 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:48:24,008 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:48:24,008 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:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:48:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-09-09 05:48:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-09 05:48:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-09-09 05:48:24,031 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-09-09 05:48:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:24,031 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-09-09 05:48:24,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-09-09 05:48:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:48:24,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:24,037 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:24,037 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-09-09 05:48:24,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:24,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:24,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:24,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 05:48:24,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:24,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:24,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:24,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:24,108 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-09-09 05:48:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:24,352 INFO L93 Difference]: Finished difference Result 909 states and 1411 transitions. [2019-09-09 05:48:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:24,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-09 05:48:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:24,357 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:48:24,357 INFO L226 Difference]: Without dead ends: 905 [2019-09-09 05:48:24,358 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:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-09 05:48:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-09-09 05:48:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-09-09 05:48:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-09-09 05:48:24,375 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-09-09 05:48:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:24,376 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-09-09 05:48:24,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-09-09 05:48:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-09 05:48:24,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:24,380 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:24,380 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-09-09 05:48:24,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:24,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:24,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-09 05:48:24,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:24,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:24,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:24,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:24,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:24,448 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-09-09 05:48:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:24,661 INFO L93 Difference]: Finished difference Result 973 states and 1503 transitions. [2019-09-09 05:48:24,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:24,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-09-09 05:48:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:24,666 INFO L225 Difference]: With dead ends: 973 [2019-09-09 05:48:24,666 INFO L226 Difference]: Without dead ends: 973 [2019-09-09 05:48:24,666 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:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-09 05:48:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-09-09 05:48:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-09-09 05:48:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-09-09 05:48:24,685 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-09-09 05:48:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:24,686 INFO L475 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-09-09 05:48:24,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-09-09 05:48:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-09 05:48:24,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:24,690 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:24,690 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-09-09 05:48:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:24,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:24,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:24,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-09 05:48:24,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:24,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:24,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:24,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:24,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:24,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:24,760 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-09-09 05:48:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:24,976 INFO L93 Difference]: Finished difference Result 973 states and 1493 transitions. [2019-09-09 05:48:24,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:24,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-09-09 05:48:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:24,981 INFO L225 Difference]: With dead ends: 973 [2019-09-09 05:48:24,981 INFO L226 Difference]: Without dead ends: 969 [2019-09-09 05:48:24,981 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:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-09 05:48:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-09-09 05:48:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-09 05:48:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-09-09 05:48:24,999 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-09-09 05:48:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:24,999 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-09-09 05:48:25,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-09-09 05:48:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-09 05:48:25,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:25,004 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:25,005 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-09-09 05:48:25,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:25,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-09 05:48:25,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:25,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:25,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:25,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:25,108 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-09-09 05:48:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:25,298 INFO L93 Difference]: Finished difference Result 1041 states and 1589 transitions. [2019-09-09 05:48:25,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:25,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-09-09 05:48:25,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:25,305 INFO L225 Difference]: With dead ends: 1041 [2019-09-09 05:48:25,305 INFO L226 Difference]: Without dead ends: 1041 [2019-09-09 05:48:25,306 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:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-09-09 05:48:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-09-09 05:48:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-09-09 05:48:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-09-09 05:48:25,325 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-09-09 05:48:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:25,325 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-09-09 05:48:25,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-09-09 05:48:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-09 05:48:25,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:25,329 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:25,330 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-09-09 05:48:25,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:25,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:25,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:25,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:25,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-09 05:48:25,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:25,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:25,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:25,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:25,402 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-09-09 05:48:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:25,622 INFO L93 Difference]: Finished difference Result 1041 states and 1571 transitions. [2019-09-09 05:48:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:25,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-09 05:48:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:25,627 INFO L225 Difference]: With dead ends: 1041 [2019-09-09 05:48:25,628 INFO L226 Difference]: Without dead ends: 1041 [2019-09-09 05:48:25,628 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:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-09-09 05:48:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-09-09 05:48:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-09-09 05:48:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-09-09 05:48:25,645 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-09-09 05:48:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:25,646 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-09-09 05:48:25,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-09-09 05:48:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-09 05:48:25,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:25,650 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:25,650 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-09-09 05:48:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:25,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:25,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-09 05:48:25,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:25,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:25,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:25,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:25,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:25,760 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-09-09 05:48:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:26,057 INFO L93 Difference]: Finished difference Result 1023 states and 1527 transitions. [2019-09-09 05:48:26,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:26,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-09-09 05:48:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:26,062 INFO L225 Difference]: With dead ends: 1023 [2019-09-09 05:48:26,062 INFO L226 Difference]: Without dead ends: 1023 [2019-09-09 05:48:26,063 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:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-09-09 05:48:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-09-09 05:48:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-09-09 05:48:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-09-09 05:48:26,099 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-09-09 05:48:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:26,099 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-09-09 05:48:26,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-09-09 05:48:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-09 05:48:26,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:26,103 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:26,103 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-09-09 05:48:26,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:26,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:26,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-09 05:48:26,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:26,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:26,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:26,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:26,175 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-09-09 05:48:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:26,358 INFO L93 Difference]: Finished difference Result 1023 states and 1515 transitions. [2019-09-09 05:48:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:26,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-09-09 05:48:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:26,364 INFO L225 Difference]: With dead ends: 1023 [2019-09-09 05:48:26,364 INFO L226 Difference]: Without dead ends: 1005 [2019-09-09 05:48:26,364 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:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-09 05:48:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-09-09 05:48:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-09 05:48:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-09-09 05:48:26,381 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-09-09 05:48:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:26,382 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-09-09 05:48:26,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-09-09 05:48:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-09 05:48:26,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:26,385 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:26,386 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-09-09 05:48:26,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:26,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:26,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-09 05:48:26,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:26,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:26,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:26,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:26,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:26,469 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-09-09 05:48:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:26,651 INFO L93 Difference]: Finished difference Result 1051 states and 1543 transitions. [2019-09-09 05:48:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:26,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-09 05:48:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:26,656 INFO L225 Difference]: With dead ends: 1051 [2019-09-09 05:48:26,657 INFO L226 Difference]: Without dead ends: 1051 [2019-09-09 05:48:26,657 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:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-09 05:48:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-09-09 05:48:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-09 05:48:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-09-09 05:48:26,674 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-09-09 05:48:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:26,674 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-09-09 05:48:26,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-09-09 05:48:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-09 05:48:26,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:26,677 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:26,678 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-09-09 05:48:26,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-09 05:48:26,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:26,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:26,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:26,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:26,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:26,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:26,762 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-09-09 05:48:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:26,941 INFO L93 Difference]: Finished difference Result 1051 states and 1523 transitions. [2019-09-09 05:48:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:26,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-09 05:48:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:26,946 INFO L225 Difference]: With dead ends: 1051 [2019-09-09 05:48:26,946 INFO L226 Difference]: Without dead ends: 1043 [2019-09-09 05:48:26,947 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:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-09-09 05:48:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-09-09 05:48:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-09-09 05:48:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-09-09 05:48:26,962 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-09-09 05:48:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:26,962 INFO L475 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-09-09 05:48:26,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-09-09 05:48:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-09 05:48:26,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:26,965 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:26,966 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-09-09 05:48:26,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:26,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:26,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:26,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-09 05:48:27,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:27,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:27,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2019-09-09 05:48:27,074 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], [477], [485], [490], [492], [494], [499], [504], [510], [515], [517], [520], [588], [590], [602], [605], [606], [607], [609] [2019-09-09 05:48:27,134 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:27,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:27,588 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:29,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:29,108 INFO L272 AbstractInterpreter]: Visited 94 different actions 1935 times. Merged at 81 different actions 1633 times. Widened at 18 different actions 251 times. Performed 4413 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4413 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 175 fixpoints after 24 different actions. Largest state had 97 variables. [2019-09-09 05:48:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:29,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:29,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:29,114 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) [2019-09-09 05:48:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:29,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:48:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:29,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:48:29,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-09 05:48:29,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-09 05:48:29,566 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:29,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:48:29,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:29,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:29,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:29,569 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-09-09 05:48:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:29,608 INFO L93 Difference]: Finished difference Result 1545 states and 2241 transitions. [2019-09-09 05:48:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:29,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-09-09 05:48:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:29,617 INFO L225 Difference]: With dead ends: 1545 [2019-09-09 05:48:29,618 INFO L226 Difference]: Without dead ends: 1545 [2019-09-09 05:48:29,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-09-09 05:48:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-09-09 05:48:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-09-09 05:48:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-09-09 05:48:29,651 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-09-09 05:48:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:29,652 INFO L475 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-09-09 05:48:29,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-09-09 05:48:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-09 05:48:29,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:29,656 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,657 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-09-09 05:48:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:29,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-09 05:48:29,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:29,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:29,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:29,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:29,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:29,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:29,786 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-09-09 05:48:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:29,811 INFO L93 Difference]: Finished difference Result 2996 states and 4336 transitions. [2019-09-09 05:48:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:29,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-09 05:48:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:29,824 INFO L225 Difference]: With dead ends: 2996 [2019-09-09 05:48:29,824 INFO L226 Difference]: Without dead ends: 2996 [2019-09-09 05:48:29,826 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:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-09-09 05:48:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-09-09 05:48:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-09-09 05:48:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-09-09 05:48:29,869 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-09-09 05:48:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:29,870 INFO L475 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-09-09 05:48:29,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-09-09 05:48:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-09 05:48:29,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:29,876 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,876 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-09-09 05:48:29,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:29,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:29,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-09 05:48:29,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:29,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:29,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:29,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:29,967 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-09-09 05:48:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:30,109 INFO L93 Difference]: Finished difference Result 3114 states and 4479 transitions. [2019-09-09 05:48:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:30,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-09 05:48:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:30,122 INFO L225 Difference]: With dead ends: 3114 [2019-09-09 05:48:30,122 INFO L226 Difference]: Without dead ends: 1997 [2019-09-09 05:48:30,123 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:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-09-09 05:48:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-09-09 05:48:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-09-09 05:48:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-09-09 05:48:30,171 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-09-09 05:48:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:30,172 INFO L475 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-09-09 05:48:30,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-09-09 05:48:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-09 05:48:30,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:30,181 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:30,181 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-09-09 05:48:30,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:30,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:48:30,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:30,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:30,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2019-09-09 05:48:30,430 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], [477], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [527], [532], [534], [588], [590], [602], [605], [606], [607], [609] [2019-09-09 05:48:30,435 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:30,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:30,508 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:31,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:31,831 INFO L272 AbstractInterpreter]: Visited 99 different actions 2044 times. Merged at 86 different actions 1705 times. Widened at 19 different actions 262 times. Performed 4771 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4771 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 218 fixpoints after 21 different actions. Largest state had 97 variables. [2019-09-09 05:48:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:31,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:31,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:31,832 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:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:31,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:31,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:31,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:48:32,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:48:32,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:48:32,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:48:32,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:32,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:48:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:48:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:32,199 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 4 states. [2019-09-09 05:48:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:32,500 INFO L93 Difference]: Finished difference Result 2626 states and 3591 transitions. [2019-09-09 05:48:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:32,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-09-09 05:48:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:32,520 INFO L225 Difference]: With dead ends: 2626 [2019-09-09 05:48:32,520 INFO L226 Difference]: Without dead ends: 2582 [2019-09-09 05:48:32,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 754 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:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-09-09 05:48:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1954. [2019-09-09 05:48:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-09 05:48:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-09-09 05:48:32,552 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 377 [2019-09-09 05:48:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:32,553 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-09-09 05:48:32,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:48:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-09-09 05:48:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-09 05:48:32,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:32,560 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, 1] [2019-09-09 05:48:32,560 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:32,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-09-09 05:48:32,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:32,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:32,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:32,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:32,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:48:32,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:32,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:32,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 606 with the following transitions: [2019-09-09 05:48:32,891 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], [477], [479], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [527], [532], [534], [588], [590], [602], [605], [606], [607], [609] [2019-09-09 05:48:32,896 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:32,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:32,948 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:34,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:48:34,117 INFO L272 AbstractInterpreter]: Visited 111 different actions 2225 times. Merged at 94 different actions 1799 times. Widened at 21 different actions 282 times. Performed 5405 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 275 fixpoints after 24 different actions. Largest state had 101 variables. [2019-09-09 05:48:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:34,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:48:34,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:34,118 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:34,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:34,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:48:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:34,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:48:34,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:48:34,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:48:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:48:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:48:34,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:34,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:48:34,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:48:34,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:34,645 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 4 states. [2019-09-09 05:48:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:34,899 INFO L93 Difference]: Finished difference Result 2874 states and 3940 transitions. [2019-09-09 05:48:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:48:34,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-09-09 05:48:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:34,906 INFO L225 Difference]: With dead ends: 2874 [2019-09-09 05:48:34,906 INFO L226 Difference]: Without dead ends: 2736 [2019-09-09 05:48:34,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1210 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:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-09-09 05:48:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1954. [2019-09-09 05:48:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-09 05:48:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-09-09 05:48:34,938 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 605 [2019-09-09 05:48:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:34,939 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-09-09 05:48:34,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:48:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-09-09 05:48:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-09 05:48:34,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:34,947 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:34,947 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-09-09 05:48:34,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:34,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:34,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-09-09 05:48:35,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:35,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:35,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:35,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:35,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:35,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:35,275 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 3 states. [2019-09-09 05:48:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:35,437 INFO L93 Difference]: Finished difference Result 1994 states and 2726 transitions. [2019-09-09 05:48:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:35,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-09-09 05:48:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:35,444 INFO L225 Difference]: With dead ends: 1994 [2019-09-09 05:48:35,444 INFO L226 Difference]: Without dead ends: 1994 [2019-09-09 05:48:35,444 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:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-09-09 05:48:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1954. [2019-09-09 05:48:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-09 05:48:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2678 transitions. [2019-09-09 05:48:35,467 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2678 transitions. Word has length 675 [2019-09-09 05:48:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:35,468 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2678 transitions. [2019-09-09 05:48:35,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2678 transitions. [2019-09-09 05:48:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-09 05:48:35,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:35,475 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,475 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-09-09 05:48:35,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:35,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:35,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-09-09 05:48:35,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:35,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:35,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:35,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:35,867 INFO L87 Difference]: Start difference. First operand 1954 states and 2678 transitions. Second operand 3 states. [2019-09-09 05:48:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:36,054 INFO L93 Difference]: Finished difference Result 1986 states and 2677 transitions. [2019-09-09 05:48:36,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:36,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-09-09 05:48:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:36,061 INFO L225 Difference]: With dead ends: 1986 [2019-09-09 05:48:36,061 INFO L226 Difference]: Without dead ends: 1986 [2019-09-09 05:48:36,062 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:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-09-09 05:48:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1941. [2019-09-09 05:48:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-09-09 05:48:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2619 transitions. [2019-09-09 05:48:36,106 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2619 transitions. Word has length 689 [2019-09-09 05:48:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:36,108 INFO L475 AbstractCegarLoop]: Abstraction has 1941 states and 2619 transitions. [2019-09-09 05:48:36,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2619 transitions. [2019-09-09 05:48:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-09-09 05:48:36,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:36,124 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 2, 2, 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:36,124 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-09-09 05:48:36,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:36,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:36,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:36,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-09-09 05:48:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:36,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:36,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:36,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:36,787 INFO L87 Difference]: Start difference. First operand 1941 states and 2619 transitions. Second operand 3 states. [2019-09-09 05:48:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:36,910 INFO L93 Difference]: Finished difference Result 2021 states and 2706 transitions. [2019-09-09 05:48:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:36,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-09-09 05:48:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:36,915 INFO L225 Difference]: With dead ends: 2021 [2019-09-09 05:48:36,915 INFO L226 Difference]: Without dead ends: 2003 [2019-09-09 05:48:36,916 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:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-09-09 05:48:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1983. [2019-09-09 05:48:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-09-09 05:48:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2664 transitions. [2019-09-09 05:48:36,938 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2664 transitions. Word has length 717 [2019-09-09 05:48:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:36,939 INFO L475 AbstractCegarLoop]: Abstraction has 1983 states and 2664 transitions. [2019-09-09 05:48:36,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2664 transitions. [2019-09-09 05:48:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-09-09 05:48:36,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:36,948 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 2, 2, 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] [2019-09-09 05:48:36,949 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-09-09 05:48:36,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:36,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:36,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:36,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:36,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-09-09 05:48:37,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:37,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:37,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:37,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:37,287 INFO L87 Difference]: Start difference. First operand 1983 states and 2664 transitions. Second operand 3 states. [2019-09-09 05:48:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:37,419 INFO L93 Difference]: Finished difference Result 584 states and 742 transitions. [2019-09-09 05:48:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:37,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-09-09 05:48:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:37,421 INFO L225 Difference]: With dead ends: 584 [2019-09-09 05:48:37,421 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:48:37,422 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:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:48:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:48:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:48:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:48:37,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-09-09 05:48:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:37,424 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:48:37,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:48:37,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:48:37,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:48:37 BoogieIcfgContainer [2019-09-09 05:48:37,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:48:37,432 INFO L168 Benchmark]: Toolchain (without parser) took 21107.51 ms. Allocated memory was 141.0 MB in the beginning and 1.0 GB in the end (delta: 896.5 MB). Free memory was 88.5 MB in the beginning and 813.2 MB in the end (delta: -724.7 MB). Peak memory consumption was 171.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:37,433 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:48:37,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.86 ms. Allocated memory was 141.0 MB in the beginning and 198.2 MB in the end (delta: 57.1 MB). Free memory was 88.1 MB in the beginning and 172.0 MB in the end (delta: -83.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:37,434 INFO L168 Benchmark]: Boogie Preprocessor took 53.05 ms. Allocated memory is still 198.2 MB. Free memory was 172.0 MB in the beginning and 169.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:37,435 INFO L168 Benchmark]: RCFGBuilder took 819.89 ms. Allocated memory is still 198.2 MB. Free memory was 169.0 MB in the beginning and 120.3 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:37,435 INFO L168 Benchmark]: TraceAbstraction took 19618.08 ms. Allocated memory was 198.2 MB in the beginning and 1.0 GB in the end (delta: 839.4 MB). Free memory was 120.3 MB in the beginning and 813.2 MB in the end (delta: -692.9 MB). Peak memory consumption was 146.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:48:37,439 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 611.86 ms. Allocated memory was 141.0 MB in the beginning and 198.2 MB in the end (delta: 57.1 MB). Free memory was 88.1 MB in the beginning and 172.0 MB in the end (delta: -83.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.05 ms. Allocated memory is still 198.2 MB. Free memory was 172.0 MB in the beginning and 169.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.89 ms. Allocated memory is still 198.2 MB. Free memory was 169.0 MB in the beginning and 120.3 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19618.08 ms. Allocated memory was 198.2 MB in the beginning and 1.0 GB in the end (delta: 839.4 MB). Free memory was 120.3 MB in the beginning and 813.2 MB in the end (delta: -692.9 MB). Peak memory consumption was 146.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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, 19.5s OverallTime, 36 OverallIterations, 25 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5781 SDtfs, 11352 SDslu, 5755 SDs, 0 SdLazy, 5231 SolverSat, 1413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2688 GetRequests, 2563 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2994occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 1703 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 9581 NumberOfCodeBlocks, 9581 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10788 ConstructedInterpolants, 0 QuantifiedInterpolants, 5485928 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 42 InterpolantComputations, 35 PerfectInterpolantSequences, 46512/46694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...