java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:31:16,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:31:16,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:31:16,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:31:16,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:31:16,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:31:16,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:31:16,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:31:16,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:31:16,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:31:16,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:31:16,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:31:16,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:31:16,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:31:16,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:31:16,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:31:16,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:31:16,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:31:16,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:31:16,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:31:16,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:31:16,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:31:16,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:31:16,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:31:16,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:31:16,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:31:16,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:31:16,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:31:16,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:31:16,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:31:16,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:31:16,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:31:16,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:31:16,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:31:16,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:31:16,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:31:16,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:31:16,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:31:16,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:31:16,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:31:16,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:31:16,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:31:16,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:31:16,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:31:16,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:31:16,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:31:16,417 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:31:16,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:31:16,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:31:16,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:31:16,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:31:16,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:31:16,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:31:16,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:31:16,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:31:16,419 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:31:16,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:31:16,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:31:16,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:31:16,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:31:16,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:31:16,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:31:16,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:31:16,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:16,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:31:16,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:31:16,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:31:16,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:31:16,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:31:16,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:31:16,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:31:16,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:31:16,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:31:16,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:31:16,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:31:16,721 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:31:16,722 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-10-15 03:31:16,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db4c72e4/5bd09296d1034c7c9a3497ec520600b6/FLAG0f9749ad8 [2019-10-15 03:31:17,327 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:31:17,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-15 03:31:17,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db4c72e4/5bd09296d1034c7c9a3497ec520600b6/FLAG0f9749ad8 [2019-10-15 03:31:17,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db4c72e4/5bd09296d1034c7c9a3497ec520600b6 [2019-10-15 03:31:17,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:31:17,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:31:17,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:17,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:31:17,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:31:17,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:17" (1/1) ... [2019-10-15 03:31:17,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e48f3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:17, skipping insertion in model container [2019-10-15 03:31:17,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:17" (1/1) ... [2019-10-15 03:31:17,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:31:17,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:18,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:18,044 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:18,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:18,248 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:18,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18 WrapperNode [2019-10-15 03:31:18,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:18,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:18,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:18,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:18,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... [2019-10-15 03:31:18,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:18,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:18,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:18,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:18,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:18,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:18,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:18,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 03:31:18,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:31:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:31:18,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:31:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 03:31:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:18,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:18,660 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:31:19,162 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 03:31:19,162 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 03:31:19,424 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:19,425 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:31:19,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:19 BoogieIcfgContainer [2019-10-15 03:31:19,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:19,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:19,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:19,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:19,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:31:17" (1/3) ... [2019-10-15 03:31:19,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36210755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:19, skipping insertion in model container [2019-10-15 03:31:19,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:18" (2/3) ... [2019-10-15 03:31:19,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36210755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:19, skipping insertion in model container [2019-10-15 03:31:19,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:19" (3/3) ... [2019-10-15 03:31:19,435 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-15 03:31:19,445 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:19,454 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:19,466 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:19,509 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:19,509 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:19,510 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:19,510 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:19,510 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:19,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:19,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:19,510 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2019-10-15 03:31:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:31:19,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:19,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:19,545 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1372086724, now seen corresponding path program 1 times [2019-10-15 03:31:19,560 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:19,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630097987] [2019-10-15 03:31:19,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:19,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:19,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:19,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630097987] [2019-10-15 03:31:19,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:19,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:19,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559416748] [2019-10-15 03:31:19,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:19,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:19,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:19,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:19,826 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 3 states. [2019-10-15 03:31:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:19,920 INFO L93 Difference]: Finished difference Result 226 states and 380 transitions. [2019-10-15 03:31:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:19,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 03:31:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:19,952 INFO L225 Difference]: With dead ends: 226 [2019-10-15 03:31:19,952 INFO L226 Difference]: Without dead ends: 207 [2019-10-15 03:31:19,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-15 03:31:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-10-15 03:31:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-15 03:31:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2019-10-15 03:31:20,091 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 45 [2019-10-15 03:31:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:20,092 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2019-10-15 03:31:20,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2019-10-15 03:31:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:31:20,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:20,099 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:20,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 957934719, now seen corresponding path program 1 times [2019-10-15 03:31:20,100 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:20,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865570062] [2019-10-15 03:31:20,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:20,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:20,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:20,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865570062] [2019-10-15 03:31:20,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:20,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:20,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480163916] [2019-10-15 03:31:20,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:20,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:20,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:20,217 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand 3 states. [2019-10-15 03:31:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:20,454 INFO L93 Difference]: Finished difference Result 330 states and 501 transitions. [2019-10-15 03:31:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:20,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 03:31:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:20,458 INFO L225 Difference]: With dead ends: 330 [2019-10-15 03:31:20,458 INFO L226 Difference]: Without dead ends: 229 [2019-10-15 03:31:20,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-15 03:31:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-10-15 03:31:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-15 03:31:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2019-10-15 03:31:20,493 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 59 [2019-10-15 03:31:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:20,494 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2019-10-15 03:31:20,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2019-10-15 03:31:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:31:20,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:20,503 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:20,504 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1666864660, now seen corresponding path program 1 times [2019-10-15 03:31:20,506 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:20,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313361937] [2019-10-15 03:31:20,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:20,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:20,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 03:31:20,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313361937] [2019-10-15 03:31:20,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:20,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:20,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575626195] [2019-10-15 03:31:20,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:20,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:20,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:20,697 INFO L87 Difference]: Start difference. First operand 225 states and 332 transitions. Second operand 4 states. [2019-10-15 03:31:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:20,914 INFO L93 Difference]: Finished difference Result 532 states and 816 transitions. [2019-10-15 03:31:20,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:20,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 03:31:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:20,918 INFO L225 Difference]: With dead ends: 532 [2019-10-15 03:31:20,918 INFO L226 Difference]: Without dead ends: 315 [2019-10-15 03:31:20,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-15 03:31:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 301. [2019-10-15 03:31:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-15 03:31:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 416 transitions. [2019-10-15 03:31:20,935 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 416 transitions. Word has length 76 [2019-10-15 03:31:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:20,938 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 416 transitions. [2019-10-15 03:31:20,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 416 transitions. [2019-10-15 03:31:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 03:31:20,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:20,942 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-15 03:31:20,942 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1133337646, now seen corresponding path program 1 times [2019-10-15 03:31:20,944 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:20,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370707608] [2019-10-15 03:31:20,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:20,945 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:20,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 03:31:21,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370707608] [2019-10-15 03:31:21,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:21,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:21,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897381489] [2019-10-15 03:31:21,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:21,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:21,064 INFO L87 Difference]: Start difference. First operand 301 states and 416 transitions. Second operand 3 states. [2019-10-15 03:31:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:21,220 INFO L93 Difference]: Finished difference Result 660 states and 940 transitions. [2019-10-15 03:31:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:21,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-15 03:31:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:21,228 INFO L225 Difference]: With dead ends: 660 [2019-10-15 03:31:21,228 INFO L226 Difference]: Without dead ends: 367 [2019-10-15 03:31:21,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-15 03:31:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 347. [2019-10-15 03:31:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-15 03:31:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 468 transitions. [2019-10-15 03:31:21,247 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 468 transitions. Word has length 96 [2019-10-15 03:31:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:21,248 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 468 transitions. [2019-10-15 03:31:21,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 468 transitions. [2019-10-15 03:31:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 03:31:21,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:21,250 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:21,250 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1132987575, now seen corresponding path program 1 times [2019-10-15 03:31:21,251 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:21,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705514053] [2019-10-15 03:31:21,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:21,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:21,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:21,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705514053] [2019-10-15 03:31:21,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389823328] [2019-10-15 03:31:21,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:21,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:31:21,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:21,521 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:21,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:21,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-15 03:31:21,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:21,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 7 [2019-10-15 03:31:21,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792285232] [2019-10-15 03:31:21,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:21,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:21,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:21,618 INFO L87 Difference]: Start difference. First operand 347 states and 468 transitions. Second operand 3 states. [2019-10-15 03:31:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:21,647 INFO L93 Difference]: Finished difference Result 684 states and 926 transitions. [2019-10-15 03:31:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:21,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-15 03:31:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:21,652 INFO L225 Difference]: With dead ends: 684 [2019-10-15 03:31:21,652 INFO L226 Difference]: Without dead ends: 682 [2019-10-15 03:31:21,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-15 03:31:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-10-15 03:31:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-15 03:31:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 922 transitions. [2019-10-15 03:31:21,673 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 922 transitions. Word has length 114 [2019-10-15 03:31:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:21,674 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 922 transitions. [2019-10-15 03:31:21,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 922 transitions. [2019-10-15 03:31:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 03:31:21,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:21,677 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:21,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:21,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1179716728, now seen corresponding path program 1 times [2019-10-15 03:31:21,885 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:21,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511361878] [2019-10-15 03:31:21,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:21,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:21,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 03:31:21,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511361878] [2019-10-15 03:31:21,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:21,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:21,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399607873] [2019-10-15 03:31:21,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:21,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:21,970 INFO L87 Difference]: Start difference. First operand 680 states and 922 transitions. Second operand 3 states. [2019-10-15 03:31:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:22,171 INFO L93 Difference]: Finished difference Result 1548 states and 2184 transitions. [2019-10-15 03:31:22,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:22,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 03:31:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:22,182 INFO L225 Difference]: With dead ends: 1548 [2019-10-15 03:31:22,182 INFO L226 Difference]: Without dead ends: 876 [2019-10-15 03:31:22,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2019-10-15 03:31:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 836. [2019-10-15 03:31:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-15 03:31:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1102 transitions. [2019-10-15 03:31:22,207 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1102 transitions. Word has length 148 [2019-10-15 03:31:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:22,208 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1102 transitions. [2019-10-15 03:31:22,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1102 transitions. [2019-10-15 03:31:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 03:31:22,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:22,211 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:22,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1248685626, now seen corresponding path program 2 times [2019-10-15 03:31:22,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:22,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559740470] [2019-10-15 03:31:22,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-15 03:31:22,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559740470] [2019-10-15 03:31:22,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:22,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:22,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128975671] [2019-10-15 03:31:22,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:22,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:22,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:22,292 INFO L87 Difference]: Start difference. First operand 836 states and 1102 transitions. Second operand 3 states. [2019-10-15 03:31:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:22,520 INFO L93 Difference]: Finished difference Result 1860 states and 2544 transitions. [2019-10-15 03:31:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:22,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 03:31:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:22,526 INFO L225 Difference]: With dead ends: 1860 [2019-10-15 03:31:22,526 INFO L226 Difference]: Without dead ends: 1032 [2019-10-15 03:31:22,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-10-15 03:31:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 984. [2019-10-15 03:31:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-15 03:31:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1274 transitions. [2019-10-15 03:31:22,557 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1274 transitions. Word has length 148 [2019-10-15 03:31:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:22,558 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1274 transitions. [2019-10-15 03:31:22,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1274 transitions. [2019-10-15 03:31:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 03:31:22,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:22,562 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:22,562 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash 265462632, now seen corresponding path program 1 times [2019-10-15 03:31:22,563 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:22,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315899204] [2019-10-15 03:31:22,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-15 03:31:22,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315899204] [2019-10-15 03:31:22,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:22,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:22,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741102817] [2019-10-15 03:31:22,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:22,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:22,626 INFO L87 Difference]: Start difference. First operand 984 states and 1274 transitions. Second operand 3 states. [2019-10-15 03:31:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:22,783 INFO L93 Difference]: Finished difference Result 2092 states and 2776 transitions. [2019-10-15 03:31:22,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:22,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-15 03:31:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:22,789 INFO L225 Difference]: With dead ends: 2092 [2019-10-15 03:31:22,790 INFO L226 Difference]: Without dead ends: 1116 [2019-10-15 03:31:22,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-10-15 03:31:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1084. [2019-10-15 03:31:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-10-15 03:31:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1386 transitions. [2019-10-15 03:31:22,825 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1386 transitions. Word has length 154 [2019-10-15 03:31:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:22,830 INFO L462 AbstractCegarLoop]: Abstraction has 1084 states and 1386 transitions. [2019-10-15 03:31:22,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1386 transitions. [2019-10-15 03:31:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-15 03:31:22,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:22,835 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:22,836 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 426251506, now seen corresponding path program 1 times [2019-10-15 03:31:22,837 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:22,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362718203] [2019-10-15 03:31:22,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:22,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-15 03:31:22,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362718203] [2019-10-15 03:31:22,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:22,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:22,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399608813] [2019-10-15 03:31:22,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:22,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:22,931 INFO L87 Difference]: Start difference. First operand 1084 states and 1386 transitions. Second operand 3 states. [2019-10-15 03:31:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:23,135 INFO L93 Difference]: Finished difference Result 2370 states and 3126 transitions. [2019-10-15 03:31:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:23,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-15 03:31:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:23,142 INFO L225 Difference]: With dead ends: 2370 [2019-10-15 03:31:23,143 INFO L226 Difference]: Without dead ends: 1290 [2019-10-15 03:31:23,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-15 03:31:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1272. [2019-10-15 03:31:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-10-15 03:31:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1682 transitions. [2019-10-15 03:31:23,203 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1682 transitions. Word has length 157 [2019-10-15 03:31:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:23,206 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 1682 transitions. [2019-10-15 03:31:23,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1682 transitions. [2019-10-15 03:31:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-15 03:31:23,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:23,212 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:23,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash -229976780, now seen corresponding path program 1 times [2019-10-15 03:31:23,213 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:23,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726512372] [2019-10-15 03:31:23,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-15 03:31:23,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726512372] [2019-10-15 03:31:23,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:23,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:23,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466310086] [2019-10-15 03:31:23,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:23,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:23,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:23,288 INFO L87 Difference]: Start difference. First operand 1272 states and 1682 transitions. Second operand 3 states. [2019-10-15 03:31:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:23,454 INFO L93 Difference]: Finished difference Result 2652 states and 3552 transitions. [2019-10-15 03:31:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:23,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-15 03:31:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:23,461 INFO L225 Difference]: With dead ends: 2652 [2019-10-15 03:31:23,461 INFO L226 Difference]: Without dead ends: 1388 [2019-10-15 03:31:23,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2019-10-15 03:31:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1380. [2019-10-15 03:31:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2019-10-15 03:31:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1802 transitions. [2019-10-15 03:31:23,527 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1802 transitions. Word has length 176 [2019-10-15 03:31:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:23,528 INFO L462 AbstractCegarLoop]: Abstraction has 1380 states and 1802 transitions. [2019-10-15 03:31:23,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1802 transitions. [2019-10-15 03:31:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-15 03:31:23,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:23,534 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:23,534 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1024383711, now seen corresponding path program 1 times [2019-10-15 03:31:23,535 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:23,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945710853] [2019-10-15 03:31:23,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-15 03:31:23,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945710853] [2019-10-15 03:31:23,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:23,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:31:23,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823833768] [2019-10-15 03:31:23,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:31:23,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:23,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:31:23,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:23,601 INFO L87 Difference]: Start difference. First operand 1380 states and 1802 transitions. Second operand 3 states. [2019-10-15 03:31:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:23,821 INFO L93 Difference]: Finished difference Result 2868 states and 3800 transitions. [2019-10-15 03:31:23,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:23,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-15 03:31:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:23,831 INFO L225 Difference]: With dead ends: 2868 [2019-10-15 03:31:23,832 INFO L226 Difference]: Without dead ends: 1496 [2019-10-15 03:31:23,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:31:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-10-15 03:31:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2019-10-15 03:31:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-10-15 03:31:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1930 transitions. [2019-10-15 03:31:23,900 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1930 transitions. Word has length 181 [2019-10-15 03:31:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:23,901 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 1930 transitions. [2019-10-15 03:31:23,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:31:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1930 transitions. [2019-10-15 03:31:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-15 03:31:23,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:23,907 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:23,907 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1787630570, now seen corresponding path program 1 times [2019-10-15 03:31:23,908 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:23,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248551507] [2019-10-15 03:31:23,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:23,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 303 proven. 25 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-15 03:31:24,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248551507] [2019-10-15 03:31:24,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734680953] [2019-10-15 03:31:24,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:24,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:24,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-10-15 03:31:24,358 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-10-15 03:31:24,413 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:24,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [4] total 7 [2019-10-15 03:31:24,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440723802] [2019-10-15 03:31:24,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:31:24,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:24,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:31:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:24,415 INFO L87 Difference]: Start difference. First operand 1496 states and 1930 transitions. Second operand 5 states. [2019-10-15 03:31:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:24,834 INFO L93 Difference]: Finished difference Result 3092 states and 3976 transitions. [2019-10-15 03:31:24,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:31:24,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-10-15 03:31:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:24,842 INFO L225 Difference]: With dead ends: 3092 [2019-10-15 03:31:24,842 INFO L226 Difference]: Without dead ends: 1440 [2019-10-15 03:31:24,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:31:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-10-15 03:31:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1390. [2019-10-15 03:31:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-10-15 03:31:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1806 transitions. [2019-10-15 03:31:24,905 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1806 transitions. Word has length 208 [2019-10-15 03:31:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:24,905 INFO L462 AbstractCegarLoop]: Abstraction has 1390 states and 1806 transitions. [2019-10-15 03:31:24,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:31:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1806 transitions. [2019-10-15 03:31:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-15 03:31:24,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:24,911 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:25,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:25,124 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:25,125 INFO L82 PathProgramCache]: Analyzing trace with hash -311669261, now seen corresponding path program 1 times [2019-10-15 03:31:25,126 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:25,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994057165] [2019-10-15 03:31:25,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:25,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 442 proven. 25 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-10-15 03:31:25,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994057165] [2019-10-15 03:31:25,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952126326] [2019-10-15 03:31:25,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:25,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:31:25,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 442 proven. 25 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-10-15 03:31:25,392 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 442 proven. 25 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-10-15 03:31:25,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1839651901] [2019-10-15 03:31:25,590 INFO L162 IcfgInterpreter]: Started Sifa with 74 locations of interest [2019-10-15 03:31:25,590 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:31:25,605 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:31:25,615 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:31:25,616 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:31:25,659 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:31:25,669 INFO L199 IcfgInterpreter]: Interpreting procedure ssl3_accept with input of size 3 for LOIs [2019-10-15 03:31:39,654 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 267 [2019-10-15 03:31:39,853 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 277