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_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:25,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:25,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:25,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:25,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:25,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:25,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:25,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:25,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:25,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:25,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:25,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:25,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:25,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:25,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:25,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:25,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:25,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:25,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:25,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:25,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:25,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:25,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:25,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:25,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:25,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:25,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:25,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:25,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:25,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:25,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:25,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:25,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:25,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:25,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:25,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:25,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:25,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:25,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:25,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:25,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:25,713 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-10-03 04:09:25,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:25,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:25,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:25,734 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:25,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:25,735 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:25,735 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:25,735 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:25,735 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:25,735 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:25,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:25,737 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:25,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:25,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:25,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:25,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:25,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:25,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:25,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:25,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:25,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:25,740 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:25,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:25,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:25,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:25,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:25,741 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:25,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:25,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:25,742 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:25,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:25,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:25,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:25,818 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:25,819 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:25,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-03 04:09:25,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178f505c5/83fa4d3433324a7a93fed22130a41934/FLAG0f6aed6e9 [2019-10-03 04:09:26,375 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:26,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-03 04:09:26,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178f505c5/83fa4d3433324a7a93fed22130a41934/FLAG0f6aed6e9 [2019-10-03 04:09:26,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178f505c5/83fa4d3433324a7a93fed22130a41934 [2019-10-03 04:09:26,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:26,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:26,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:26,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:26,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:26,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:26" (1/1) ... [2019-10-03 04:09:26,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4abb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:26, skipping insertion in model container [2019-10-03 04:09:26,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:26" (1/1) ... [2019-10-03 04:09:26,699 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:26,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:27,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:27,246 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:27,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:27,368 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:27,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27 WrapperNode [2019-10-03 04:09:27,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:27,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:27,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:27,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:27,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (1/1) ... [2019-10-03 04:09:27,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:27,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:27,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:27,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:27,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (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-03 04:09:27,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:27,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:27,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-03 04:09:27,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:09:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:09:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:09:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-03 04:09:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:27,767 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:09:28,300 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-03 04:09:28,300 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-03 04:09:28,302 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:28,303 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:09:28,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:28 BoogieIcfgContainer [2019-10-03 04:09:28,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:28,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:28,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:28,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:28,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:26" (1/3) ... [2019-10-03 04:09:28,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13848b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:28, skipping insertion in model container [2019-10-03 04:09:28,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:27" (2/3) ... [2019-10-03 04:09:28,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13848b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:28, skipping insertion in model container [2019-10-03 04:09:28,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:28" (3/3) ... [2019-10-03 04:09:28,313 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-10-03 04:09:28,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:28,331 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:28,348 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:28,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:28,372 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:28,372 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:28,372 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:28,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:28,373 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:28,373 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:28,373 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-10-03 04:09:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:09:28,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:28,407 INFO L411 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] [2019-10-03 04:09:28,409 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-10-03 04:09:28,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:28,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:28,709 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-03 04:09:28,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:28,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:28,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:28,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:28,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:28,740 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-10-03 04:09:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:29,199 INFO L93 Difference]: Finished difference Result 206 states and 347 transitions. [2019-10-03 04:09:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:29,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-03 04:09:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:29,214 INFO L225 Difference]: With dead ends: 206 [2019-10-03 04:09:29,214 INFO L226 Difference]: Without dead ends: 185 [2019-10-03 04:09:29,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-03 04:09:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-03 04:09:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-03 04:09:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-10-03 04:09:29,275 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-10-03 04:09:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:29,276 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-10-03 04:09:29,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-10-03 04:09:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 04:09:29,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:29,279 INFO L411 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] [2019-10-03 04:09:29,279 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-10-03 04:09:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:29,422 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-03 04:09:29,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:29,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:29,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:29,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:29,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:29,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:29,426 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-10-03 04:09:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:29,735 INFO L93 Difference]: Finished difference Result 224 states and 368 transitions. [2019-10-03 04:09:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:29,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-03 04:09:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:29,739 INFO L225 Difference]: With dead ends: 224 [2019-10-03 04:09:29,740 INFO L226 Difference]: Without dead ends: 224 [2019-10-03 04:09:29,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-03 04:09:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-03 04:09:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-03 04:09:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-03 04:09:29,768 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-10-03 04:09:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:29,769 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-03 04:09:29,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-03 04:09:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 04:09:29,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:29,774 INFO L411 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] [2019-10-03 04:09:29,775 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-10-03 04:09:29,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:29,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:29,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:29,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:29,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:29,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:29,872 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-03 04:09:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:30,129 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-10-03 04:09:30,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:30,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-03 04:09:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:30,131 INFO L225 Difference]: With dead ends: 247 [2019-10-03 04:09:30,132 INFO L226 Difference]: Without dead ends: 247 [2019-10-03 04:09:30,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-03 04:09:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-03 04:09:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-03 04:09:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-03 04:09:30,144 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-10-03 04:09:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:30,144 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-03 04:09:30,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-03 04:09:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 04:09:30,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:30,148 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:30,148 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, now seen corresponding path program 1 times [2019-10-03 04:09:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:30,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:30,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:30,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:30,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:30,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:30,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:30,238 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-03 04:09:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:30,505 INFO L93 Difference]: Finished difference Result 285 states and 480 transitions. [2019-10-03 04:09:30,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:30,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-03 04:09:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:30,508 INFO L225 Difference]: With dead ends: 285 [2019-10-03 04:09:30,508 INFO L226 Difference]: Without dead ends: 285 [2019-10-03 04:09:30,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-03 04:09:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-03 04:09:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-03 04:09:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-10-03 04:09:30,518 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-10-03 04:09:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:30,519 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-10-03 04:09:30,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-10-03 04:09:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 04:09:30,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:30,524 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:30,524 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-10-03 04:09:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:30,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:30,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:30,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:30,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:30,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:30,611 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-10-03 04:09:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:30,847 INFO L93 Difference]: Finished difference Result 285 states and 478 transitions. [2019-10-03 04:09:30,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:30,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-03 04:09:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:30,849 INFO L225 Difference]: With dead ends: 285 [2019-10-03 04:09:30,850 INFO L226 Difference]: Without dead ends: 285 [2019-10-03 04:09:30,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-03 04:09:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-03 04:09:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-03 04:09:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-10-03 04:09:30,858 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-10-03 04:09:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:30,859 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-10-03 04:09:30,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-10-03 04:09:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 04:09:30,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:30,861 INFO L411 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] [2019-10-03 04:09:30,861 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-10-03 04:09:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:30,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:30,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:30,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:30,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:30,963 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-10-03 04:09:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:31,167 INFO L93 Difference]: Finished difference Result 300 states and 500 transitions. [2019-10-03 04:09:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:31,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-03 04:09:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:31,169 INFO L225 Difference]: With dead ends: 300 [2019-10-03 04:09:31,170 INFO L226 Difference]: Without dead ends: 300 [2019-10-03 04:09:31,170 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:31,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-03 04:09:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-03 04:09:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-03 04:09:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-03 04:09:31,178 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-10-03 04:09:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:31,178 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-03 04:09:31,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-03 04:09:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 04:09:31,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:31,180 INFO L411 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] [2019-10-03 04:09:31,180 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-10-03 04:09:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:31,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:31,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:31,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:31,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:31,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:31,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:31,277 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-10-03 04:09:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:31,437 INFO L93 Difference]: Finished difference Result 300 states and 496 transitions. [2019-10-03 04:09:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:31,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-03 04:09:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:31,439 INFO L225 Difference]: With dead ends: 300 [2019-10-03 04:09:31,439 INFO L226 Difference]: Without dead ends: 300 [2019-10-03 04:09:31,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-03 04:09:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-03 04:09:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-03 04:09:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-10-03 04:09:31,447 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-10-03 04:09:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:31,448 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-10-03 04:09:31,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-10-03 04:09:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 04:09:31,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:31,450 INFO L411 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] [2019-10-03 04:09:31,450 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-10-03 04:09:31,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 04:09:31,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:31,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:31,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:31,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:31,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:31,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:31,498 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-10-03 04:09:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:31,659 INFO L93 Difference]: Finished difference Result 307 states and 500 transitions. [2019-10-03 04:09:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:31,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-03 04:09:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:31,661 INFO L225 Difference]: With dead ends: 307 [2019-10-03 04:09:31,661 INFO L226 Difference]: Without dead ends: 307 [2019-10-03 04:09:31,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-03 04:09:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-03 04:09:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-03 04:09:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-10-03 04:09:31,669 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-10-03 04:09:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:31,669 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-10-03 04:09:31,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-10-03 04:09:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 04:09:31,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:31,671 INFO L411 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] [2019-10-03 04:09:31,671 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-10-03 04:09:31,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:31,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:31,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:31,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:31,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:31,731 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-10-03 04:09:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:31,950 INFO L93 Difference]: Finished difference Result 338 states and 549 transitions. [2019-10-03 04:09:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:31,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-03 04:09:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:31,952 INFO L225 Difference]: With dead ends: 338 [2019-10-03 04:09:31,953 INFO L226 Difference]: Without dead ends: 338 [2019-10-03 04:09:31,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-03 04:09:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-03 04:09:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-03 04:09:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-03 04:09:31,964 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-10-03 04:09:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:31,965 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-03 04:09:31,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-03 04:09:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 04:09:31,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:31,967 INFO L411 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] [2019-10-03 04:09:31,967 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-10-03 04:09:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:31,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:31,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:32,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:32,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:32,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:32,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:32,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:32,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:32,036 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 5 states. [2019-10-03 04:09:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:32,235 INFO L93 Difference]: Finished difference Result 338 states and 545 transitions. [2019-10-03 04:09:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:32,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-03 04:09:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:32,239 INFO L225 Difference]: With dead ends: 338 [2019-10-03 04:09:32,239 INFO L226 Difference]: Without dead ends: 338 [2019-10-03 04:09:32,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-03 04:09:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-03 04:09:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-03 04:09:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-10-03 04:09:32,256 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-10-03 04:09:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:32,258 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-10-03 04:09:32,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-10-03 04:09:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 04:09:32,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:32,263 INFO L411 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] [2019-10-03 04:09:32,263 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-10-03 04:09:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:32,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:32,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:32,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:32,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:32,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:32,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:32,315 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-10-03 04:09:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:32,506 INFO L93 Difference]: Finished difference Result 371 states and 598 transitions. [2019-10-03 04:09:32,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:32,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-03 04:09:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:32,509 INFO L225 Difference]: With dead ends: 371 [2019-10-03 04:09:32,509 INFO L226 Difference]: Without dead ends: 371 [2019-10-03 04:09:32,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-03 04:09:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-03 04:09:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-03 04:09:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-10-03 04:09:32,520 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-10-03 04:09:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:32,521 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-10-03 04:09:32,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-10-03 04:09:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 04:09:32,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:32,523 INFO L411 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] [2019-10-03 04:09:32,524 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-10-03 04:09:32,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:32,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:32,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:32,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:32,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:32,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:32,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:32,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:32,579 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-10-03 04:09:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:32,778 INFO L93 Difference]: Finished difference Result 371 states and 593 transitions. [2019-10-03 04:09:32,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:32,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 04:09:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:32,780 INFO L225 Difference]: With dead ends: 371 [2019-10-03 04:09:32,781 INFO L226 Difference]: Without dead ends: 371 [2019-10-03 04:09:32,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-03 04:09:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-03 04:09:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-03 04:09:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-10-03 04:09:32,791 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-10-03 04:09:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:32,791 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-10-03 04:09:32,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-10-03 04:09:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 04:09:32,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:32,794 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:32,794 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-10-03 04:09:32,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:32,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:32,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 04:09:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:32,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:32,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:32,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:32,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:32,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:32,857 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-10-03 04:09:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:33,071 INFO L93 Difference]: Finished difference Result 399 states and 635 transitions. [2019-10-03 04:09:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:33,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-03 04:09:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:33,074 INFO L225 Difference]: With dead ends: 399 [2019-10-03 04:09:33,074 INFO L226 Difference]: Without dead ends: 399 [2019-10-03 04:09:33,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-03 04:09:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-03 04:09:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-03 04:09:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-10-03 04:09:33,084 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-10-03 04:09:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:33,084 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-10-03 04:09:33,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-10-03 04:09:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 04:09:33,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:33,086 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:33,087 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-10-03 04:09:33,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:33,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 04:09:33,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:33,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:33,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:33,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:33,143 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-10-03 04:09:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:33,341 INFO L93 Difference]: Finished difference Result 399 states and 632 transitions. [2019-10-03 04:09:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:33,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-03 04:09:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:33,345 INFO L225 Difference]: With dead ends: 399 [2019-10-03 04:09:33,345 INFO L226 Difference]: Without dead ends: 399 [2019-10-03 04:09:33,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-03 04:09:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-03 04:09:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-03 04:09:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-10-03 04:09:33,357 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-10-03 04:09:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:33,358 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-10-03 04:09:33,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-10-03 04:09:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 04:09:33,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:33,361 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:33,361 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-10-03 04:09:33,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:33,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:33,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:33,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:33,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:33,446 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-10-03 04:09:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:33,656 INFO L93 Difference]: Finished difference Result 444 states and 703 transitions. [2019-10-03 04:09:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:33,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-03 04:09:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:33,659 INFO L225 Difference]: With dead ends: 444 [2019-10-03 04:09:33,659 INFO L226 Difference]: Without dead ends: 444 [2019-10-03 04:09:33,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-03 04:09:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-10-03 04:09:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-03 04:09:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-10-03 04:09:33,672 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-10-03 04:09:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:33,672 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-10-03 04:09:33,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-10-03 04:09:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 04:09:33,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:33,674 INFO L411 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, 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-10-03 04:09:33,675 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-10-03 04:09:33,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:33,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:33,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:33,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:33,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:33,729 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-10-03 04:09:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:33,975 INFO L93 Difference]: Finished difference Result 448 states and 709 transitions. [2019-10-03 04:09:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:33,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-10-03 04:09:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:33,980 INFO L225 Difference]: With dead ends: 448 [2019-10-03 04:09:33,980 INFO L226 Difference]: Without dead ends: 446 [2019-10-03 04:09:33,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-03 04:09:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-10-03 04:09:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-03 04:09:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-10-03 04:09:33,993 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-10-03 04:09:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:33,994 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-10-03 04:09:33,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-10-03 04:09:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-03 04:09:33,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:33,996 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:33,996 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-10-03 04:09:33,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:33,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:09:34,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:34,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:34,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:34,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:34,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:34,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:34,060 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-10-03 04:09:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:34,241 INFO L93 Difference]: Finished difference Result 479 states and 754 transitions. [2019-10-03 04:09:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:34,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-03 04:09:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:34,244 INFO L225 Difference]: With dead ends: 479 [2019-10-03 04:09:34,244 INFO L226 Difference]: Without dead ends: 479 [2019-10-03 04:09:34,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-03 04:09:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-03 04:09:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 04:09:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-10-03 04:09:34,254 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-10-03 04:09:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:34,255 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-10-03 04:09:34,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-10-03 04:09:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 04:09:34,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:34,257 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:34,257 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:34,258 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-10-03 04:09:34,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:34,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:34,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:34,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:34,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:09:34,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:34,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:34,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:34,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:34,321 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-10-03 04:09:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:34,521 INFO L93 Difference]: Finished difference Result 479 states and 746 transitions. [2019-10-03 04:09:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:34,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-03 04:09:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:34,525 INFO L225 Difference]: With dead ends: 479 [2019-10-03 04:09:34,525 INFO L226 Difference]: Without dead ends: 479 [2019-10-03 04:09:34,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-03 04:09:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-03 04:09:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 04:09:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-10-03 04:09:34,535 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-10-03 04:09:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:34,535 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-10-03 04:09:34,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-10-03 04:09:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 04:09:34,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:34,538 INFO L411 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, 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] [2019-10-03 04:09:34,538 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-10-03 04:09:34,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:34,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-03 04:09:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:34,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:34,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:34,592 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-10-03 04:09:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:34,848 INFO L93 Difference]: Finished difference Result 470 states and 725 transitions. [2019-10-03 04:09:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:34,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-03 04:09:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:34,852 INFO L225 Difference]: With dead ends: 470 [2019-10-03 04:09:34,853 INFO L226 Difference]: Without dead ends: 470 [2019-10-03 04:09:34,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-03 04:09:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-03 04:09:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 04:09:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-10-03 04:09:34,869 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-10-03 04:09:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:34,870 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-10-03 04:09:34,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-10-03 04:09:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 04:09:34,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:34,875 INFO L411 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, 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] [2019-10-03 04:09:34,875 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-10-03 04:09:34,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:34,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:34,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-03 04:09:34,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:34,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:34,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:34,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:34,981 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-10-03 04:09:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:35,300 INFO L93 Difference]: Finished difference Result 470 states and 720 transitions. [2019-10-03 04:09:35,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:35,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-03 04:09:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:35,304 INFO L225 Difference]: With dead ends: 470 [2019-10-03 04:09:35,304 INFO L226 Difference]: Without dead ends: 470 [2019-10-03 04:09:35,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-03 04:09:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-03 04:09:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 04:09:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-10-03 04:09:35,320 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-10-03 04:09:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:35,321 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-10-03 04:09:35,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-10-03 04:09:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 04:09:35,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:35,324 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:35,324 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-10-03 04:09:35,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:35,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:35,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-03 04:09:35,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:35,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:35,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:35,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:35,450 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-10-03 04:09:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:35,625 INFO L93 Difference]: Finished difference Result 494 states and 751 transitions. [2019-10-03 04:09:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:35,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 04:09:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:35,629 INFO L225 Difference]: With dead ends: 494 [2019-10-03 04:09:35,629 INFO L226 Difference]: Without dead ends: 494 [2019-10-03 04:09:35,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-03 04:09:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-03 04:09:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-03 04:09:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-10-03 04:09:35,641 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-10-03 04:09:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:35,641 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-10-03 04:09:35,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-10-03 04:09:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 04:09:35,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:35,646 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:35,646 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-10-03 04:09:35,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:35,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:35,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-03 04:09:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:35,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:35,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:35,718 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-10-03 04:09:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:35,905 INFO L93 Difference]: Finished difference Result 494 states and 742 transitions. [2019-10-03 04:09:35,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:35,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-03 04:09:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:35,911 INFO L225 Difference]: With dead ends: 494 [2019-10-03 04:09:35,911 INFO L226 Difference]: Without dead ends: 494 [2019-10-03 04:09:35,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-03 04:09:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-03 04:09:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-03 04:09:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-10-03 04:09:35,928 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-10-03 04:09:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:35,929 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-10-03 04:09:35,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-10-03 04:09:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 04:09:35,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:35,933 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:35,933 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-10-03 04:09:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:35,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:35,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-03 04:09:36,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:36,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:36,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:36,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:36,018 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-10-03 04:09:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:36,216 INFO L93 Difference]: Finished difference Result 537 states and 801 transitions. [2019-10-03 04:09:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:36,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-03 04:09:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:36,220 INFO L225 Difference]: With dead ends: 537 [2019-10-03 04:09:36,220 INFO L226 Difference]: Without dead ends: 537 [2019-10-03 04:09:36,220 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-03 04:09:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-10-03 04:09:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-03 04:09:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-10-03 04:09:36,235 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-10-03 04:09:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:36,236 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-10-03 04:09:36,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-10-03 04:09:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 04:09:36,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:36,239 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:36,239 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-10-03 04:09:36,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:36,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:36,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:36,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-03 04:09:36,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:36,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:36,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:36,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:36,324 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-10-03 04:09:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:36,550 INFO L93 Difference]: Finished difference Result 537 states and 799 transitions. [2019-10-03 04:09:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:36,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-03 04:09:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:36,556 INFO L225 Difference]: With dead ends: 537 [2019-10-03 04:09:36,556 INFO L226 Difference]: Without dead ends: 518 [2019-10-03 04:09:36,558 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-03 04:09:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-10-03 04:09:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-03 04:09:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-10-03 04:09:36,578 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-10-03 04:09:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:36,578 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-10-03 04:09:36,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-10-03 04:09:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-03 04:09:36,582 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:36,582 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:36,582 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-10-03 04:09:36,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:36,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-03 04:09:36,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:36,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:36,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:36,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:36,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:36,677 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-10-03 04:09:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:36,850 INFO L93 Difference]: Finished difference Result 537 states and 792 transitions. [2019-10-03 04:09:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:36,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-03 04:09:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:36,853 INFO L225 Difference]: With dead ends: 537 [2019-10-03 04:09:36,853 INFO L226 Difference]: Without dead ends: 537 [2019-10-03 04:09:36,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-03 04:09:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-10-03 04:09:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-03 04:09:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-10-03 04:09:36,868 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-10-03 04:09:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:36,868 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-10-03 04:09:36,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-10-03 04:09:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-03 04:09:36,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:36,871 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:36,871 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-10-03 04:09:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:36,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:36,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-03 04:09:36,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:36,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:36,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:36,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:36,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:36,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:36,936 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-10-03 04:09:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:37,107 INFO L93 Difference]: Finished difference Result 537 states and 781 transitions. [2019-10-03 04:09:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:37,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-03 04:09:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:37,110 INFO L225 Difference]: With dead ends: 537 [2019-10-03 04:09:37,110 INFO L226 Difference]: Without dead ends: 535 [2019-10-03 04:09:37,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-03 04:09:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-10-03 04:09:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-03 04:09:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-10-03 04:09:37,121 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-10-03 04:09:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:37,121 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-10-03 04:09:37,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-10-03 04:09:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-03 04:09:37,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:37,124 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:37,125 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-10-03 04:09:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:37,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-03 04:09:37,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:37,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:37,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-10-03 04:09:37,221 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], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [479], [484], [487], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:37,269 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:37,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:37,583 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:38,597 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:38,599 INFO L272 AbstractInterpreter]: Visited 80 different actions 1678 times. Merged at 69 different actions 1442 times. Widened at 17 different actions 223 times. Performed 3735 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3735 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 136 fixpoints after 19 different actions. Largest state had 95 variables. [2019-10-03 04:09:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:38,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:38,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:38,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:38,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:38,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:38,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:09:38,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-03 04:09:38,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-03 04:09:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:38,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-03 04:09:38,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:38,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:38,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:38,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:38,872 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 3 states. [2019-10-03 04:09:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:38,936 INFO L93 Difference]: Finished difference Result 1047 states and 1518 transitions. [2019-10-03 04:09:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:38,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-03 04:09:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:38,941 INFO L225 Difference]: With dead ends: 1047 [2019-10-03 04:09:38,942 INFO L226 Difference]: Without dead ends: 1047 [2019-10-03 04:09:38,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-10-03 04:09:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2019-10-03 04:09:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-03 04:09:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1518 transitions. [2019-10-03 04:09:38,964 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1518 transitions. Word has length 187 [2019-10-03 04:09:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:38,964 INFO L475 AbstractCegarLoop]: Abstraction has 1047 states and 1518 transitions. [2019-10-03 04:09:38,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1518 transitions. [2019-10-03 04:09:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 04:09:38,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:38,968 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:38,968 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash -845275759, now seen corresponding path program 1 times [2019-10-03 04:09:38,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:38,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:38,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-03 04:09:39,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:39,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:39,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:39,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:39,032 INFO L87 Difference]: Start difference. First operand 1047 states and 1518 transitions. Second operand 3 states. [2019-10-03 04:09:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:39,087 INFO L93 Difference]: Finished difference Result 1557 states and 2254 transitions. [2019-10-03 04:09:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:39,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-03 04:09:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:39,095 INFO L225 Difference]: With dead ends: 1557 [2019-10-03 04:09:39,095 INFO L226 Difference]: Without dead ends: 1557 [2019-10-03 04:09:39,095 INFO L640 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-03 04:09:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2019-10-03 04:09:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2019-10-03 04:09:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-03 04:09:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2254 transitions. [2019-10-03 04:09:39,123 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2254 transitions. Word has length 194 [2019-10-03 04:09:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:39,124 INFO L475 AbstractCegarLoop]: Abstraction has 1557 states and 2254 transitions. [2019-10-03 04:09:39,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2254 transitions. [2019-10-03 04:09:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 04:09:39,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:39,128 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:39,128 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash -977462684, now seen corresponding path program 1 times [2019-10-03 04:09:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-03 04:09:39,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:39,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:39,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:39,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:39,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:39,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:39,183 INFO L87 Difference]: Start difference. First operand 1557 states and 2254 transitions. Second operand 3 states. [2019-10-03 04:09:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:39,232 INFO L93 Difference]: Finished difference Result 2068 states and 2991 transitions. [2019-10-03 04:09:39,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:39,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-03 04:09:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:39,242 INFO L225 Difference]: With dead ends: 2068 [2019-10-03 04:09:39,242 INFO L226 Difference]: Without dead ends: 2068 [2019-10-03 04:09:39,242 INFO L640 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-03 04:09:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-10-03 04:09:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2019-10-03 04:09:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2019-10-03 04:09:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2991 transitions. [2019-10-03 04:09:39,278 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2991 transitions. Word has length 195 [2019-10-03 04:09:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:39,278 INFO L475 AbstractCegarLoop]: Abstraction has 2068 states and 2991 transitions. [2019-10-03 04:09:39,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2991 transitions. [2019-10-03 04:09:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-03 04:09:39,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:39,287 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:09:39,287 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1729777908, now seen corresponding path program 1 times [2019-10-03 04:09:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-03 04:09:39,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:39,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:39,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:39,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:39,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:39,481 INFO L87 Difference]: Start difference. First operand 2068 states and 2991 transitions. Second operand 3 states. [2019-10-03 04:09:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:39,506 INFO L93 Difference]: Finished difference Result 3643 states and 5252 transitions. [2019-10-03 04:09:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:39,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-10-03 04:09:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:39,523 INFO L225 Difference]: With dead ends: 3643 [2019-10-03 04:09:39,523 INFO L226 Difference]: Without dead ends: 3643 [2019-10-03 04:09:39,524 INFO L640 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-03 04:09:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-10-03 04:09:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3641. [2019-10-03 04:09:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-10-03 04:09:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5251 transitions. [2019-10-03 04:09:39,587 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5251 transitions. Word has length 344 [2019-10-03 04:09:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:39,587 INFO L475 AbstractCegarLoop]: Abstraction has 3641 states and 5251 transitions. [2019-10-03 04:09:39,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5251 transitions. [2019-10-03 04:09:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-03 04:09:39,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:39,601 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:39,601 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1198848905, now seen corresponding path program 1 times [2019-10-03 04:09:39,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:39,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:39,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-03 04:09:39,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:39,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:39,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:39,716 INFO L87 Difference]: Start difference. First operand 3641 states and 5251 transitions. Second operand 3 states. [2019-10-03 04:09:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:39,849 INFO L93 Difference]: Finished difference Result 3801 states and 5443 transitions. [2019-10-03 04:09:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:39,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-10-03 04:09:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:39,861 INFO L225 Difference]: With dead ends: 3801 [2019-10-03 04:09:39,861 INFO L226 Difference]: Without dead ends: 2504 [2019-10-03 04:09:39,861 INFO L640 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-03 04:09:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-10-03 04:09:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2019-10-03 04:09:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-03 04:09:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3558 transitions. [2019-10-03 04:09:39,905 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3558 transitions. Word has length 381 [2019-10-03 04:09:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:39,905 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3558 transitions. [2019-10-03 04:09:39,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3558 transitions. [2019-10-03 04:09:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-03 04:09:39,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:39,913 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:39,914 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1350004073, now seen corresponding path program 1 times [2019-10-03 04:09:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:39,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:39,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-03 04:09:40,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:40,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:40,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2019-10-03 04:09:40,113 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], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [530], [535], [537], [540], [542], [545], [558], [561], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:40,123 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:40,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:40,198 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:41,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:41,507 INFO L272 AbstractInterpreter]: Visited 105 different actions 2170 times. Merged at 91 different actions 1789 times. Widened at 19 different actions 280 times. Performed 5058 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5058 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 249 fixpoints after 24 different actions. Largest state had 97 variables. [2019-10-03 04:09:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:41,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:41,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:41,508 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-10-03 04:09:41,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:41,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:41,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:41,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-03 04:09:41,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-03 04:09:42,068 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:42,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:09:42,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:42,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:42,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:42,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:42,071 INFO L87 Difference]: Start difference. First operand 2504 states and 3558 transitions. Second operand 3 states. [2019-10-03 04:09:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:42,092 INFO L93 Difference]: Finished difference Result 2075 states and 2951 transitions. [2019-10-03 04:09:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:42,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-03 04:09:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:42,105 INFO L225 Difference]: With dead ends: 2075 [2019-10-03 04:09:42,105 INFO L226 Difference]: Without dead ends: 2075 [2019-10-03 04:09:42,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2019-10-03 04:09:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2017. [2019-10-03 04:09:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-10-03 04:09:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2866 transitions. [2019-10-03 04:09:42,155 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2866 transitions. Word has length 447 [2019-10-03 04:09:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:42,156 INFO L475 AbstractCegarLoop]: Abstraction has 2017 states and 2866 transitions. [2019-10-03 04:09:42,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2866 transitions. [2019-10-03 04:09:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-03 04:09:42,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:42,163 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:42,163 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1991023065, now seen corresponding path program 1 times [2019-10-03 04:09:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:42,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:42,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:42,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-03 04:09:42,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:42,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:42,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2019-10-03 04:09:42,339 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], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [530], [535], [537], [540], [542], [545], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:42,349 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:42,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:42,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:43,824 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:43,825 INFO L272 AbstractInterpreter]: Visited 104 different actions 2387 times. Merged at 91 different actions 1979 times. Widened at 19 different actions 313 times. Performed 5498 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 274 fixpoints after 27 different actions. Largest state had 97 variables. [2019-10-03 04:09:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:43,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:43,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:43,825 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-10-03 04:09:43,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:43,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:43,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:43,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-10-03 04:09:44,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-10-03 04:09:44,208 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:44,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:09:44,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:44,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:44,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:44,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:44,210 INFO L87 Difference]: Start difference. First operand 2017 states and 2866 transitions. Second operand 3 states. [2019-10-03 04:09:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:44,266 INFO L93 Difference]: Finished difference Result 2486 states and 3534 transitions. [2019-10-03 04:09:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:44,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-03 04:09:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:44,288 INFO L225 Difference]: With dead ends: 2486 [2019-10-03 04:09:44,288 INFO L226 Difference]: Without dead ends: 2486 [2019-10-03 04:09:44,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-10-03 04:09:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2019-10-03 04:09:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-10-03 04:09:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3534 transitions. [2019-10-03 04:09:44,331 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3534 transitions. Word has length 447 [2019-10-03 04:09:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:44,332 INFO L475 AbstractCegarLoop]: Abstraction has 2486 states and 3534 transitions. [2019-10-03 04:09:44,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3534 transitions. [2019-10-03 04:09:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-10-03 04:09:44,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:44,340 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:44,340 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -213147291, now seen corresponding path program 1 times [2019-10-03 04:09:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:44,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:44,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-03 04:09:44,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:44,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:44,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2019-10-03 04:09:44,510 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], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [530], [535], [537], [540], [542], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:44,512 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:44,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:44,613 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:45,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:45,886 INFO L272 AbstractInterpreter]: Visited 105 different actions 2373 times. Merged at 91 different actions 1968 times. Widened at 19 different actions 305 times. Performed 5426 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5426 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 267 fixpoints after 29 different actions. Largest state had 97 variables. [2019-10-03 04:09:45,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:45,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:45,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:45,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:45,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:45,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:46,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-10-03 04:09:46,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-10-03 04:09:46,251 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:46,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:09:46,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:46,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:46,253 INFO L87 Difference]: Start difference. First operand 2486 states and 3534 transitions. Second operand 3 states. [2019-10-03 04:09:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:46,306 INFO L93 Difference]: Finished difference Result 2995 states and 4254 transitions. [2019-10-03 04:09:46,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:46,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2019-10-03 04:09:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:46,314 INFO L225 Difference]: With dead ends: 2995 [2019-10-03 04:09:46,314 INFO L226 Difference]: Without dead ends: 2995 [2019-10-03 04:09:46,314 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-10-03 04:09:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2995. [2019-10-03 04:09:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2995 states. [2019-10-03 04:09:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4254 transitions. [2019-10-03 04:09:46,360 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 4254 transitions. Word has length 448 [2019-10-03 04:09:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:46,361 INFO L475 AbstractCegarLoop]: Abstraction has 2995 states and 4254 transitions. [2019-10-03 04:09:46,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4254 transitions. [2019-10-03 04:09:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-03 04:09:46,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:46,368 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:46,369 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:46,369 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-10-03 04:09:46,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:46,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:46,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:46,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:46,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-03 04:09:46,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:46,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:46,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 450 with the following transitions: [2019-10-03 04:09:46,526 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], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [519], [522], [530], [535], [537], [540], [542], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:46,528 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:46,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:46,574 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:47,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:47,879 INFO L272 AbstractInterpreter]: Visited 106 different actions 2292 times. Merged at 92 different actions 1902 times. Widened at 19 different actions 295 times. Performed 5226 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 254 fixpoints after 22 different actions. Largest state had 97 variables. [2019-10-03 04:09:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:47,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:47,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:47,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:47,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:47,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:47,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:48,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-03 04:09:48,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-03 04:09:48,186 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:48,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:09:48,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:48,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:48,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:48,188 INFO L87 Difference]: Start difference. First operand 2995 states and 4254 transitions. Second operand 3 states. [2019-10-03 04:09:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:48,247 INFO L93 Difference]: Finished difference Result 3463 states and 4921 transitions. [2019-10-03 04:09:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:48,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-03 04:09:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:48,255 INFO L225 Difference]: With dead ends: 3463 [2019-10-03 04:09:48,255 INFO L226 Difference]: Without dead ends: 3463 [2019-10-03 04:09:48,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2019-10-03 04:09:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3463. [2019-10-03 04:09:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2019-10-03 04:09:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4921 transitions. [2019-10-03 04:09:48,304 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4921 transitions. Word has length 449 [2019-10-03 04:09:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:48,304 INFO L475 AbstractCegarLoop]: Abstraction has 3463 states and 4921 transitions. [2019-10-03 04:09:48,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4921 transitions. [2019-10-03 04:09:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-03 04:09:48,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:48,315 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:48,315 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-10-03 04:09:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:48,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:48,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-03 04:09:48,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:48,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:48,593 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 601 with the following transitions: [2019-10-03 04:09:48,593 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], [479], [482], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [519], [522], [530], [535], [537], [540], [542], [545], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:48,594 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:48,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:48,637 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:49,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:49,432 INFO L272 AbstractInterpreter]: Visited 109 different actions 2424 times. Merged at 96 different actions 1957 times. Widened at 19 different actions 304 times. Performed 5622 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 327 fixpoints after 27 different actions. Largest state had 97 variables. [2019-10-03 04:09:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:49,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:49,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:49,433 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:49,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:49,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:49,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:49,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-03 04:09:49,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-03 04:09:49,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:09:49,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:09:49,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:09:49,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:49,972 INFO L87 Difference]: Start difference. First operand 3463 states and 4921 transitions. Second operand 4 states. [2019-10-03 04:09:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:50,220 INFO L93 Difference]: Finished difference Result 3458 states and 4704 transitions. [2019-10-03 04:09:50,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:50,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-10-03 04:09:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:50,228 INFO L225 Difference]: With dead ends: 3458 [2019-10-03 04:09:50,228 INFO L226 Difference]: Without dead ends: 3381 [2019-10-03 04:09:50,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 1200 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-10-03 04:09:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-10-03 04:09:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3104. [2019-10-03 04:09:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-03 04:09:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-10-03 04:09:50,265 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 600 [2019-10-03 04:09:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:50,265 INFO L475 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-10-03 04:09:50,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-10-03 04:09:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-10-03 04:09:50,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:50,281 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:50,282 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:50,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-10-03 04:09:50,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:50,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:50,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:50,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:50,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-03 04:09:50,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:50,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:50,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 1021 with the following transitions: [2019-10-03 04:09:50,893 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], [482], [484], [487], [489], [495], [500], [502], [504], [509], [512], [514], [517], [519], [522], [530], [535], [537], [540], [542], [545], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-10-03 04:09:50,914 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:50,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:50,953 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:52,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:52,114 INFO L272 AbstractInterpreter]: Visited 121 different actions 2818 times. Merged at 105 different actions 2224 times. Widened at 22 different actions 362 times. Performed 6833 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6833 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 420 fixpoints after 29 different actions. Largest state had 101 variables. [2019-10-03 04:09:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:52,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:52,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:52,115 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:52,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:52,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:52,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:52,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-03 04:09:53,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:09:53,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:09:53,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:09:53,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:09:53,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:53,584 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 4 states. [2019-10-03 04:09:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:53,779 INFO L93 Difference]: Finished difference Result 4128 states and 5642 transitions. [2019-10-03 04:09:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:09:53,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1020 [2019-10-03 04:09:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:53,787 INFO L225 Difference]: With dead ends: 4128 [2019-10-03 04:09:53,788 INFO L226 Difference]: Without dead ends: 3944 [2019-10-03 04:09:53,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2045 GetRequests, 2040 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-10-03 04:09:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2019-10-03 04:09:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3104. [2019-10-03 04:09:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-03 04:09:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-10-03 04:09:53,826 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 1020 [2019-10-03 04:09:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:53,827 INFO L475 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-10-03 04:09:53,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-10-03 04:09:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1271 [2019-10-03 04:09:53,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:53,846 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:53,846 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1521228414, now seen corresponding path program 1 times [2019-10-03 04:09:53,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:53,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:53,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-10-03 04:09:54,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:54,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:54,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:54,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:54,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:54,529 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 3 states. [2019-10-03 04:09:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:54,642 INFO L93 Difference]: Finished difference Result 3254 states and 4421 transitions. [2019-10-03 04:09:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:54,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1270 [2019-10-03 04:09:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:54,649 INFO L225 Difference]: With dead ends: 3254 [2019-10-03 04:09:54,649 INFO L226 Difference]: Without dead ends: 3230 [2019-10-03 04:09:54,650 INFO L640 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-03 04:09:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-10-03 04:09:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3160. [2019-10-03 04:09:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3160 states. [2019-10-03 04:09:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4313 transitions. [2019-10-03 04:09:54,684 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4313 transitions. Word has length 1270 [2019-10-03 04:09:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:54,685 INFO L475 AbstractCegarLoop]: Abstraction has 3160 states and 4313 transitions. [2019-10-03 04:09:54,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4313 transitions. [2019-10-03 04:09:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2019-10-03 04:09:54,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:54,705 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-03 04:09:54,706 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 492000992, now seen corresponding path program 1 times [2019-10-03 04:09:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:54,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:54,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-10-03 04:09:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:55,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:55,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:55,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:55,576 INFO L87 Difference]: Start difference. First operand 3160 states and 4313 transitions. Second operand 3 states. [2019-10-03 04:09:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:55,693 INFO L93 Difference]: Finished difference Result 1026 states and 1337 transitions. [2019-10-03 04:09:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:55,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1300 [2019-10-03 04:09:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:55,695 INFO L225 Difference]: With dead ends: 1026 [2019-10-03 04:09:55,695 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:09:55,695 INFO L640 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-03 04:09:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:09:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:09:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:09:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:09:55,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1300 [2019-10-03 04:09:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:55,696 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:09:55,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:09:55,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:09:55,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:09:55 BoogieIcfgContainer [2019-10-03 04:09:55,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:09:55,704 INFO L168 Benchmark]: Toolchain (without parser) took 29021.79 ms. Allocated memory was 131.6 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 86.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 314.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:55,705 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:09:55,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.59 ms. Allocated memory was 131.6 MB in the beginning and 199.2 MB in the end (delta: 67.6 MB). Free memory was 86.2 MB in the beginning and 171.6 MB in the end (delta: -85.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:55,708 INFO L168 Benchmark]: Boogie Preprocessor took 55.43 ms. Allocated memory is still 199.2 MB. Free memory was 171.6 MB in the beginning and 168.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:55,709 INFO L168 Benchmark]: RCFGBuilder took 879.04 ms. Allocated memory is still 199.2 MB. Free memory was 168.9 MB in the beginning and 117.4 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:55,710 INFO L168 Benchmark]: TraceAbstraction took 27395.90 ms. Allocated memory was 199.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 116.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 277.4 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:55,721 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.97 ms. Allocated memory is still 131.6 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.59 ms. Allocated memory was 131.6 MB in the beginning and 199.2 MB in the end (delta: 67.6 MB). Free memory was 86.2 MB in the beginning and 171.6 MB in the end (delta: -85.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.43 ms. Allocated memory is still 199.2 MB. Free memory was 171.6 MB in the beginning and 168.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.04 ms. Allocated memory is still 199.2 MB. Free memory was 168.9 MB in the beginning and 117.4 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27395.90 ms. Allocated memory was 199.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 116.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 277.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 631]: 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, 155 locations, 1 error locations. SAFE Result, 27.3s OverallTime, 39 OverallIterations, 46 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7680 SDtfs, 12425 SDslu, 6773 SDs, 0 SdLazy, 5109 SolverSat, 1380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7395 GetRequests, 7259 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3641occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.0s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 1367 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 13857 NumberOfCodeBlocks, 13857 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 17402 ConstructedInterpolants, 0 QuantifiedInterpolants, 12996139 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5884 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 53 InterpolantComputations, 42 PerfectInterpolantSequences, 116684/116970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...